SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS-Reference-Cited by-同舟云学术

SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS

Published:2003-04 Issue:02 Volume:13 Page:113-133
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

GALTIER JERÔME¹,HURTADO FERRAN²,NOY MARC²,PÉRENNES STÉPHANE³,URRUTIA JORGE⁴

Affiliation:

1. France Télécom R&D and Projet Mascotte (INRIA/UNSA/CNRS), 2004 route des Lucioles, BP 93, 06902 Sophia Antipolis, France

2. Departament de Matemàtica Aplicada II, Universitat Politècnica de Catalunya, Pau Gargallo, 5, 08028 Barcelona, Spain

3. Projet Mascotte (INRIA/UNSA/CNRS), 2004 route des Lucioles, BP 93,06902 Sophia Antipolis, France

4. Instituto de Matemáticas, Universidad Nacional Autónoma de México, Área de la investigación científica, Circuito Exterior, Ciudad Universitaria, Coyoacán 04510, México D.F., México

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 simultaneous flips that are needed to transform a triangulation into another. Our results hold for triangulations of point sets and for polygons.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195903001098

Reference13 articles.

1. Generating rooted triangulations without repetitions

2. Reverse search for enumeration

3. N. Di Cesare, O. Pironneau and E. Polak, Publications du Laboratoire d'Analyse Numérique 17 (Université Pierre et Marie Curie, 1998) p. R98005.

4. Incremental topological flipping works for regular triangulations

Cited by 24 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Flip paths between lattice triangulations;Discrete Applied Mathematics;2023-12

2. Connectivity of Triangulation Flip Graphs in the Plane;Discrete & Computational Geometry;2022-11-14

3. Transition operations over plane trees;Discrete Mathematics;2020-08

4. On Almost Empty Monochromatic Triangles and Convex Quadrilaterals in Colored Point Sets;Graphs and Combinatorics;2019-09-04

5. Flipping edge-labelled triangulations;Computational Geometry;2018-03