(Enter summary)
Abstract: We generalize the operation of flipping an edge in a triangulation to that of flipping
several edges simultaneously. Our main result is an optimal upper bound on the number
of parallel flips that are needed to transform a triangulation into another. Our results hold
for triangulations of point sets and for polygons.
1 Introduction
Given a triangulation T of a set P of points in the plane, an edge e of T is flippable if it is
incident to two triangles whose union is a convex quadrilateral... (Update)
Cited by: More
On Local Transformations in Plane GeometricGraphs.. - Abellanas, Bose..
(Correct)
Similar documents (at the sentence level):
41.6%: Simultaneous Edge Flipping in Triangulations - Galtier Hurtado Noy (2003)
(Correct)
11.8%: Parallel Edge Flipping - Hurtado, Noy, Urrutia
(Correct)
Active bibliography (related documents): More All
1.2: Parallel Flips on Planar Triangulations - Galtier, Perennes (1999)
(Correct)
0.7: Graphs of Triangulations and Perfect Matchings - Houle, Hurtado, Noy..
(Correct)
0.3: A Locally Optimal Triangulation of the Hyperbolic Paraboloid - Desnogučs, Devillers
(Correct)
Similar documents based on text: More All
0.4: Flipping Edges on Triangulations - Hurtado, Noy, Urrutia (1996)
(Correct)
0.3: How far flipping can go towards 3D conforming/constrained.. - Anwei Liu And
(Correct)
0.3: On the Chromatic Number of Some Geometric Type Kneser.. - Araujo, Dumitrescu..
(Correct)
BibTeX entry: (Update)
J. Galtier, F. Hurtado, M. Noy, S. P erennes, and J. Urrutia, Simultaneous edge flipping in triangulations. Internat. J. Comput. Geom. Appl., 13(2):113--133, 2003. http://citeseer.ist.psu.edu/galtier03simultaneous.html More
@misc{ galtier03simultaneous,
author = "J. Galtier and F. Hurtado and M. Noy and S. erennes and J. Urrutia",
title = "Simultaneous edge flipping in triangulations",
text = "J. Galtier, F. Hurtado, M. Noy, S. P erennes, and J. Urrutia, Simultaneous
edge flipping in triangulations. Internat. J. Comput. Geom. Appl., 13(2):113--133,
2003.",
year = "2003",
url = "citeseer.ist.psu.edu/galtier03simultaneous.html" }
Citations (may not include all citations):
58
Incremental Topological Flipping Works for Regular Triangula.. (context) - Edelsbrunner, Shah - 1996
54
Voronoi diagrams and Delaunay triangulations
- Fortune - 1992
39
A topology modifying progressive decimation algorithm
- Schroeder - 1997
38
Construction of three-dimensional Delaunay triangulations us.. (context) - Joe - 1991
34
Reverse search for enumeration
- Avis, Fukuda - 1996
28
Bemerkungen zum Vierfarbenproblem (context) - Wagner - 1936
15
Computing the Visibility Graph via Pseudo-triangulations
- Pocchiola, Vegter - 1995
9
Generating rooted triangulations without repetitions (context) - Avis - 1996
8
triangulations and hyperbolic geometry (context) - Sleator, Tarjan et al. - 1988
7
Graph of Triangulations of a Convex Polygon and Tree of Tria.. (context) - Hurtado, Noy - 1999
4
Visualization of height field data with physical models and ..
- Clark, Bailey - 1997
4
Triangulation de Delaunay et maillage -- applications aux 'e.. (context) - George, Borouchaki - 1997
3
Consistent approximation of an optimal design problem (context) - Di Cesare, Pironneau et al. - 1998
3
A locally optimal triangulation of the hyperbolic paraboloid (context) - Desnogues, Devilliers - 1995
3
Discrete and Computational Geometry (context) - Hurtado, Noy et al. - 1999
3
mesh generation conforming a prescribed size map (context) - George - 1998
2
Parallel flips on planar triangulations
- Galtier, Perennes - 1999
Documents on the same site (http://www-ma2.upc.es/~hurtado/mypapers.html): More
Point-Sets With Few K-Sets - Alt, Felsner, Hurtado, Noy, Welzl (1998)
(Correct)
On the Reflexivity of Point Sets - Arkin, Fekete, Hurtado, Mitchell.. (2000)
(Correct)
Optimal and Suboptimal Robust Algorithms for Proximity Graphs - Ferran Hurtado Giuseppe
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC