On the number of higher order Delaunay triangulations

DOI10.1016/j.tcs.2011.03.005zbMath1238.68178OpenAlexW1648170231MaRDI QIDQ551184

Rodrigo I. Silveira, Maria Saumell, Dieter Mitsche

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.005

zbMATH Keywords

computational geometryDelaunay triangulationrandom geometric graphrandom point sethigher order Delaunay triangulation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30) Planar graphs; geometric and topological aspects of graph theory (05C10) Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs (65N50)

Related Items (2)

A distance function for computing on finite subsets of Euclidean spaces ⋮ Some properties of \(k\)-Delaunay and \(k\)-Gabriel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Counting triangulations of planar point sets
• Generating realistic terrains with higher-order Delaunay triangulations
• On the average length of Delaunay triangulations
• The expected size of some graphs in computational geometry
• Higher order Delaunay triangulations
• A better upper bound on the number of triangulations of a planar point set
• Optimization for first order Delaunay triangulations
• On the homogeneous planar Poisson point process
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
• On the expected maximum degree of Gabriel and Yao graphs
• On the number of plane graphs
• Random Geometric Graphs

This page was built for publication: On the number of higher order Delaunay triangulations