An efficient algorithm for enumeration of triangulations

DOI10.1016/S0925-7721(02)00111-6zbMath1018.65029MaRDI QIDQ1862130

Sergei Bespamyatnikh

Publication date: 10 March 2003

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

zbMATH Keywords

algorithmenumerationtriangulationsreverse search

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (12)

Enumerating non-crossing minimally rigid frameworks ⋮ Counting polygon triangulations is hard ⋮ Counting Plane Graphs with Exponential Speed-Up ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ Algorithmic enumeration of surrounding polygons ⋮ Flips in planar graphs ⋮ Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees ⋮ Enumerating pseudo-triangulations in the plane ⋮ Unnamed Item ⋮ Generating All Triangulations of Plane Graphs (Extended Abstract) ⋮ Counting triangulations and other crossing-free structures approximately ⋮ Counting triangulations and other crossing-free structures via onion layers

Cites Work

• Unnamed Item
• Preserving order in a forest in less than logarithmic time and linear space
• Finding the intersection of two convex polyhedra
• Flipping edges in triangulations
• Reverse search for enumeration
• Graph of triangulations of a convex polygon and tree of triangulations
• On the convex layers of a planar set
• Design and implementation of an efficient priority queue
• A note on Delaunay diagonal flips
• Generating triangulations at random

This page was built for publication: An efficient algorithm for enumeration of triangulations