Uploaded image for project: 'Commons Math'
  1. Commons Math
  2. MATH-1095

implement algorithms finding smallest enclosing ball of a collection of points

    Details

    • Type: New Feature
    • Status: Closed
    • Priority: Minor
    • Resolution: Fixed
    • Affects Version/s: 3.2
    • Fix Version/s: 3.3
    • Labels:
      None

      Description

      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.

        Attachments

          Issue Links

            Activity

              People

              • Assignee:
                Unassigned
                Reporter:
                luc Luc Maisonobe
              • Votes:
                0 Vote for this issue
                Watchers:
                1 Start watching this issue

                Dates

                • Created:
                  Updated:
                  Resolved: