Orphan-Free Anisotropic Voronoi Diagrams
classification
💻 cs.CG
keywords
anisotropicconditionssitesvoronoialgorithmsalreadyappropriately-definedapproximation
read the original abstract
We describe conditions under which an appropriately-defined anisotropic Voronoi diagram of a set of sites in Euclidean space is guaranteed to be composed of connected cells in any number of dimensions. These conditions are natural for problems in optimization and approximation, and algorithms already exist to produce sets of sites that satisfy them.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.