Editor's Foreword (Special Issue on the ACM Symposium). B. Chazelle — 1989 Discrete & computational geometry
An Optimal Convex Hull Algorithm in Any Fixed Dimension. B. Chazelle — 1993 Discrete & computational geometry
Quasi-Optimal Range Searching in Spaces of Finite VC-Dimension. B. Chazelle; Emo Welzl — 1989 Discrete & computational geometry
Linear Space Data Structures for Two Types of Range Search. B. Chazelle; Herbert Edelsbrunner — 1987 Discrete & computational geometry
Halfspace Range Search: An Algorithmic Application of k-Sets. B. Chazelle; F.P. Preparata — 1986 Discrete & computational geometry
Bounds on the Size of Tetrahedralizations. B. Chazelle; N. Shouraboura — 1995 Discrete & computational geometry
How Hard Is Half-Space Range Searching? J. Pach; B. Chazelle; H. Brönnimann — 1993 Discrete & computational geometry
An Elementary Approach to Lower Bounds in Geometric Discrepancy. B. Chazelle; M. Sharir; J. Matousek — 1995 Discrete & computational geometry
Visibility and Intersection Problems in Plane Geometry. B. Chazelle; Leonidas J. Guibas — 1989 Discrete & computational geometry
Diameter, Width, Closest Line Pair, and Parametric Searching. H. Edelsbrunner; B. Chazelle; M. Sharir; L. Guibas — 1993 Discrete & computational geometry
The Complexity of Cutting Complexes. B. Chazelle; Herbert Edelsbrunner; Guibas Leonidas J. — 1989 Discrete & computational geometry
Improved Bounds on Weak e-Nets for Convex Sets. H. Edelsbrunner; B. Chazelle; E. Welzl; M. Sharir; L. Guibas; M. Grigni — 1995 Discrete & computational geometry
Points and Triangles in the Plane and Halving Planes in Space. H. Edelsbrunner; B. Chazelle; L.J. Guibas; M. Sharir; R. Wenger; B. Aronov — 1991 Discrete & computational geometry