Reverse search for enumeration
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Pseudo-triangulations: theory and applications
Proceedings of the twelfth annual symposium on Computational geometry
Kinetic collision detection for simple polygons
Proceedings of the sixteenth annual symposium on Computational geometry
Introduction to Algorithms
An efficient algorithm for enumeration of triangulations
Computational Geometry: Theory and Applications
A combinatorial approach to planar non-colliding robot arm motion planning
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Straightening polygonal arcs and convexifying polygonal cycles
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Transforming pseudo-triangulations
ICCS'03 Proceedings of the 1st international conference on Computational science: PartI
Decomposing a simple polygon into pseudo-triangles and convex polygons
Computational Geometry: Theory and Applications
Fast enumeration algorithms for non-crossing geometric graphs
Proceedings of the twenty-fourth annual symposium on Computational geometry
Discrete Applied Mathematics
| Hi-index | 0.00 |
A pseudo-triangle is a simple polygon with exactly three convex vertices. A pseudo-triangulation of a finite point set S in the plane is a partition of the convex hull of S into interior disjoint pseudo-triangles whose vertices are points of S. A pointed pseudo-triangulation is one which has the least number of pseudo-triangles. We study the graph G whose vertices represent the pointed pseudo-triangulations and whose edges represent flips. We present an algorithm for enumerating pointed pseudo-triangulations in O(log n) time per pseudo-triangulation.