Pages that link to "Item:Q2341692"
From MaRDI portal
The following pages link to Counting triangulations and other crossing-free structures approximately (Q2341692):
Displaying 8 items.
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← 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)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- Convex Polygons in Geometric Triangulations (Q5366966) (← links)
