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 20 items.
- Efficiently updating constrained Delaunay triangulations (Q688628) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- An algorithm for set operations on nonconvex polygons (with an application to census tracts) (Q1112631) (← 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)
- A linear-time approximation scheme for minimum weight triangulation of convex polygons (Q1393070) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Fast greedy triangulation algorithms. (Q2482901) (← links)
- Progress on maximum weight triangulation (Q2489534) (← links)
- Approximation for minimum triangulation of convex polyhedra (Q2768283) (← links)
- Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation (Q4216140) (← links)
- Fast algorithms for greedy triangulation (Q5056107) (← links)
- Checking the convexity of polytopes and the planarity of subdivisions (extended abstract) (Q5096937) (← links)
- An Algorithm to Construct Greedy Drawings of Triangulations (Q5897052) (← links)
