Path: news.mathworks.com!newsfeed-00.mathworks.com!panix!bloom-beacon.mit.edu!micro-heart-of-gold.mit.edu!nntp.club.cc.cmu.edu!pitt.edu!newsflash.concordia.ca!canopus.cc.umanitoba.ca!not-for-mail
From: Walter Roberson <roberson@hushmail.com>
Newsgroups: comp.soft-sys.matlab
Subject: Re: find distance along complicated geometric surface
Date: Mon, 17 May 2010 16:16:31 -0500
Organization: Canada Eat The Cookie Foundation
Lines: 23
Message-ID: <hssboe$avg$1@canopus.cc.umanitoba.ca>
References: <hss9t2$8ue$1@fred.mathworks.com> <hssaqo$9k5$1@canopus.cc.umanitoba.ca>
NNTP-Posting-Host: ibd-nat.ibd.nrc.ca
Mime-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
X-Trace: canopus.cc.umanitoba.ca 1274131022 11248 132.246.133.10 (17 May 2010 21:17:02 GMT)
X-Complaints-To: abuse@cc.umanitoba.ca
NNTP-Posting-Date: Mon, 17 May 2010 21:17:02 +0000 (UTC)
User-Agent: Thunderbird 2.0.0.24 (X11/20100317)
In-Reply-To: <hssaqo$9k5$1@canopus.cc.umanitoba.ca>
Xref: news.mathworks.com comp.soft-sys.matlab:636644

Walter Roberson wrote:
> Meagan wrote:
> 
>> I am trying to find the distance between two points on a shape that is 
>> defined by vertices and faces. I can't just use the distance formula 
>> because I need to make sure that the entire distance between the two 
>> points is in contact with the shape surface. I have no idea how to 
>> start doing this or if this task is even possible so any input would 
>> be greatly appreciated.
> 
> Sounds tricky.
> 
> To cross-check

Another question to cross-check: is this a 2D or 3D problem (or more?)

When you speak of "distance" and needing contact with the shape surface, would 
I be correct in figuring that what you want is the "path length" ? Just to be 
sure we have disambiguited "distance" correctly.

For example, if we had a discretized helix, then the distance between two 
points would be the same no matter how tightly or loosely the helix was coiled 
(provided that the coils did not touch) ?