Pages that link to "Item:Q3446815"
From MaRDI portal
The following pages link to Counting and Enumerating Pointed Pseudotriangulations with the Greedy Flip Algorithm (Q3446815):
Displaying 13 items.
- Multitriangulations, pseudotriangulations and primitive sorting networks (Q443914) (← links)
- The stochastic walk algorithms for point location in pseudo-triangulations (Q634299) (← links)
- Computing pseudotriangulations via branched coverings (Q714984) (← links)
- Enumerating edge-constrained triangulations and edge-constrained non-crossing geometric spanning trees (Q967420) (← links)
- Enumerating pseudo-triangulations in the plane (Q1776895) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Enumerating non-crossing minimally rigid frameworks (Q2373440) (← links)
- Transforming pseudo-triangulations (Q2390240) (← links)
- Flip Algorithm for Segment Triangulations (Q3599126) (← links)
- (Q5088963) (← links)
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
- FLIPS IN COMBINATORIAL POINTED PSEUDO-TRIANGULATIONS WITH FACE DEGREE AT MOST FOUR (Q5247062) (← links)
- Fast enumeration algorithms for non-crossing geometric graphs (Q5896957) (← links)
