Pages that link to "Item:Q1098295"
From MaRDI portal
The following pages link to On approximation behavior of the greedy triangulation for convex polygons (Q1098295):
Displaying 13 items.
- Efficiently updating constrained Delaunay triangulations (Q688628) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- A space efficient greedy triangulation algorithm (Q1120272) (← links)
- Fast algorithms for greedy triangulation (Q1196458) (← links)
- Heuristics for optimum binary search trees and minimum weight triangulation problems (Q1263993) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (Q1276945) (← links)
- Approximating the minimum weight Steiner triangulation (Q1317876) (← links)
- New results for the minimum weight triangulation problem (Q1343467) (← links)
- Drawing outerplanar minimum weight triangulations (Q1351606) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Progress on maximum weight triangulation (Q2489534) (← links)
- Fast algorithms for greedy triangulation (Q5056107) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
