Cited in
(7)- An efficient improvement of gift wrapping algorithm for computing the convex hull of a finite set of points in \(\mathbb{R}^n\)
- A fast and efficient algorithm for determining the connected orthogonal convex hulls
- Near optimal minimal convex hulls of disks
- MinPerim
- VOROPACK-D
- A modified Graham's convex hull algorithm for finding the connected orthogonal convex hull of a finite planar point set
- scientific article; zbMATH DE number 7499212 (Why is no real title available?)
This page was built for software: QuickhullDisk
