A fast voronoi-diagram algorithm with quaternary tree bucketing
Information Processing Letters
There is a planar graph almost as good as the complete graph
SCG '86 Proceedings of the second annual symposium on Computational geometry
SCG '86 Proceedings of the second annual symposium on Computational geometry
On some distance problems in fixed orientations
SIAM Journal on Computing
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
An O(n log n) Algorithm for Rectilinear Minimal Spanning Trees
Journal of the ACM (JACM)
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
Voronoi diagrams based on convex distance functions
SCG '85 Proceedings of the first annual symposium on Computational geometry
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
A Fast Algorithm for Polygon Containment by Translation (Extended Abstract)
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Java applets for the dynamic visualization of Voronoi diagrams
Computer Science in Perspective
Kinetic data structures for all nearest neighbors and closest pair in the plane
Proceedings of the twenty-ninth annual symposium on Computational geometry
| Hi-index | 0.00 |