Transforming pseudo-triangulations

Authors:
Sergey Bereg
Affiliations:
Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, TX
Venue:
Information Processing Letters
Year:
2004

Citing 5
Cited 4

Pseudo-triangulations: theory and applications

Proceedings of the twelfth annual symposium on Computational geometry
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
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

Transforming spanning trees and pseudo-triangulations

Information Processing Letters
Flips in planar graphs

Computational Geometry: Theory and Applications
Transforming spanning trees and pseudo-triangulations

Information Processing Letters
An application of a self-organizing model to the design of urban transport networks

Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology - Evolutionary neural networks for practical applications

Quantified Score

Hi-index	0.89

Visualization

Abstract

We study the problem of transforming pseudo-triangulations in the plane. We show that a pseudo-triangulation with n vertices can be transformed into another one using O(n logn) flips only. This improves the previous bound O(n2) of Brönnimann et al. [Fall Workshop on Comput. Geometry, 2001]. We present an algorithm for computing a transformation between two pseudotriangulations in O((f + n) log n) time where f is the number of flips.