Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
DOI10.1137/050631008zbMATH Open1120.68104OpenAlexW2039429523WikidataQ56970459 ScholiaQ56970459MaRDI QIDQ3446815FDOQ3446815
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
Recommendations
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Cited In (15)
- Title not available (Why is that?)
- Enumerating non-crossing minimally rigid frameworks
- Multitriangulations, pseudotriangulations and primitive sorting networks
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems
- On numbers of pseudo-triangulations
- Counting polygon triangulations is hard
- Enumerating pseudo-triangulations in the plane
- Fast enumeration algorithms for non-crossing geometric graphs
- On the number of pseudo-triangulations of certain point sets
- Flips in combinatorial pointed pseudo-triangulations with face degree at most four
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees
- The stochastic walk algorithms for point location in pseudo-triangulations
- Transforming pseudo-triangulations
- Flip Algorithm for Segment Triangulations
- Computing pseudotriangulations via branched coverings
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)
