Details

    • Type: Sub-task
    • Status: Closed
    • Priority: Minor
    • Resolution: Fixed
    • Affects Version/s: None
    • Fix Version/s: 3.3
    • Labels:

      Description

      It would be nice to have convex hull implementations for 2D/3D space. There are several known algorithms http://en.wikipedia.org/wiki/Convex_hull_algorithms:

      • Graham scan: O(n log n)
      • Incremental: O(n log n)
      • Divide and Conquer: O(n log n)
      • Kirkpatrick-Seidel: O(n log h)
      • Chan: O(n log h)

      The preference would be on an algorithm that is easily extensible for higher dimensions, so Incremental and Divide and Conquer would be prefered.

        Attachments

        1. MATH-749.tar.gz
          4 kB
          Thomas Neidhart

          Issue Links

            Activity

              People

              • Assignee:
                tn Thomas Neidhart
                Reporter:
                tn Thomas Neidhart
              • Votes:
                0 Vote for this issue
                Watchers:
                2 Start watching this issue

                Dates

                • Created:
                  Updated:
                  Resolved: