Pages that link to "Item:Q1060850"
From MaRDI portal
The following pages link to A convex hull algorithm for planar simple polygons (Q1060850):
Displaying 6 items.
- An efficient convex hull algorithm using affine transformation in planar point set (Q900582) (← links)
- An efficient algorithm for finding the CSG representation of a simple polygon (Q1261285) (← links)
- Extension theory approach to scattering and annihilation in the \(\overline{p}d\) system (Q1568021) (← links)
- An algorithm for the construction of convex hulls in simple integer recourse programming (Q1918422) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- Finding the convex hull of a simple polygon (Q5896232) (← links)