Pages that link to "Item:Q1256860"
From MaRDI portal
The following pages link to Neither the greedy nor the Delaunay triangulation of a planar point set approximates the optimal triangulation (Q1256860):
Displaying 20 items.
- 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)
- A note on Delaunay and optimal triangulations (Q1151398) (← links)
- Fast algorithms for greedy triangulation (Q1196458) (← 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)
- Improved heuristics for the minimum weight triangulation problem (Q1913901) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM (Q3520429) (← links)
- Simulated Annealing and Genetic Algorithms in Quest of Optimal Triangulations (Q3628371) (← links)
- A New Heuristic for Minimum Weight Triangulation (Q3801070) (← links)
- Fast algorithms for greedy triangulation (Q5056107) (← links)
- On exclusion regions for optimal triangulations (Q5929321) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)
