Orphan-free anisotropic Voronoi diagrams

DOI10.1007/s00454-011-9372-6zbMath1228.90150OpenAlexW2105043586MaRDI QIDQ644827

Guillermo D. Canas, Steven J. Gortler

Publication date: 7 November 2011

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00454-011-9372-6

zbMATH Keywords

Riemannian metricanisotropyVoronoi diagramepsilon-netsorphanfree

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

Related Items (2)

Constrained clustering via diagrams: a unified theory and its application to electoral district design ⋮ Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Clustering to minimize the maximum intercluster distance
• Building triangulations using ε-nets
• Asymptotic estimates for best and stepwise approximation of convex bodies I
• Anisotropic Centroidal Voronoi Tessellations and Their Applications
• Delaunay triangulations and Voronoi diagrams for Riemannian manifolds
• Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation

This page was built for publication: Orphan-free anisotropic Voronoi diagrams