On k-Sets in Arrangements of Curves and Surfaces.
Almost Tight Upper Bounds for Lower Envelopes in Higher Dimensions.
Guest Editor's Foreword.
Castles in the Air Revisited.
On the Number of Views of Polyhedral Terrains.
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions.
Applications of a New Space-Partitioning Technique.
An Efficient Motion-Planning Algorithm for a Convex Polygonal Object in Two-Dimensional Polygonal Space.
New Bounds for Lower Envelopes in Three Dimensions, with Applications to Visibility in Terrains.
The Maximum Number of Ways To Stab n Convex Nonintersecting Sets in the Plane Is 2n - 2*.
The Complexity of Many Cells in Arrangements of Planes and Related Problems.
The Complexity and Construction of Many Faces in Arrangements of Lines and of Segments.
Computing the Geodesic Center of a Simple Polygon.
Separating Two Simple Polygons by a Sequence of Translations.
On the Zone of a Surface in a Hyperplane Arrangement.
An Elementary Approach to Lower Bounds in Geometric Discrepancy.
The Upper Envelope of Voronoi Surfaces and Its Applications.
Combinatorial Complexity Bounds for Arrangements of Curves and Spheres.
Diameter, Width, Closest Line Pair, and Parametric Searching.
Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions.
Page 1 Next