Pages that link to "Item:Q4762908"
From MaRDI portal
The following pages link to EFFICIENT APPROXIMATION OF CONVEX POLYGONS (Q4762908):
Displaying 21 items.
- Efficient integration over polytopes (Q1079329) (← links)
- On approximation behavior of the greedy triangulation for convex polygons (Q1098295) (← links)
- Model-based probing strategies for convex polygons (Q1208433) (← links)
- Efficient regular polygon dissections (Q1573694) (← links)
- Efficiently approximating polygonal paths in three and higher dimensions (Q1601006) (← links)
- Linear time approximation of 3D convex polytopes (Q1862132) (← links)
- Floating bodies and approximation of convex bodies by polytopes (Q2135725) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Affinely regular polygons as extremals of area functionals (Q2482187) (← links)
- Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets (Q2489540) (← links)
- Approximate convex decomposition of polygons (Q2507162) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Hausdorff approximation of convex polygons (Q2573338) (← links)
- Fast computation of the modality of polygons (Q3761211) (← links)
- (Q4218406) (← links)
- (Q4316716) (← links)
- (Q5091039) (← links)
- Approximate convex decomposition of polygons (Q5361650) (← links)
- (Q5743375) (← links)
- Efficient algorithms for approximation of nonsmooth convex bodies (Q5932908) (← links)
- An efficient evolutionary algorithm for accurate polygonal approximation (Q5953123) (← links)