Flip Algorithm for Segment Triangulations
From MaRDI portal
Recommendations
- Flipping edges in triangulations
- Computing the flip distance between triangulations
- Flips in higher order Delaunay triangulations
- Algorithms for triangulations
- Simultaneously flippable edges in triangulations
- Graph Drawing
- Reconfiguring triangulations with edge flips and point moves
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Flipping edge-labelled triangulations
- Flip paths between lattice triangulations
Cites work
- Construction of three-dimensional Delaunay triangulations using local transformations
- Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
- Graph of triangulations of a convex polygon and tree of triangulations
- scientific article; zbMATH DE number 5506219 (Why is no real title available?)
- scientific article; zbMATH DE number 3633698 (Why is no real title available?)
- scientific article; zbMATH DE number 1795894 (Why is no real title available?)
- scientific article; zbMATH DE number 3804333 (Why is no real title available?)
- Incremental topological flipping works for regular triangulations
- Pseudo-simplicial complexes from maximal locally convex functions
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip
- Randomized incremental construction of Delaunay and Voronoi diagrams
- 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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3599126)