On shape Delaunay tessellations
DOI10.1016/J.IPL.2014.04.007zbMATH Open1371.68287OpenAlexW2015792336MaRDI QIDQ2015147FDOQ2015147
Franz Aurenhammer, Günter Paulini
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
Recommendations
computational geometryDelaunay triangulationrecognitionconvex distance functionflippingproximity graphs
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Two-Dimensional Voronoi Diagrams in the L p -Metric
- There are planar graphs almost as good as the complete graph
- Minimal enclosing discs, circumcircles, and circumcenters in normed planes. I.
- Title not available (Why is that?)
- On the stretch factor of convex Delaunay graphs
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- Kinetic stable Delaunay graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simple and efficient kinetic spanner
Cited In (7)
- Hamiltonicity for convex shape Delaunay and Gabriel graphs
- Delaunay triangulations approximate anchor hulls
- Delaunay polytopes derived from the Leech lattice
- From solid to plane tessellations, and back
- Gibbs Delaunay tessellations with geometric hardcore conditions
- Affine invariant triangulations
- Title not available (Why is that?)
Uses Software
This page was built for publication: On shape Delaunay tessellations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2015147)
