Pages that link to "Item:Q5174454"
From MaRDI portal
The following pages link to A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454):
Displaying 14 items.
- Counting triangulations of planar point sets (Q540059) (← links)
- On a triangle counting problem (Q909463) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- An efficient algorithm for enumeration of triangulations (Q1862130) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers (Q2411817) (← links)
- Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems (Q3132888) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- Convex Polygons in Geometric Triangulations (Q3449827) (← links)
- (Q5088963) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5901269) (← links)