Math::ConvexHull is a simple Perl module that calculates convex hulls from a set of points in 2D space. It is a straightforward implementation of the algorithm known as Graham's scan which, with complexity of O(n log(n)), is the fastest known* method of finding the convex hull of an arbitrary set of points.
* known to the author, that is!
Follow
0 followers
Journal Entries
No entries yet. Link your entries with 'math-convexhull' to include this project.
Ohloh Analysis Summary
- Mostly written in Perl
- Well-commented source code
- Short source control history
- Only a single active developer
Updated 25 Jul 2008 07:54 UTC
Ratings & Reviews
Community Rating
0.0/5.0
Based on 0 user ratings.
Your Rating
Click to rate this project.
Links
No links submitted so far. Submit your own links.
- Homepage
- http://search.cpan.org/dist/Math-ConvexHull
- Licensed under
- Artistic License and GNU General Public License 2.0 or later
- Tagged as
-
geometry 2d convex_hull perl math algorithm science cpan
|
edit tags
Where in the world?
Related Projects by Tags
Project Cost |
|
|---|---|
| This calculator estimates how much it would cost to hire a team to write this project from scratch. More » | |
| Include | |
| Codebase | 159 |
| Effort (est.) | 0 Person Years |
| Avg. Salary | $ year |
| $ 1,595 | |
