Pages that link to "Item:Q1762986"
From MaRDI portal
The following pages link to A linear-time approximation scheme for maximum weight triangulation of convex polygons (Q1762986):
Displaying 6 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)
- A linear time approximation scheme for computing geometric maximum \(k\)-star (Q1942028) (← links)
- An almost four-approximation algorithm for maximum weight triangulation (Q2268761) (← links)
- Finding a maximum weight triangle in n <sup>3-Δ</sup> time, with applications (Q2931387) (← links)
- Linear algorithm to find the largest intriangles of a planar convex polygon (Q4246478) (← links)