QuickhullDisk
From MaRDI portal
Software:43110
swMATH31399MaRDI QIDQ43110FDOQ43110
Author name not available (Why is that?)
Cited In (5)
- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- Near optimal minimal convex hulls of disks
- Title not available (Why is that?)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
This page was built for software: QuickhullDisk
