Discrete & Computational Geometry
A Tight Bound for the Delaunay Triangulation of Points on a Polyhedron
Approximating the Fréchet Distance for Realistic Curves in Near Linear Time
Conflict-Free Coloring for Rectangle Ranges Using O(n .382) Colors
Lines Avoiding Balls in Three Dimensions Revisited
Multitriangulations, Pseudotriangulations and Primitive Sorting Networks
On <=k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n
On Levels in Arrangements of Surfaces in Three Dimensions
On the Reconstruction of Planar Lattice-Convex Sets from the Covariogram
The Strong Thirteen Spheres Problem
Triangle Contact Representations and Duality
Unions of Fat Convex Polytopes Have Short Skeletons