Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Farthest-Polygon Voronoi Diagrams   Given a family of k disjoint connected polygonal sites in general position
and of total complexity n, we consider the farthest-site Voronoi diagram of
these sites, where the distance to a site is the distance to a closest point on
it. We show that the complexity of this diagram is O(n), and give an O(n log^3
n) time algorithm to compute it. We also prove a number of structural
properties of this diagram. In particular, a Voronoi region may consist of k-1
connected components, but if one component is bounded, then it is equal to the
entire region.

16
The categories of this paper are: stat
27
The categories of this paper are: comp-gas
24
The categories of this paper are: dg-ga
15
The categories of this paper are: nucl-ex
35
The categories of this paper are: mtrl-th
20
The categories of this paper are: acc-phys
11
The categories of this paper are: hep-lat
23
The categories of this paper are: solv-int
8
The categories of this paper are: hep-ex
21
The categories of this paper are: adap-org
33
The categories of this paper are: plasm-ph
34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
2
The categories of this paper are: math