Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Linear Separability in Spatial Databases   Given two point sets $R$ and $B$ in the plane, with cardinalities $m$ and
$n$, respectively, and each set stored in a separate R-tree, we present an
algorithm to decide whether $R$ and $B$ are linearly separable. Our algorithm
exploits the structure of the R-trees, loading into the main memory only
relevant data, and runs in $O(m\log m + n\log n)$ time in the worst case. As
experimental results, we implement the proposed algorithm and executed it on
several real and synthetic point sets, showing that the percentage of nodes of
the R-trees that are accessed and the memory usage are low in these cases. We
also present an algorithm to compute the convex hull of $n$ planar points given
in an R-tree, running in $O(n\log n)$ time in the worst case.

12
The categories of this paper are: nucl-th
22
The categories of this paper are: chao-dyn
34
The categories of this paper are: chem-ph
8
The categories of this paper are: hep-ex
37
The categories of this paper are: supr-con
23
The categories of this paper are: solv-int
24
The categories of this paper are: dg-ga
26
The categories of this paper are: bayes-an
36
The categories of this paper are: cmp-lg
2
The categories of this paper are: math
11
The categories of this paper are: hep-lat
16
The categories of this paper are: stat
0
The categories of this paper are: hep-ph
15
The categories of this paper are: nucl-ex
31
The categories of this paper are: ao-sci
10
The categories of this paper are: q-bio