From: "Guillaume " <>
Newsgroups: comp.soft-sys.matlab
Subject: Re: volume
Date: Mon, 23 Aug 2010 15:10:04 +0000 (UTC)
Organization: The MathWorks, Inc.
Lines: 10
Message-ID: <i4u30c$4g9$>
References: <hkp2qk$ln8$> <hkp5kj$fvq$> <i4h5bc$d9j$> <i4h71c$kr$> <i4hk9o$oec$> <i4hni0$qa4$>
Reply-To: "Guillaume " <>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: 1282576204 4617 (23 Aug 2010 15:10:04 GMT)
NNTP-Posting-Date: Mon, 23 Aug 2010 15:10:04 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 732491
Xref: comp.soft-sys.matlab:664311

>   You are still lacking a valid definition for "the volume of the smallest set containing all the initial points".  A finite set of points does not define a volume until you define the infinite set of points that lie in the region of the volume.  One way to do that is to construct the connections between the finite set as defining the edges and faces of a polyhedron which is to then constitute your region (your volume.)  You have yet to lay out any systematic method of determining such connections.  In the five-point example I gave earlier how would you define the polyhedron connecting them in some canonical way that avoids the ambiguity I pointed out?
> Roger Stafford

I think I would take the Jarvis March method and take limit the distance between the current point and the next one. Howver, Jarvis March requires a notion of angle, which I can't adapt in N-Dimensional space. Do you know how to adapt this algorithm ?

Thanks per advance,