Generating rooted triangulations without repetitions

DOI10.1007/BF01944353zbMath0860.68107OpenAlexW2054193589MaRDI QIDQ1817003

David Avis

Publication date: 1 December 1996

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01944353

zbMATH Keywords

rooted triangulationsreverse search technique

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Memory-efficient enumeration of constrained spanning trees ⋮ On planar path transformation ⋮ Extending convex partial drawings of graphs ⋮ SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS ⋮ Transformations for maximal planar graphs with minimum degree five ⋮ Family Trees for Enumeration ⋮ Escape from the room ⋮ Enumerating floorplans with walls ⋮ Efficient generation of triconnected plane triangulations. ⋮ Flips in planar graphs ⋮ Planar tree transformation: results and counterexample ⋮ Untangling a planar graph ⋮ Inner diagonals of convex polytopes ⋮ Graphs of triangulations and perfect matchings ⋮ Efficient generation of plane trees.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: Generating rooted triangulations without repetitions