commons-issues mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Luc Maisonobe (JIRA)" <j...@apache.org>
Subject [jira] [Created] (MATH-1095) implement algorithms finding smallest enclosing ball of a collection of points
Date Mon, 27 Jan 2014 10:10:38 GMT
Luc Maisonobe created MATH-1095:
-----------------------------------

             Summary: implement algorithms finding smallest enclosing ball of a collection
of points
                 Key: MATH-1095
                 URL: https://issues.apache.org/jira/browse/MATH-1095
             Project: Commons Math
          Issue Type: New Feature
    Affects Versions: 3.2
            Reporter: Luc Maisonobe
            Priority: Minor


One important set of algorithm missing in geomtry is finding a ball enclosing a collection
of points (finding the smallest ball would be even better).

One use case is to have a first extremely fast preliminary exclusion check before attempting
to navigate through a complex BSP tree structure. As the BST tree are currently not optimized
for fast rejection of outside points, it may be costly to use the full tree when the tree
in fact covers a small part of the space and most points are outside of it. A single ball
check of the enclosing ball would speed up computation.



--
This message was sent by Atlassian JIRA
(v6.1.5#6160)

Mime
View raw message