swMATH31399MaRDI QIDQ43110FDOQ43110
Author name not available (Why is that?)
Official website: http://voronoi.hanyang.ac.kr/
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\)
- 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
- MinPerim
- VOROPACK-D
This page was built for software: QuickhullDisk
