From: "Bruno Luong" <b.luong@fogale.findmycountry>
Newsgroups: comp.soft-sys.matlab
Subject: Re: find distance along complicated geometric surface
Date: Tue, 18 May 2010 14:57:04 +0000 (UTC)
Organization: FOGALE nanotech
Lines: 9
Message-ID: <hsu9s0$nci$>
References: <hss9t2$8ue$> <hsu6ok$mou$> <ovxIn.11220$wV.3023@newsfe11.iad>
Reply-To: "Bruno Luong" <b.luong@fogale.findmycountry>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: 1274194624 23954 (18 May 2010 14:57:04 GMT)
NNTP-Posting-Date: Tue, 18 May 2010 14:57:04 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 390839
Xref: comp.soft-sys.matlab:636873

Walter Roberson <> wrote in message <ovxIn.11220$wV.3023@newsfe11.iad>...
> Algorithms for finding the shortest path 
> on a convex shape are not the same as finding the shortest path on a 
> concave shape.

What is a concave shape? Is it a complement of a convex shape? Or do you mean a non-convex shape?