Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge

DOI10.1137/06067095XMaRDI QIDQ3519393zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Takeshi Tokuyama, Tetsuo Asano, Jiří Matoušek

Publication date 14 August 2008

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/06067095x

zbMATH Keywords

computational geometrydistance trisector curveVoronoi diagramzone diagram

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Zone diagrams: existence, uniqueness and algorithmic challenge
• Zone diagrams in Euclidean spaces and in other normed spaces
• Zone diagrams in Euclidean spaces and in other normed spaces
• Zone diagrams in compact subsets of uniformly convex normed spaces
• Zone and double zone diagrams in abstract spaces

Cited in

(15)

• Fixed points of polarity type operators
• On the computation of zone and double zone diagrams
• Zone diagrams in compact subsets of uniformly convex normed spaces
• A characterization theorem and an algorithm for a convex hull problem
• On properties of forbidden zones of polygons and polytopes
• Zone diagrams: existence, uniqueness and algorithmic challenge
• Mollified zone diagrams and their computation
• Zone diagrams in Euclidean spaces and in other normed spaces
• On the existence of a neutral region. II: The implicit relation case
• Polynomial root-finding methods whose basins of attraction approximate Voronoi diagram
• Zone and double zone diagrams in abstract spaces
• The distance trisector curve
• Zone diagrams in Euclidean spaces and in other normed spaces
• Some theoretical challenges in digital geometry: a perspective
• Distance \(k\)-sectors exist

This page was built for publication: Zone Diagrams: Existence, Uniqueness, and Algorithmic Challenge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519393)