On degrees in random triangulations of point sets

DOI10.1145/1810959.1811009zbMath1284.05247OpenAlexW1988809014MaRDI QIDQ5405894

Adam Sheffer, Ermo Welzl, Micha Sharir

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

countingplane graphsrandom triangulationsdegree sequencescrossing-free geometric graphschargingnumber of triangulatons

Mathematics Subject Classification ID

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

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