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
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
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Enumerating pseudo-triangulations in the plane
Computational Geometry: Theory and Applications
Enumerating pseudo-triangulations in the plane
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We study the problem of transforming pseudotriangulations in the plane. We show that a pseudo-triangulation with n vertices can be transformed into another one using O(n log n) flips only. This improves the previous bound O(n2) [3]. We present an algorithm for computing a transformation between two pseudo-triangulations in O((f + n) log n) time where f is the number of flips.