Re: determining boundary of a region in n-dimensional euclidean space
- To: mathgroup at smc.vnet.net
- Subject: [mg117659] Re: determining boundary of a region in n-dimensional euclidean space
- From: Christopher Henrich <chenrich at monmouth.com>
- Date: Tue, 29 Mar 2011 06:55:18 -0500 (EST)
- References: <ilbebl$b2o$1@smc.vnet.net>
In article <ilbebl$b2o$1 at smc.vnet.net>, Nabeel Butt <nabeel.butt at gmail.com> wrote: > Hi Daniel > Thanks for your response.Actually the problem is two-fold here.The > first step is to actually extract the boundary points from a set of points > in a list.I have found that built-in ConvexHull function in mathematica can > do for 2-dimensions this extraction process.There exists a program also for > 3-dimensions written in mathworld.To my best of my knowledge it hasnt been > implemented in higher dimensions that well in mathematica(was just a random > google search though !!) . Anyways after we get the list for boundary > points , like you said I can use Interpolation on list to represent it > numerically.What I am more interested in is actually extracting the boundary > points from a set of points -Does there exist more robust convexhull like > functions for higher dimensions ? Or after having a list of points I can > send them to another software which helps me get the convex hull in high > dimensions.Possibly if I can call another software inside mathematica that > would be great. > Thanks once again. > Nabeel Here is a framework from the Wolfram Library Archive, which may be helpful to you: http://library.wolfram.com/infocenter/MathSource/7034/ -- Christopher J. Henrich chenrich at monmouth.com http://www.mathinteract.com "A bad analogy is like a leaky screwdriver." -- Boon