On degrees in random triangulations of point sets

DOI10.1145/1810959.1811009MaRDI QIDQ5405894zbMATH OpenOpenAlexFDO

Authors Adam Sheffer, Micha Sharir, Emo Welzl

Publication date 3 April 2014

Published in Proceedings of the twenty-sixth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1810959.1811009

zbMATH Keywords

chargingcountingcrossing-free geometric graphsdegree sequencesnumber of triangulatonsplane graphsrandom triangulations

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80) Combinatorial geometries and geometric closure systems (51D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• On degrees in random triangulations of point sets
• Random triangulations of planar points sets
• A lower bound on the number of triangulations of planar point sets
• THE EXPECTED EXTREMES IN A DELAUNAY TRIANGULATION
• scientific article; zbMATH DE number 176773

Cited in

(6)

• A note on point location in Delaunay triangulations of random points
• On typical triangulations of a convex \(n\)-gon
• Many empty triangles have a common edge
• Random triangulations of planar points sets
• On degrees in random triangulations of point sets
• On the stabbing number of a random Delaunay triangulation

This page was built for publication: On degrees in random triangulations of point sets

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