Pages that link to "Item:Q4202210"
From MaRDI portal
The following pages link to A Quadratic Time Algorithm for the Minmax Length Triangulation (Q4202210):
Displaying 8 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)
- LMT-skeleton heuristics for several new classes of optimal triangulations (Q1841243) (← links)
- Approximating uniform triangular meshes in polygons. (Q1853569) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- Optimization for first order Delaunay triangulations (Q2269140) (← links)
- 3D boundary recovery by constrained Delaunay tetrahedralization (Q3018042) (← links)
- Optimal Higher Order Delaunay Triangulations of Polygons (Q5458523) (← links)
