An improved lower bound on the minimum number of triangulations
From MaRDI portal
Publication:3132839
DOI10.4230/LIPICS.SOCG.2016.7zbMATH Open1387.68228OpenAlexW2468158418MaRDI QIDQ3132839FDOQ3132839
Authors: Oswin Aichholzer, Alexander Pilz, Bettina Speckmann, Birgit Vogtenhuber, Victor Alvarez, T. Hackl
Publication date: 30 January 2018
Full work available at URL: http://dx.doi.org/10.4230/LIPIcs.SoCG.2016.7
Recommendations
- Lower bounds on the number of triangles in a graph
- A lower bound on the number of triangulations of planar point sets
- Minimum number of partial triangulations
- A better upper bound on the number of triangulations of a planar point set
- Efficiently enumerating minimal triangulations
- A lower bound technique for triangulations of simplotopes
- Minimal triangulations of graphs: a survey
- scientific article; zbMATH DE number 2080989
- An improved bound on the number of unit area triangles
- An improved bound on the number of unit area triangles
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cited In (14)
- Title not available (Why is that?)
- A new lower bound on the maximum number of plane graphs using production matrices
- Order on order types
- On crossing-families in planar point sets
- A lower bound on the number of triangulations of planar point sets
- Counting polygon triangulations is hard
- Title not available (Why is that?)
- On the number of plane geometric graphs
- On the number of pseudo-triangulations of certain point sets
- Minimum number of partial triangulations
- Minimum Wiener index of triangulations and quadrangulations
- Chains, Koch chains, and point sets with many triangulations
- Counting triangulations of some classes of subdivided convex polygons
- Computing the flip distance between triangulations
This page was built for publication: An improved lower bound on the minimum number of triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132839)