Enumerating triangulation paths

DOI10.1016/S0925-7721(01)00031-1zbMath0991.68116WikidataQ54308919 ScholiaQ54308919MaRDI QIDQ5952967

Bernd Gärtner, Samuele Pedroni, Adrian Dumitrescu, Ermo 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)

Related Items (3)

Enumerating non-crossing minimally rigid frameworks ⋮ Bayesian network based multiagent system -- application in e-marketplace ⋮ Counting triangulations and other crossing-free structures approximately

Cites Work

• Constrained Delaunay triangulations
• Reverse search for enumeration

This page was built for publication: Enumerating triangulation paths