SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS

DOI10.1142/S0218195903001098zbMath1058.52005MaRDI QIDQ4818577

Stéphane Pérennes, Jorge Urrutia, Marc Noy, Ferran Hurtado, Jérôme Galtier

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

triangulationsflipsparallel flipping

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)

Related Items

A lower bound on the number of triangulations of planar point sets ⋮ Flip paths between lattice triangulations ⋮ The Mathematics of Ferran Hurtado: A Brief Survey ⋮ Flipping edge-labelled triangulations ⋮ Simultaneously Flippable Edges in Triangulations ⋮ On local transformations in plane geometric graphs embedded on small grids ⋮ Flips in planar graphs ⋮ On almost empty monochromatic triangles and convex quadrilaterals in colored point sets ⋮ Transition operations over plane trees ⋮ Games on triangulations ⋮ Graphs of triangulations and perfect matchings ⋮ Connectivity of triangulation flip graphs in the plane

Cites Work

• Unnamed Item
• Construction of three-dimensional Delaunay triangulations using local transformations
• Flipping edges in triangulations
• Topologically sweeping visibility complexes via pseudotriangulations
• Generating rooted triangulations without repetitions
• Incremental topological flipping works for regular triangulations
• Reverse search for enumeration
• Graph of triangulations of a convex polygon and tree of triangulations