Generating All Triangulations of Plane Graphs (Extended Abstract)
From MaRDI portal
Publication:3605494
DOI10.1007/978-3-642-00202-1_14zbMath1211.05166MaRDI QIDQ3605494
Md. Saidur Rahman, Mohammad Tanvir Parvez, Shin-ichi Nakano
Publication date: 24 February 2009
Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_14
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimal coding and sampling of triangulations
- Triangulating a simple polygon in linear time
- Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
- An efficient algorithm for enumeration of triangulations
- Reverse search for enumeration
- Graph of triangulations of a convex polygon and tree of triangulations
- Rotation Distance, Triangulations, and Hyperbolic Geometry
- Computational Geometry in C
- Isomorph-Free Exhaustive Generation
- Graph-Theoretic Concepts in Computer Science
- Graph Drawing