Pages that link to "Item:Q2432732"
From MaRDI portal
The following pages link to Algorithms for optimal area triangulations of a convex polygon (Q2432732):
Displayed 7 items.
- A linear time algorithm for max-min length triangulation of a convex polygon (Q845931) (← links)
- Optimal higher order Delaunay triangulations of polygons (Q1028236) (← links)
- Blockers for triangulations of a convex polygon and a geometric maker-breaker game (Q2205124) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- (Q4691882) (← links)
- Orbiting triangle method for convex polygon triangulation (Q5155721) (← links)
- Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)