Pages that link to "Item:Q1917048"
From MaRDI portal
The following pages link to An algorithm for constructing the convex hull of a set of spheres in dimension \(d\) (Q1917048):
Displaying 11 items.
- A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
- An approximate algorithm for computing multidimensional convex hulls (Q1294388) (← links)
- Minimal surface convex hulls of spheres (Q1633782) (← links)
- An algorithm for the construction of convex hulls in simple integer recourse programming (Q1918422) (← links)
- Convex hulls of spheres and convex hulls of disjoint convex polytopes (Q1947973) (← links)
- On computing the convex hull of (piecewise) curved objects (Q1948676) (← links)
- QuickhullDisk: a faster convex hull algorithm for disks (Q2286150) (← links)
- ALGORITHMS FOR BALL HULLS AND BALL INTERSECTIONS IN NORMED PLANES (Q2970416) (← links)
- The implementation of an algorithm to find the convex hull of a set of three-dimensional points (Q3358263) (← links)
- OPTIMAL VORONOI DIAGRAM CONSTRUCTION WITH n CONVEX SITES IN THREE DIMENSIONS (Q3503107) (← links)
- Separable Distance Transformation and Its Applications (Q4648753) (← links)
