Pages that link to "Item:Q1873821"
From MaRDI portal
The following pages link to A better upper bound on the number of triangulations of a planar point set (Q1873821):
Displaying 31 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Better bounds for planar sets avoiding unit distances (Q282753) (← links)
- Universal point sets for 2-coloured trees (Q436323) (← links)
- Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
- Counting triangulations of planar point sets (Q540059) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- On the number of higher order Delaunay triangulations (Q551184) (← links)
- Improved upper bounds on the reflexivity of point sets (Q1000926) (← links)
- Triangulations and lattice points (Q1261211) (← links)
- Note on the number of triangulations of planar point sets (Q1288910) (← links)
- On counting triangulations in \(d\) dimensions (Q1314531) (← links)
- A lower bound on the number of triangulations of planar point sets (Q1882855) (← links)
- On stable line segments in all triangulations of a planar point set (Q1920445) (← links)
- Minimum number of partial triangulations (Q2107503) (← 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)
- On the number of plane geometric graphs (Q2373434) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- On the number of rectangulations of a planar point set (Q2500619) (← links)
- A lower bound for the number of polygonizations of \(N\) points in the plane (Q2713599) (← links)
- Counting Plane Graphs with Exponential Speed-Up (Q3003469) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- On the Number of Anchored Rectangle Packings for a Planar Point Set (Q3196400) (← links)
- The Number of Triangulations on Planar Point Sets (Q3595450) (← links)
- (Q3972101) (← links)
- (Q4714582) (← links)
- (Q5088963) (← links)
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
- A Census of Plane Graphs with Polyline Edges (Q5267999) (← links)
- Counting Plane Graphs: Cross-Graph Charging Schemes (Q5397740) (← links)
