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. © 2011 Springer Science+Business Media, LLC.
CITATION STYLE
Canas, G. D., & Gortler, S. J. (2011). Orphan-Free Anisotropic Voronoi Diagrams. Discrete and Computational Geometry, 46(3), 526–541. https://doi.org/10.1007/s00454-011-9372-6
Mendeley helps you to discover research relevant for your work.