Constrained paths in the flip-graph of regular triangulations
From MaRDI portal
Publication:876507
DOI10.1016/j.comgeo.2006.07.001zbMath1123.68132OpenAlexW2157015489MaRDI QIDQ876507
Lionel Pournin, Thomas M. Liebling
Publication date: 18 April 2007
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://infoscience.epfl.ch/record/98382/files/PouLie%20Constrained%20paths%20in%20the%20flip-graph.pdf
(n)-dimensional polytopes (52B11) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (5)
Parallel enumeration of triangulations ⋮ On one approach to the estimation of a triangular element degeneration in a triangulation ⋮ From Spheres to Spheropolyhedra: Generalized Distinct Element Methodology and Algorithm Analysis ⋮ Lifting simplicial complexes to the boundary of convex polytopes ⋮ Weakly regular subdivisions
Cites Work
- Unnamed Item
- Unnamed Item
- Construction of three-dimensional Delaunay triangulations using local transformations
- Triangulations. Structures for algorithms and applications
- The number of geometric bistellar neighbors of a triangulation
- Incremental topological flipping works for regular triangulations
- Triangulations with very few geometric bistellar neighbors
- Discriminants, resultants, and multidimensional determinants
- Non-connected toric Hilbert schemes
- Three-dimensional distinct element simulation of spherocylinder crystallization
- Tetrahedrizing point sets in three dimensions
- A New Approach to the Analysis of Free Rotations of Rigid Bodies
- A point set whose space of triangulations is disconnected
This page was built for publication: Constrained paths in the flip-graph of regular triangulations