Qhull for convex hulls, etc.
Edit Page
Report
Scan day: 09 February 2014 UTC
20
Virus safety - good
Description: Qhull for computing the convex hull, Delaunay triangulation, Voronoi diagram, and halfspace intersection about a point.
Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection about a Point Qhull computes the convex hull, Delaunay triangulation, Voronoi diagram, halfspace intersection about a point, furthest-site Delaunay triangulation, and furthest-site Voronoi diagram. The source code runs in 2-d, 3-d, 4-d, and higher dimensions. Qhull implements the Quickhull algorithm for computing the convex hull. It handles roundoff errors from floating point arithmetic. It computes volumes, surface areas, and approximations to the convex hull.
Size: 561 chars
Contact Information
Email:Send Message
Phone&Fax: —
Address: —
Extended: —
WEBSITE Info
| Page title: | Qhull code for Convex Hull, Delaunay Triangulation, Voronoi Diagram, and Halfspace Intersection about a Point |
| Keywords: | |
| Description: | |
| IP-address: | 64.71.34.21 |
WHOIS Info
| NS | Name Server:A.DNS.HOSTWAY.NET Name Server:B.DNS.HOSTWAY.NET Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: Name Server: |
| WHOIS | Status: clientTransferProhibited |
| Date | Creation Date: 2003-06-13T02:35:49Z Expiry Date: 2014-06-13T02:35:49Z |