Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Oblivious Set-maxima for Intersection of Convex Polygons   In this paper we revisit the well known set-maxima problem in the oblivious
setting. Let $X=\{x_1,\ldots, x_n\}$ be a set of $n$ elements with an
underlying total order. Let $\mathcal{S}=\{S_1,\ldots,S_m\}$ be a collection of
$m$ distinct subsets of $X$. The set-maxima problem asks to determine the
maxima of all the sets in the collection. In the comparison tree model we are
interested in determining the number of comparisons necessary and sufficient to
solve the problem. We present an oblivious algorithm based on the lattice
structure of the input set system. Our algorithm is simple and yet for many set
systems gives a non-trivial improvement over known deterministic algorithms. We
apply our algorithm to a special $\cal S$ which is determined by an
intersection structure of convex polygons and show that $O(n)$ comparisons
suffice.

30
The categories of this paper are: q-alg
22
The categories of this paper are: chao-dyn
16
The categories of this paper are: stat
5
The categories of this paper are: gr-qc
10
The categories of this paper are: q-bio
4
The categories of this paper are: cond-mat
6
The categories of this paper are: astro-ph
8
The categories of this paper are: hep-ex
26
The categories of this paper are: bayes-an
35
The categories of this paper are: mtrl-th
17
The categories of this paper are: q-fin
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
2
The categories of this paper are: math
23
The categories of this paper are: solv-int
31
The categories of this paper are: ao-sci