Pages that link to "Item:Q1069709"
From MaRDI portal
The following pages link to The greedy and Delaunay triangulations are not bad in the average case (Q1069709):
Displaying 10 items.
- An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations (Q749241) (← links)
- Toughness and Delaunay triangulations (Q803161) (← links)
- Algorithms for minimum length partitions of polygons (Q1102107) (← 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)
- 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)
- A New Heuristic for Minimum Weight Triangulation (Q3801070) (← links)
