Pages that link to "Item:Q1948676"
From MaRDI portal
The following pages link to On computing the convex hull of (piecewise) curved objects (Q1948676):
Displaying 8 items.
- Incremental algorithms for finding the convex hulls of circles and the lower envelopes of parabolas (Q672261) (← links)
- Approximate polytope ensemble for one-class classification (Q898344) (← links)
- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design (Q1818117) (← links)
- The largest convex patches: A boundary-based method for obtaining object parts (Q1825793) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- Recursive Calculation of Relative Convex Hulls (Q3000706) (← links)
- Towards the computation of the convex hull of a configuration from its corresponding separating matrix (Q5442545) (← links)
- A novel algorithm for finding convex hull of a generic polygon with simulation of progressively supporting elastic lines (Q6618153) (← links)