Pages that link to "Item:Q1151398"
From MaRDI portal
The following pages link to A note on Delaunay and optimal triangulations (Q1151398):
Displaying 17 items.
- Minimum weight convex Steiner partitions (Q548652) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- On the average length of Delaunay triangulations (Q1062440) (← links)
- The greedy and Delaunay triangulations are not bad in the average case (Q1069709) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- There are planar graphs almost as good as the complete graphs and almost as cheap as minimum spanning trees (Q1194346) (← links)
- Computing the minimum weight triangulation of a set of linearly ordered points (Q1198019) (← links)
- Polynomial-time instances of the minimum weight triangulation problem (Q1314524) (← links)
- Approximating the minimum weight Steiner triangulation (Q1317876) (← links)
- Computing a subgraph of the minimum weight triangulation (Q1327172) (← links)
- New results for the minimum weight triangulation problem (Q1343467) (← links)
- Drawing outerplanar minimum weight triangulations (Q1351606) (← links)
- Affine invariant triangulations (Q2065637) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- A New Heuristic for Minimum Weight Triangulation (Q3801070) (← links)
- A fast heuristic for approximating the minimum weight triangulation (Q5054821) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)