On local transformation of polygons with visibility properties.
From MaRDI portal
Publication:1853571
DOI10.1016/S0304-3975(01)00409-1zbMath1061.68168MaRDI QIDQ1853571
Michael E. Houle, Carmen Hernando, Ferran Hurtado
Publication date: 21 January 2003
Published in: Theoretical Computer Science (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polytopes and polyhedra (52B99)
Related Items
On planar path transformation ⋮ Connecting polygonizations via stretches and twangs ⋮ COMPUTING SIGNED PERMUTATIONS OF POLYGONS ⋮ Algorithmic enumeration of surrounding polygons ⋮ Flips in planar graphs ⋮ Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees ⋮ Planar tree transformation: results and counterexample ⋮ Graphs of triangulations and perfect matchings
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Construction of three-dimensional Delaunay triangulations using local transformations
- An optimal visibility graph algorithm for triangulated simple polygons
- Combinatorial face enumeration in arrangements and oriented matroids
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Geometric tree graphs of points in convex position
- Combinatorial face enumeration in convex polytopes
- Flipping edges in triangulations
- Graphs of non-crossing perfect matchings
- Incremental topological flipping works for regular triangulations
- Reverse search for enumeration
- Generating random polygons with given vertices
- Graph of triangulations of a convex polygon and tree of triangulations
- Transforming triangulations
- Every planar map is four colorable
- R(4, 5) = 25
