Recognizing Dirichlet tesselations

DOI10.1007/BF00181470zbMath0572.52022OpenAlexW2045293233MaRDI QIDQ1062284

Peter F. Ash, Ethan D. Bolker

Publication date: 1985

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00181470

zbMATH Keywords

Dirichlet tessellationclosed convex polyhedron

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (13)

Solving Linear Programming with Constraints Unknown ⋮ Recognising polytopical cell complexes and constructing projection polyhedra ⋮ Action centers of planigons ⋮ Power diagram detection with applications to information elicitation ⋮ Fitting Spherical Laguerre Voronoi Diagrams to Real-World Tessellations Using Planar Photographic Images ⋮ Axioms for Euclidean preferences with a valence dimension ⋮ A relationship between Gale transforms and Voronoi diagrams ⋮ The inverse Voronoi problem in graphs. I: Hardness ⋮ Categorization generated by extended prototypes -- an axiomatic approach ⋮ On the recognition and reconstruction of weighted Voronoi diagrams and bisector graphs ⋮ Toughness and Delaunay triangulations ⋮ The complexity of finding minimal Voronoi covers with applications to machine learning ⋮ Generalized Dirichlet tesselations

This page was built for publication: Recognizing Dirichlet tesselations