Generating rooted triangulations without repetitions
From MaRDI portal
Publication:1817003
DOI10.1007/BF01944353zbMATH Open0860.68107OpenAlexW2054193589MaRDI QIDQ1817003FDOQ1817003
Publication date: 1 December 1996
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01944353
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- Title not available (Why is that?)
- Reverse search for enumeration
- A Census of Planar Triangulations
- Guarding polyhedral terrains
- Title not available (Why is that?)
- Enumeration of Triangulations of the Disk
- Finding the intersection of two convex polyhedra
- Generation of Triangulations of the Sphere
- Polyhedra of small order and their Hamiltonian properties
- Title not available (Why is that?)
Cited In (18)
- On planar path transformation
- Escape from the room
- Enumerating floorplans with walls
- An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
- SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
- Memory-efficient enumeration of constrained spanning trees
- Generating internally triconnected rooted plane graphs
- Inner diagonals of convex polytopes
- Family Trees for Enumeration
- Graphs of triangulations and perfect matchings
- Untangling a planar graph
- Efficient generation of plane trees.
- Extending convex partial drawings of graphs
- Efficient generation of triconnected plane triangulations.
- Transformations for maximal planar graphs with minimum degree five
- Title not available (Why is that?)
- Planar tree transformation: results and counterexample
- Flips in planar graphs
This page was built for publication: Generating rooted triangulations without repetitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1817003)
