AbstractWe introduce a new type of partition called a parallel planes partition. We prove there exists a parallel planes partition of any set of n points in arbitrary dimension. This partition yields a data structure for the half-space retrieval problem in arbitrary dimension; it has linear size and achieves a sublinear query time. Also, we give efficient algorithms for computing this partition
Let P be a set of n points in Rd. A point p ∈ P is k-shallow if it lies in a halfspace which contain...
A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes un...
Sets of points are called separable if their convex hulls are disjoint. We suggest a technique for o...
AbstractWe introduce a new type of partition called a parallel planes partition. We prove there exis...
A new upper bound is given on the number of ways in which a set of N points in R n can be partitione...
A new upper bound is given on the number of ways in which a set of N points in R^n can be partition...
A family of data structures is presented for retrieval of the sum of values of points within a half-...
We derive a lower bound of\Omega n 4=3 ) for the halfspace emptiness problem: Given a set of n p...
We prove a theorem on partitioning point sets in Ed (d fixed) and give an efficient construction of ...
We consider the problem of partitioning sets of n points in d dimensions by means of k intersecting ...
Let P be a set of n points in the Euclidean plane and let C be a convex figure. We study the problem...
AbstractA new upper bound is given on the number of ways in which a set of N points in Rn can be par...
AbstractWe consider the halfspace itrange itreporting problem: given a finite set P of points in Rd,...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
AbstractWe show how to preprocess a set S of points in Rd into an external memory data structure tha...
Let P be a set of n points in Rd. A point p ∈ P is k-shallow if it lies in a halfspace which contain...
A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes un...
Sets of points are called separable if their convex hulls are disjoint. We suggest a technique for o...
AbstractWe introduce a new type of partition called a parallel planes partition. We prove there exis...
A new upper bound is given on the number of ways in which a set of N points in R n can be partitione...
A new upper bound is given on the number of ways in which a set of N points in R^n can be partition...
A family of data structures is presented for retrieval of the sum of values of points within a half-...
We derive a lower bound of\Omega n 4=3 ) for the halfspace emptiness problem: Given a set of n p...
We prove a theorem on partitioning point sets in Ed (d fixed) and give an efficient construction of ...
We consider the problem of partitioning sets of n points in d dimensions by means of k intersecting ...
Let P be a set of n points in the Euclidean plane and let C be a convex figure. We study the problem...
AbstractA new upper bound is given on the number of ways in which a set of N points in Rn can be par...
AbstractWe consider the halfspace itrange itreporting problem: given a finite set P of points in Rd,...
In this paper we give a fast randomized algorithm for finding a partition of the plane induced by a ...
AbstractWe show how to preprocess a set S of points in Rd into an external memory data structure tha...
Let P be a set of n points in Rd. A point p ∈ P is k-shallow if it lies in a halfspace which contain...
A binary space partition is a recursive partitioning of a configuration of objects by hyperplanes un...
Sets of points are called separable if their convex hulls are disjoint. We suggest a technique for o...
DOI
Add to ORKG