Pages that link to "Item:Q540059"
From MaRDI portal
The following pages link to Counting triangulations of planar point sets (Q540059):
Displaying 22 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Crossings in grid drawings (Q405129) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Monotone paths in geometric triangulations (Q726107) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Colored ray configurations (Q1699300) (← links)
- On numbers of pseudo-triangulations (Q1947983) (← links)
- From crossing-free graphs on wheel sets to embracing simplices and polytopes with few vertices (Q2207612) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- On compatible matchings (Q2232249) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Geometric biplane graphs. I: Maximal graphs (Q2345511) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Trapezoidal diagrams, upward triangulations, and prime Catalan numbers (Q2411817) (← links)
- Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
- A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set (Q3448837) (← links)
- On Compatible Matchings (Q5049995) (← links)
- (Q5088963) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
- Interview with Micha Sharir (Q6659997) (← links)
