Voronoi diagrams and arrangements
- 1 March 1986
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 1 (1), 25-44
- https://doi.org/10.1007/bf02187681
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An optimal algorithm for constructing the weighted voronoi diagram in the planePattern Recognition, 1984
- Generalization of Voronoi Diagrams in the PlaneSIAM Journal on Computing, 1981
- Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopesThe Computer Journal, 1981
- Computing Dirichlet tessellationsThe Computer Journal, 1981
- Two-Dimensional Voronoi Diagrams in theLp-MetricJournal of the ACM, 1980
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Finding the intersection of n half-spaces in time O(n log n)Theoretical Computer Science, 1979
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanesMemoirs of the American Mathematical Society, 1975
- The maximum numbers of faces of a convex polytopeMathematika, 1970