Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Circular Separability of Polygons   Two planar sets are circularly separable if there exists a circle enclosing
one of the sets and whose open interior disk does not intersect the other set.
  This paper studies two problems related to circular separability. A
linear-time algorithm is proposed to decide if two polygons are circularly
separable. The algorithm outputs the smallest separating circle. The second
problem asks for the largest circle included in a preprocessed, convex polygon,
under some point and/or line constraints. The resulting circle must contain the
query points and it must lie in the halfplanes delimited by the query lines.

7
The categories of this paper are: hep-th
2
The categories of this paper are: math
23
The categories of this paper are: solv-int
14
The categories of this paper are: math-ph
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
20
The categories of this paper are: acc-phys
29
The categories of this paper are: funct-an
12
The categories of this paper are: nucl-th
27
The categories of this paper are: comp-gas
8
The categories of this paper are: hep-ex
24
The categories of this paper are: dg-ga
17
The categories of this paper are: q-fin