Mollified Zone Diagrams and Their Computation

DOI10.1007/978-3-642-25249-5_2zbMath1250.68279OpenAlexW1821636460MaRDI QIDQ3223918

Bahman Kalantari, Iraj Kalantari, Sergio C. de Biasi

Publication date: 9 March 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25249-5_2

zbMATH Keywords

Voronoi diagramcomputational geometryzone diagrammaximal territory diagrammollified zone diagramterritory diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (6)

Mollified Zone Diagrams and Their Computation ⋮ On the computation of zone and double zone diagrams ⋮ Zone diagrams in compact subsets of uniformly convex normed spaces ⋮ Zone diagrams in Euclidean spaces and in other normed spaces ⋮ Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram ⋮ A characterization theorem and an algorithm for a convex hull problem

Cites Work

• Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram
• Some theoretical challenges in digital geometry: a perspective
• Mollified Zone Diagrams and Their Computation
• Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge

This page was built for publication: Mollified Zone Diagrams and Their Computation