Geometric transforms for fast geometric algorithms

A probabilistic algorithm for the post office problem

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing

On the power of the frame buffer

ACM Transactions on Graphics (TOG)

Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence

Implicitly representing arrangements of lines or segments

SCG '88 Proceedings of the fourth annual symposium on Computational geometry

Good splitters for counting points in triangles

SCG '89 Proceedings of the fifth annual symposium on Computational geometry

Higher-dimensional Voronoi diagrams in linear expected time

SCG '89 Proceedings of the fifth annual symposium on Computational geometry

Computing shortest transversals of sets (extended abstract)

SCG '91 Proceedings of the seventh annual symposium on Computational geometry

Voronoi diagrams—a survey of a fundamental geometric data structure

ACM Computing Surveys (CSUR)

Separating and intersecting spherical polygons: computing machinability on three-, four-, and five-axis numerically controlled machines

ACM Transactions on Graphics (TOG)

A Delaunay based numerical method for three dimensions: generation, formulation, and partition

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Output-sensitive construction of polytopes in four dimensions and clipped Voronoi diagrams in three

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

Computating the width of a set

SCG '85 Proceedings of the first annual symposium on Computational geometry

Voronoi diagrams and arrangements

SCG '85 Proceedings of the first annual symposium on Computational geometry

Approximation algorithms for convex hulls

Communications of the ACM

Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation

IEEE Transactions on Knowledge and Data Engineering

Voronoi diagrams on the sphere

Computational Geometry: Theory and Applications

Determining the Convex Hull in Large Multidimensional Databases

DaWaK '01 Proceedings of the Third International Conference on Data Warehousing and Knowledge Discovery

Almost-Delaunay simplices: nearest neighbor relations for imprecise points

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms

Almost-Delaunay simplices: Robust neighbor relations for imprecise 3D points using CGAL

Computational Geometry: Theory and Applications

Computational Geometry on a Systolic Chip

IEEE Transactions on Computers

Comments on "algorithms for reporting and counting geometric intersections"

IEEE Transactions on Computers

An improved riemannian metric approximation for graph cuts

DGCI'11 Proceedings of the 16th IAPR international conference on Discrete geometry for computer imagery

Robust and efficient delaunay triangulations of points on or close to a sphere

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Computation of non-dominated points using compact voronoi diagrams

WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation