Flip Algorithm for Segment Triangulations
From MaRDI portal
Publication:3599126
DOI10.1007/978-3-540-85238-4_14zbMath1173.68760OpenAlexW1572077575MaRDI QIDQ3599126
Nicolas Chevallier, Mathieu Brévilliers, Dominique Schmitt
Publication date: 3 February 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_14
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of three-dimensional Delaunay triangulations using local transformations
- Pseudo-simplicial complexes from maximal locally convex functions
- Randomized incremental construction of Delaunay and Voronoi diagrams
- Incremental topological flipping works for regular triangulations
- Graph of triangulations of a convex polygon and tree of triangulations
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Three-Dimensional Triangulations from Local Transformations
- Triangulations of Line Segment Sets in the Plane
This page was built for publication: Flip Algorithm for Segment Triangulations
