Re: 3D Convex Hull
- To: mathgroup at smc.vnet.net
- Subject: [mg44698] Re: 3D Convex Hull
- From: nafod40 <noneya at business.com>
- Date: Fri, 21 Nov 2003 05:13:20 -0500 (EST)
- Organization: Penn State University, Center for Academic Computing
- References: <bphu7f$1nq$1@smc.vnet.net>
- Sender: owner-wri-mathgroup at wolfram.com
Gilmar Rodr?guez Pierluissi wrote: > A Mathematica program to build a Three Dimensional Convex Hull > for a set of 3-dimensional points, and a notebook to test this > program, appear in: > > http://forums.wolfram.com/mathgroup/archive/1998/May/msg00005.html > > The program works fine for a small input data set (the input data > set used in the notebook is called "points"), but the program becomes > very sluggish for larger input data sets. I want to know if there > exist any improved versions of this program (since 1988), built by > either the author(Wouter Meeussen), or any other person who might > have used it, and tested it with larger input data sets. > Thank you for your feedback! I looked at it, but did not run it. I'd be curious to know it's order of complexity. There are algorithms (I believe) that are O(n (log n)^2) for finding the convex hull.