Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm

DOI10.1137/050631008MaRDI QIDQ3446815zbMATH OpenOpenAlexWikidataFDO

Authors Hervé Brönnimann, Lutz Kettner, Michel Pocchiola, Jack Snoeyink

Publication date 26 June 2007

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4dbc6382568c5bebd1f06bbbed39dff7b0ea1ccb

zbMATH Keywords

algorithmcombinatoricsenumerationpseudotriangulationtriangulation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Enumerating pseudo-triangulations in the plane
• Algorithms and Data Structures
• Enumerating triangulation paths
• scientific article; zbMATH DE number 1741017
• On numbers of pseudo-triangulations

Cited in

(15)

• Enumerating pseudo-triangulations in the plane
• On numbers of pseudo-triangulations
• Counting polygon triangulations is hard
• Enumerating non-crossing minimally rigid frameworks
• Transforming pseudo-triangulations
• On the number of pseudo-triangulations of certain point sets
• Flip Algorithm for Segment Triangulations
• Multitriangulations, pseudotriangulations and primitive sorting networks
• scientific article; zbMATH DE number 7559233 (Why is no real title available?)
• A simple aggregative algorithm for counting triangulations of planar point sets and related problems
• Flips in combinatorial pointed pseudo-triangulations with face degree at most four
• Fast enumeration algorithms for non-crossing geometric graphs
• The stochastic walk algorithms for point location in pseudo-triangulations
• Computing pseudotriangulations via branched coverings
• Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees

This page was built for publication: Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm

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