Journal: Discrete and Computational Geometry

Found 29 papers in total
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
Lower bound on testing membership to a polyhedron by algebraic decision and computation trees
1997,
We introduce a new method of proving lower bounds on the depth of algebraic d -degree...
Extremal properties of 0/1-polytopes
Extremal properties of 0/1-polytopes
1997,
We provide lower and upper bounds for the maximal number of facets of a d -dimensional...
Lower bounds for off-line range searching
Lower bounds for off-line range searching
1997,
This paper proves three lower bounds for variants of the following range-searching...
Rectilinear shortest paths in the presence of rectangular barriers
Rectilinear shortest paths in the presence of rectangular barriers
1989,
In this paper the authors address the following shortest-path problem. Given a point...
An O(nlogn) algorithm for the all-nearest-neighbors problem
An O(nlogn) algorithm for the all-nearest-neighbors problem
1989,
Given a set V of n points in k -dimensional space, and an L q -metric (Minkowski...
Papers per page: