HULL  A program for convex hulls
Library Home 
Full Table of Contents 
Suggest a Link 
Library Help
http://cm.belllabs.com/netlib/voronoi/hull.html  


Ken Clarkson  
Hull is an ANSI C program that computes the convex hull of a point set in general (but small) dimension. The input is a list of points, and the output is a list of facets of the convex hull of the points, each facet presented as a list of its vertices. (The facets are assumed to be simplices, such as triangles in 3d; this is enforced by tiebreaking, giving a triangulation of a facet by "placing.") The program can also compute Delaunay triangulations and alpha shapes, and volumes of Voronoi regions. The program uses exact arithmetic when possible, with a moderate speed penalty. (Typically a factor of 2 or 3 for Delaunay triangulation, less for convex hulls). Output in postscript and OFF format for geomview is supported.  


Levels:  College, Research 
Languages:  English 
Resource Types:  Topic Tools Miscellaneous 
Math Topics:  Computational Geometry 
[Privacy Policy] [Terms of Use]
© 1994 Drexel University. All rights reserved.
http://mathforum.org/
The Math Forum is a research and educational enterprise of the Drexel University School of Education.