Generating rooted triangulations without repetitions

DOI10.1007/BF01944353MaRDI QIDQ1817003zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1796961
• Efficient generation of triconnected plane triangulations.
• Graph Drawing
• scientific article; zbMATH DE number 1754610

Cites work

• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 1395331 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• A Census of Planar Triangulations
• A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
• Enumeration of Triangulations of the Disk
• Finding the intersection of two convex polyhedra
• Generation of Triangulations of the Sphere
• Guarding polyhedral terrains
• Polyhedra of small order and their Hamiltonian properties
• Reverse search for enumeration

Cited in

(19)

• On planar path transformation
• Escape from the room
• An optimal algorithm to generate rooted trivalent diagrams and rooted triangular maps
• Enumerating floorplans with walls
• SIMULTANEOUS EDGE FLIPPING IN TRIANGULATIONS
• Memory-efficient enumeration of constrained spanning trees
• Generating internally triconnected rooted plane graphs
• Fast generation of planar graphs
• Inner diagonals of convex polytopes
• Family Trees for Enumeration
• Untangling a planar graph
• Graphs of triangulations and perfect matchings
• 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
• scientific article; zbMATH DE number 1796961 (Why is no real title available?)
• 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)