<?xml version="1.0" encoding="UTF-8"?>
<response>
  <status>success</status>
  <result>
    <project>
      <id>14536</id>
      <name>Math::ConvexHull</name>
      <created_at>2008-05-30T12:08:05Z</created_at>
      <updated_at>2009-01-24T07:57:31Z</updated_at>
      <description>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!</description>
      <homepage_url>http://search.cpan.org/dist/Math-ConvexHull</homepage_url>
      <download_url></download_url>
      <url_name>math-convexhull</url_name>
      <medium_logo_url>http://bits.ohloh.net/attachments/6236/perl-module_med.png</medium_logo_url>
      <small_logo_url>http://bits.ohloh.net/attachments/6236/perl-module_small.png</small_logo_url>
      <user_count>1</user_count>
      <average_rating></average_rating>
      <rating_count>0</rating_count>
      <analysis_id>183910</analysis_id>
      <analysis>
        <id>183910</id>
        <project_id>14536</project_id>
        <updated_at>2009-12-02T00:32:29Z</updated_at>
        <logged_at>2009-12-02T00:32:17Z</logged_at>
        <min_month>2008-05-01T00:00:00Z</min_month>
        <max_month>2008-05-01T00:00:00Z</max_month>
        <twelve_month_contributor_count>1</twelve_month_contributor_count>
        <total_code_lines>159</total_code_lines>
        <main_language_id>8</main_language_id>
        <main_language_name>Perl</main_language_name>
      </analysis>
      <licenses>
        <license>
          <name>artistic</name>
          <nice_name>Artistic License</nice_name>
        </license>
        <license>
          <name>gpl2_or_later</name>
          <nice_name>GNU General Public License 2.0 or later</nice_name>
        </license>
      </licenses>
    </project>
  </result>
</response>
