Advertisement

Discrete & Computational Geometry

, Volume 22, Issue 3, pp 333–346 | Cite as

Flipping Edges in Triangulations

  • F. Hurtado
  • M. Noy
  • J. Urrutia

Abstract.

In this paper we study the problem of flipping edges in triangulations of polygons and point sets. One of the main results is that any triangulation of a set of n points in general position contains at least \(\lceil (n-4)/2 \rceil\) edges that can be flipped. We also prove that O(n + k 2 ) flips are sufficient to transform any triangulation of an n -gon with k reflex vertices into any other triangulation. We produce examples of n -gons with triangulations T and T' such that to transform T into T' requires Ω(n 2 ) flips. Finally we show that if a set of n points has k convex layers, then any triangulation of the point set can be transformed into any other triangulation using at most O(kn) flips.

Keywords

General Position Reflex Vertex Convex Layer Flipping Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag New York Inc. 1999

Authors and Affiliations

  • F. Hurtado
    • 1
  • M. Noy
    • 1
  • J. Urrutia
    • 2
  1. 1.Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Barcelona, Spain, hurtado@ma2.upc.es, noy@ma2.upc.es ES
  2. 2.Department of Computer Science, University of Ottawa, Ottawa, Ontario, Canada jorge@csi.uottawa.caCA

Personalised recommendations