Qhull
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.
more…
Activities 
-
Friday February 03 2012
-
Push
05:45
-
-
Saturday January 28 2012
-
Push
15:56
-
Push
15:54
-
-
Tuesday January 17 2012
-
Repository
13:44
-
-
Monday December 05 2011
-
Push
00:09
-
-
Sunday December 04 2011
-
Push
23:39
-
Push
23:05
-
Commit
22:39
-
Merge request
22:22
-
Favorite
22:18
-
Commit
22:16
-
Push
22:14
-
Push
21:18
-
Repository
21:10
-
-
Saturday December 03 2011
-
Push
04:24
-
-
Thursday December 01 2011
-
Push
03:39
-
-
Wednesday November 30 2011
-
Push
04:16
-
Push
04:13
-
-
Sunday November 20 2011
-
Wiki
00:09
-
-
Monday October 24 2011
-
Repository
01:03
-
-
Wednesday September 21 2011
-
Repository
20:35
-
Repository
20:22
-
-
Friday June 17 2011
-
Favorite
03:09
-
-
Wednesday June 15 2011
-
Repository
20:44
-
-
Friday May 27 2011
-
Repository
10:23
-
-
Tuesday May 24 2011
-
Push
02:33
-
Push
02:32
-
-
Saturday May 14 2011
-
Push
18:01
-
Push
17:59
-
-
Monday April 18 2011
-
Merge request
15:22
-

