Pages that link to "Item:Q1882855"
From MaRDI portal
The following pages link to A lower bound on the number of triangulations of planar point sets (Q1882855):
Displaying 33 items.
- Configurations of non-crossing rays and related problems (Q282735) (← links)
- Counting triangulations of balanced subdivisions of convex polygons (Q510541) (← links)
- Counting triangulations of some classes of subdivided convex polygons (Q518180) (← links)
- On degrees in random triangulations of point sets (Q549246) (← links)
- Convexity minimizes pseudo-triangulations (Q598549) (← links)
- Abstract order type extension and new results on the rectilinear crossing number (Q870421) (← links)
- Improved upper bounds on the reflexivity of point sets (Q1000926) (← links)
- Note on the number of triangulations of planar point sets (Q1288910) (← links)
- A better upper bound on the number of triangulations of a planar point set (Q1873821) (← links)
- An improved FPT algorithm for the flip distance problem (Q2051774) (← links)
- Connectivity of triangulation flip graphs in the plane (Q2105329) (← links)
- Minimum number of partial triangulations (Q2107503) (← links)
- On crossing-families in planar point sets (Q2144455) (← links)
- Counting polygon triangulations is hard (Q2223620) (← links)
- A new lower bound on the maximum number of plane graphs using production matrices (Q2331222) (← 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)
- Computing the flip distance between triangulations (Q2408209) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- A lower bound for the number of polygonizations of \(N\) points in the plane (Q2713599) (← links)
- The Mathematics of Ferran Hurtado: A Brief Survey (Q2958111) (← links)
- (Q3124914) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- On the numerical implementation of variational arbitrary Lagrangian–Eulerian (VALE) formulations (Q3440591) (← links)
- The Number of Triangulations on Planar Point Sets (Q3595450) (← links)
- (Q3972101) (← links)
- (Q4252275) (← links)
- (Q5088963) (← links)
- (Q5111282) (← links)
- A simple aggregative algorithm for counting triangulations of planar point sets and related problems (Q5174454) (← links)
- EMBEDDING THE DOUBLE CIRCLE IN A SQUARE GRID OF MINIMUM SIZE (Q5247065) (← links)
- Constrained independence system and triangulations of planar point sets (Q6064012) (← links)
