Generating All Triangulations of Plane Graphs (Extended Abstract)
From MaRDI portal
Publication:3605494
Recommendations
Cites work
- scientific article; zbMATH DE number 2123122 (Why is no real title available?)
- scientific article; zbMATH DE number 1754610 (Why is no real title available?)
- scientific article; zbMATH DE number 1433426 (Why is no real title available?)
- An efficient algorithm for enumeration of triangulations
- Computational Geometry in C
- Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
- Graph Drawing
- Graph of triangulations of a convex polygon and tree of triangulations
- Graph-Theoretic Concepts in Computer Science
- Isomorph-Free Exhaustive Generation
- Optimal coding and sampling of triangulations
- Reverse search for enumeration
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Triangulating a simple polygon in linear time
Cited in
(3)
This page was built for publication: Generating All Triangulations of Plane Graphs (Extended Abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3605494)