Convexity minimizes pseudo-triangulations
From MaRDI portal
Publication:598549
DOI10.1016/j.comgeo.2004.01.002zbMath1056.65013OpenAlexW2170949858WikidataQ29038757 ScholiaQ29038757MaRDI QIDQ598549
Hannes Krasser, Franz Aurenhammer, Bettina Speckmann, Oswin Aichholzer
Publication date: 6 August 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.01.002
Related Items (10)
A lower bound on the number of triangulations of planar point sets ⋮ On the number of plane geometric graphs ⋮ On the number of crossing-free partitions ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ On the number of pseudo-triangulations of certain point sets ⋮ Planar minimally rigid graphs and pseudo-triangulations ⋮ Enumerating pseudo-triangulations in the plane ⋮ Empty pseudo-triangles in point sets ⋮ A new lower bound on the maximum number of plane graphs using production matrices
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the crossing number of complete graphs
- Ray shooting in polygons using geodesic triangulations
- Topologically sweeping visibility complexes via pseudotriangulations
- Enumerating order types for small point sets with applications
- Tight degree bounds for pseudo-triangulations of points
- A lower bound on the number of triangulations of planar point sets
- Minimal tangent visibility graphs
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons
- KINETIC COLLISION DETECTION FOR SIMPLE POLYGONS
- Planar minimally rigid graphs and pseudo-triangulations
This page was built for publication: Convexity minimizes pseudo-triangulations
