Pages that link to "Item:Q2432732"
From MaRDI portal
The following pages link to Algorithms for optimal area triangulations of a convex polygon (Q2432732):
Displaying 14 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)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- The dual diameter of triangulations (Q1699295) (← links)
- Implementation of linear minimum area enclosing triangle algorithm. Application note (Q2013616) (← 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)
- (Q3123572) (← links)
- (Q4691882) (← links)
- (Q4763392) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Triangle-Based Heuristics for Area Optimal Polygonizations (Q5102078) (← links)
- Orbiting triangle method for convex polygon triangulation (Q5155721) (← links)
- Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)