Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: An Expected Linear-Time Algorithm for the Farthest-Segment Voronoi
  Diagram   We present an expected linear-time algorithm to construct the
farthest-segment Voronoi diagram, given the sequence of its faces at infinity.
This sequence forms a Davenport-Schinzel sequence of order 3 and it can be
computed in O(n log n) time, where n is the number of input segments. The
farthest-segment Voronoi diagram is a tree, with disconnected Voronoi regions,
of total complexity Theta(n) in the worst case. Disconnected regions pose a
major difficulty in deriving linear-time construction algorithms for such
tree-like Voronoi diagrams. In this paper we present a new approach towards
this direction.

27
The categories of this paper are: comp-gas
32
The categories of this paper are: atom-ph
36
The categories of this paper are: cmp-lg
17
The categories of this paper are: q-fin
8
The categories of this paper are: hep-ex
35
The categories of this paper are: mtrl-th
2
The categories of this paper are: math
30
The categories of this paper are: q-alg
16
The categories of this paper are: stat
31
The categories of this paper are: ao-sci
15
The categories of this paper are: nucl-ex
0
The categories of this paper are: hep-ph
5
The categories of this paper are: gr-qc
3
The categories of this paper are: physics
33
The categories of this paper are: plasm-ph
4
The categories of this paper are: cond-mat