Commons Math
  1. Commons Math
  2. MATH-1095

implement algorithms finding smallest enclosing ball of a collection of points

    Details

    • Type: New Feature New Feature
    • Status: Closed
    • Priority: Minor 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.

        Issue Links

          Activity

          Luc Maisonobe made changes -
          Status Resolved [ 5 ] Closed [ 6 ]
          Luc Maisonobe made changes -
          Status Open [ 1 ] Resolved [ 5 ]
          Fix Version/s 3.3 [ 12324600 ]
          Resolution Fixed [ 1 ]
          Luc Maisonobe made changes -
          Field Original Value New Value
          Link This issue is related to MATH-749 [ MATH-749 ]
          Luc Maisonobe created issue -

            People

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

              Dates

              • Created:
                Updated:
                Resolved:

                Development