Generating All Triangulations of Plane Graphs (Extended Abstract)

DOI10.1007/978-3-642-00202-1_14zbMATH Open1211.05166OpenAlexW65918698MaRDI QIDQ3605494FDOQ3605494

Authors: Mohammad Tanvir Parvez, Md. Saidur Rahman, 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

Recommendations

• Generating all triangulations of plane graphs
• Efficient generation of triconnected plane triangulations.
• Listing All Plane Graphs
• Graph Drawing
• scientific article; zbMATH DE number 1796961

zbMATH Keywords

graphtriangulationplane graphpolygongenealogical tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Triangulating a simple polygon in linear time
• Reverse search for enumeration
• Rotation Distance, Triangulations, and Hyperbolic Geometry
• Computational Geometry in C
• Optimal coding and sampling of triangulations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Isomorph-Free Exhaustive Generation
• Graph-Theoretic Concepts in Computer Science
• Diagonal flips in triangulations on closed surfaces with minimum degree at least 4
• Graph of triangulations of a convex polygon and tree of triangulations
• An efficient algorithm for enumeration of triangulations
• Title not available (Why is that?)
• Graph Drawing

Cited In (3)

• Orbiting triangle method for convex polygon triangulation
• Constant Time Generation of Biconnected Rooted Plane Graphs
• Generating all triangulations of plane graphs

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)