1 research outputs found
Linear Separability in Spatial Databases
Given two point sets and in the plane, with cardinalities and
, respectively, and each set stored in a separate R-tree, we present an
algorithm to decide whether and are linearly separable. Our algorithm
exploits the structure of the R-trees, loading into the main memory only
relevant data, and runs in 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 planar points given
in an R-tree, running in time in the worst case