遇见数据集

Smallest Enclosing Ball

收藏
Mendeley Data2024-03-27 更新2024-06-26 收录
官方服务:

资源简介:

Library to find the smallest enclosing ball of points in three algorithms based on QR-decompostion implemented by Martin Kutz , Kaspar Fischer . 1. Shrinking algorithm in shrink() in "Seb-inl.h". Authors: Martin Kutz , Kaspar Fischer 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 3. Hybrid algoritm in hybrid() in "Seb-inl.h". a dual algorithm that uses a shrinking method to solve subproblems. Authors: X.Y. Huang Additionally, Cavaleivro and Alizadeh's algorithm is available in dual2(), which checks at most two facets in line search. Authors: X.Y. Huang

创建时间:
2024-01-23
二维码
社区交流群
二维码
科研交流群
商业服务