Efficient generation of triconnected plane triangulations.

DOI10.1016/j.comgeo.2003.06.001zbMath1041.65022OpenAlexW2024428991MaRDI QIDQ1428112

Shin-ichi Nakano

Publication date: 14 March 2004

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2003.06.001

zbMATH Keywords

algorithmplane graphsplane triangulationslistingrooted triangulations

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (7)

Enumeration, Counting, and Random Generation of Ladder Lotteries ⋮ Family Trees for Enumeration ⋮ Escape from the room ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Listing All Plane Graphs ⋮ Efficient enumeration of all ladder lotteries and its application ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)

Cites Work

• Unnamed Item
• Unnamed Item
• Generating rooted triangulations without repetitions
• Constant Time Generation of Rooted Trees
• Efficient Algorithms for Listing Combinatorial Structures
• Isomorph-Free Exhaustive Generation
• Constant Time Generation of Free Trees

This page was built for publication: Efficient generation of triconnected plane triangulations.