On degrees in random triangulations of point sets
From MaRDI portal
(Redirected from Publication:549246)
Recommendations
Cites work
- scientific article; zbMATH DE number 5506218 (Why is no real title available?)
- scientific article; zbMATH DE number 1268810 (Why is no real title available?)
- scientific article; zbMATH DE number 1409186 (Why is no real title available?)
- A better upper bound on the number of triangulations of a planar point set
- A lower bound on the number of triangulations of planar point sets
- A pattern of asymptotic vertex valency distributions in planar maps
- Counting triangulations of planar point sets
- Crossing-Free Subgraphs
- Maximal biconnected subgraphs of random planar graphs
- Note on the number of triangulations of planar point sets
- Number of crossing-free geometric graphs vs. Triangulations
- Random planar graphs
- The four-colour theorem
- The number of planar graphs and properties of random planar graphs
Cited in
(13)- Counting plane graphs: cross-graph charging schemes
- Random triangulations of planar points sets
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
- Many empty triangles have a common edge
- On degrees in random triangulations of point sets
- On the stabbing number of a random Delaunay triangulation
- On numbers of pseudo-triangulations
- Counting triangulations and other crossing-free structures via onion layers
- An exact algorithm for the minimum dilation triangulation problem
- A note on point location in Delaunay triangulations of random points
- A QPTAS for the base of the number of crossing-free structures on a planar point set
- The Mathematics of Ferran Hurtado: A Brief Survey
- Counting triangulations and other crossing-free structures approximately
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 Q549246)