Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
From MaRDI portal
Publication:3446815
DOI10.1137/050631008zbMath1120.68104OpenAlexW2039429523WikidataQ56970459 ScholiaQ56970459MaRDI QIDQ3446815
Michel Pocchiola, Hervé Brönnimann, Jack Scott Snoeyink, Lutz Kettner
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
Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (12)
Enumerating non-crossing minimally rigid frameworks ⋮ Transforming pseudo-triangulations ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ Multitriangulations, pseudotriangulations and primitive sorting networks ⋮ Counting polygon triangulations is hard ⋮ Fast enumeration algorithms for non-crossing geometric graphs ⋮ Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees ⋮ Enumerating pseudo-triangulations in the plane ⋮ Computing pseudotriangulations via branched coverings ⋮ Flip Algorithm for Segment Triangulations ⋮ Unnamed Item ⋮ FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR
This page was built for publication: Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm
