Convexity minimizes pseudo-triangulations

Authors:
Oswin Aichholzer;Franz Aurenhammer;Hannes Krasser;Bettina Speckmann
Affiliations:
Institute for Software Technology, Graz University of Technology, Inffeldgasse 16b, A-8010 Graz, Austria;Institute for Theoretical Computer Science, Graz University of Technology, Inffeldgasse 16b, A-8010 Graz, Austria;Institute for Theoretical Computer Science, Graz University of Technology, Inffeldgasse 16b, A-8010 Graz, Austria;Department of Mathematics and Computer Science, TU Eindhoven, The Netherlands
Venue:
Computational Geometry: Theory and Applications - Special issue on the 14th Canadian conference on computational geometry — CCCG02
Year:
2004

Minimal tangent visibility graphs

Computational Geometry: Theory and Applications
On the crossing number of complete graphs

Proceedings of the eighteenth annual symposium on Computational geometry
Kinetic maintenance of context-sensitive hierarchical representations for disjoint simple polygons

Proceedings of the eighteenth annual symposium on Computational geometry
Allocating vertex π-guards in simple polygons via pseudo-triangulations

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Tight degree bounds for pseudo-triangulations of points

Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Planar minimally rigid graphs and pseudo-triangulations

Proceedings of the nineteenth annual symposium on Computational geometry
A combinatorial approach to planar non-colliding robot arm motion planning

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Pseudotriangulations from Surfaces and a Novel Type of Edge Flip

SIAM Journal on Computing
A lower bound on the number of triangulations of planar point sets

Computational Geometry: Theory and Applications

A lower bound on the number of triangulations of planar point sets

Computational Geometry: Theory and Applications
On the number of plane graphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
On the number of pseudo-triangulations of certain point sets

Journal of Combinatorial Theory Series A
Empty pseudo-triangles in point sets

Discrete Applied Mathematics
A simple aggregative algorithm for counting triangulations of planar point sets and related problems

Proceedings of the twenty-ninth annual symposium on Computational geometry

Hi-index	0.00

The number of minimum pseudo-triangulations is minimized for point sets in convex position.