150
click to vote
COMPGEOM
15 years 6 months ago
1995 ACM 
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
130
click to vote
COMPGEOM
15 years 6 months ago
1995 ACM 
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
125
click to vote
COMPGEOM
15 years 6 months ago
1995 ACM 
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
119
click to vote
COMPGEOM
15 years 6 months ago
1995 ACM 
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
115
click to vote
COMPGEOM
15 years 6 months ago
1995 ACM 
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
|
Discrete Geometry