Implicitly representing arrangements of lines or segments

Cutting hyperplane arrangements

SCG '90 Proceedings of the sixth annual symposium on Computational geometry

Range searching with efficient hierarchical cuttings

SCG '92 Proceedings of the eighth annual symposium on Computational geometry

Computational geometry: a retrospective

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Geometric range searching

ACM Computing Surveys (CSUR)

New lower bounds for Hopcroft's problem

Proceedings of the eleventh annual symposium on Computational geometry

Queries with segments in Voronoi diagrams

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Compact interval trees: a data structure for convex hulls

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms

Testing Homotopy for paths in the plane

Proceedings of the eighteenth annual symposium on Computational geometry

On counting point-hyperplane incidences

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01

Optimal partition trees

Proceedings of the twenty-sixth annual symposium on Computational geometry

Computing similarity between piecewise-linear functions

Proceedings of the twenty-sixth annual symposium on Computational geometry