An improved lower bound on the minimum number of triangulations

DOI10.4230/LIPIcs.SoCG.2016.7zbMath1387.68228OpenAlexW2468158418MaRDI QIDQ3132839

Bettina Speckmann, Birgit Vogtenhuber, Alexander Pilz, Oswin Aichholzer, Thomas Hackl, Victor Alvarez

Publication date: 30 January 2018

Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.7

zbMATH Keywords

triangulationscombinatorial geometryorder types

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (7)

On crossing-families in planar point sets ⋮ Order on order types ⋮ Computing the flip distance between triangulations ⋮ Counting polygon triangulations is hard ⋮ Counting triangulations of some classes of subdivided convex polygons ⋮ Unnamed Item ⋮ A new lower bound on the maximum number of plane graphs using production matrices

This page was built for publication: An improved lower bound on the minimum number of triangulations