Home

Kaspar Fischer

This project provides code for finding the miniball (i.e., the smallest enclosing ball) of a set of balls in d-dimensional Euclidean space. This implementation is very fast for d<10 and very robust (not sensitive to degeneracies). (Supported by ETHZ.)


Project Admins: