You are viewing a plain text version of this content. The canonical link for it is here.

Posted to issues@commons.apache.org by "Thomas Neidhart (Updated) (JIRA)" <ji...@apache.org> on 2012/02/18 19:46:00 UTC

[jira] [Updated] (MATH-749) Convex Hull algorithm

     [ https://issues.apache.org/jira/browse/MATH-749?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ]

Thomas Neidhart updated MATH-749:
---------------------------------

    Priority: Minor  (was: Major)
    
> Convex Hull algorithm
> ---------------------
>
>                 Key: MATH-749
>                 URL: https://issues.apache.org/jira/browse/MATH-749
>             Project: Commons Math
>          Issue Type: New Feature
>            Reporter: Thomas Neidhart
>            Priority: Minor
>              Labels: 2d, geometric
>             Fix For: 3.1
>
>
> It would be nice to have an implementation of Graham's scan algorithm to compute the convex hull of a set of points in a plane.

--
This message is automatically generated by JIRA.
If you think it was sent incorrectly, please contact your JIRA administrators: https://issues.apache.org/jira/secure/ContactAdministrators!default.jspa
For more information on JIRA, see: http://www.atlassian.com/software/jira