Smallest Enclosing Ball
收藏Mendeley Data2026-04-18 收录
下载链接：
https://data.mendeley.com/datasets/d8hds82d6s
下载链接
链接失效反馈官方服务：
资源简介：
Library to find the smallest enclosing ball of points in three algorithms based on QR-decompostion implemented by Martin Kutz <kutz@math.fu-berlin.de>, Kaspar Fischer <kf@iaeth.ch>.
1. Shrinking algorithm in shrink() in "Seb-inl.h". Authors: Martin Kutz <kutz@math.fu-berlin.de>, Kaspar Fischer <kf@iaeth.ch>
2. Dual algorithm in dual() in "Seb-inl.h". a variant of Cavaleivro and Alizadeh, which checks one facet in line search. Authors: X.Y. Huang <hxy@cnu.edu.cn>
3. Hybrid algoritm in hybrid() in "Seb-inl.h". a dual algorithm that uses a shrinking method to solve subproblems. Authors: X.Y. Huang <hxy@cnu.edu.cn>
Additionally, Cavaleivro and Alizadeh's algorithm is available in dual2(), which checks at most two facets in line search. Authors: X.Y. Huang <hxy@cnu.edu.cn>
创建时间：
2020-11-23
