Pages that link to "Item:Q1393070"
From MaRDI portal
The following pages link to A linear-time approximation scheme for minimum weight triangulation of convex polygons (Q1393070):
Displaying 10 items.
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees (Q2387200) (← links)
- A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation (Q2489546) (← links)
- Approximation for minimum triangulation of convex polyhedra (Q2768283) (← links)
- Minimum Weight Polygon Triangulation Problem in Sub-Cubic Time Bound (Q2958326) (← links)
- (Q4500844) (← links)
- A quasi-polynomial time approximation scheme for minimum weight triangulation (Q5891924) (← links)
- The drawability problem for minimum weight triangulations (Q5958308) (← links)