"I could be bounded in a cone and count myself a king of infinite space." ~ Hamlet, II.ii
Finds the minimum bounding cone of N points in any dimension in O(n log n) time.
Implements the Voronoi-based algorithm described by Barequet & Elber
- numpy for maths
- scipy for calculating convex hull
pip install conebound
- Covers acute, obtuse, reflex cases
- Covers dimensions 2, 3, 4
pytest -v