Enumerating triangulation paths

DOI10.1016/S0925-7721(01)00031-1MaRDI QIDQ5952967zbMATH OpenWikidataFDO

Authors Adrian Dumitrescu, B. Gärtner, Samuele Pedroni, Emo Welzl

Publication date 14 January 2002

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

constrained Delaunay triangulationtriangulation path

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An efficient algorithm for enumeration of triangulations
• Parallel enumeration of triangulations
• Enumerating triangulations by parallel diagonals
• Enumerating pseudo-triangulations in the plane
• scientific article; zbMATH DE number 1741017
• Efficiently enumerating minimal triangulations
• ENUMERATING TRIANGULATIONS IN GENERAL DIMENSIONS
• scientific article; zbMATH DE number 894701
• Enumerating a class of lattice paths
• Lattice path enumeration

Cites work

• Constrained Delaunay triangulations
• Reverse search for enumeration

Cited in

(11)

• Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
• Enumerating non-crossing minimally rigid frameworks
• An efficient algorithm for enumeration of triangulations
• Enumerating triangulations by parallel diagonals
• Routes enumeration in a Boolean with respect to intersection and nonintersection relations
• Flip paths between lattice triangulations
• Bayesian network based multiagent system -- application in e-marketplace
• Number of Shortest Paths in Triangular Grid for 1- and 2-Neighborhoods
• Amortized efficiency of generating planar paths in convex position
• Triangle Finding and Listing in CONGEST Networks
• Counting triangulations and other crossing-free structures approximately

This page was built for publication: Enumerating triangulation paths

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5952967)