Generating rooted triangulations without repetitions
From MaRDI portal
Publication:1817003
DOI10.1007/BF01944353zbMath0860.68107MaRDI QIDQ1817003
Publication date: 1 December 1996
Published in: Algorithmica (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS, Flips in planar graphs, Planar tree transformation: results and counterexample, Untangling a planar graph, Inner diagonals of convex polytopes, Efficient generation of triconnected plane triangulations., Efficient generation of plane trees., On planar path transformation, Graphs of triangulations and perfect matchings
Cites Work
- Guarding polyhedral terrains
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Finding the intersection of two convex polyhedra
- Polyhedra of small order and their Hamiltonian properties
- Reverse search for enumeration
- A Census of Planar Triangulations
- Enumeration of Triangulations of the Disk
- Generation of Triangulations of the Sphere
- Unnamed Item
- Unnamed Item
- Unnamed Item