On shape Delaunay tessellations

DOI10.1016/j.ipl.2014.04.007zbMath1371.68287OpenAlexW2015792336MaRDI QIDQ2015147

Günter Paulini, Franz Aurenhammer

Publication date: 23 June 2014

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2014.04.007

zbMATH Keywords

recognitioncomputational geometryDelaunay triangulationconvex distance functionflippingproximity graphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

Hamiltonicity for convex shape Delaunay and Gabriel graphs ⋮ Affine invariant triangulations

Uses Software

• Voronoi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
• There are planar graphs almost as good as the complete graph
• On the stretch factor of convex Delaunay graphs
• Primitives for the manipulation of general subdivisions and the computation of Voronoi
• Two-Dimensional Voronoi Diagrams in the L _p -Metric
• Kinetic stable Delaunay graphs
• A simple and efficient kinetic spanner

This page was built for publication: On shape Delaunay tessellations