Efficient computation of the smallest bounding ball of a point set, in arbitrary number of dimensions
-
Updated
Jun 23, 2024 - Python
Efficient computation of the smallest bounding ball of a point set, in arbitrary number of dimensions
Package contains algorithms to calculate smallest enclosing sphere for a given set of points in N dimensions.
Compute bounding sphere for a set of points using Jack Ritter's algorithm
3D collision detection written in golang
Computes the bounding sphere of a gltf model
Common mathematics library, C99 GLM alternative (vector, matrix, quaternion, camera, bounding, color)
2D and 3D test of Welzl Minimum Bounding Cicle/Sphere
Create Bounding Sphere from 3d points using covariance matrix and jacobi rotation matrix algorithm
Bounding Volumes (BV), BV Hierachies and Spatial Partitioning w/ OctTrees + BSPTrees for Spatial Data Structures Study
Single-header, lightweight, and performant bounded priority deque with wide applicability via templating
Add a description, image, and links to the bounding-sphere topic page so that developers can more easily learn about it.
To associate your repository with the bounding-sphere topic, visit your repo's landing page and select "manage topics."