From: <HIDDEN>
Newsgroups: comp.soft-sys.matlab
Subject: Re: find distance along complicated geometric surface
Date: Mon, 17 May 2010 22:31:05 +0000 (UTC)
Organization: Xoran Technologies
Lines: 8
Message-ID: <hssg39$kai$>
References: <hss9t2$8ue$> <hssaqo$9k5$> <>
Reply-To: <HIDDEN>
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: 1274135465 20818 (17 May 2010 22:31:05 GMT)
NNTP-Posting-Date: Mon, 17 May 2010 22:31:05 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1440443
Xref: comp.soft-sys.matlab:636667

ImageAnalyst <> wrote in message <>...
> Couldn't you use dynamic programming?  I used that once to track blood
> vessels but it's a pretty general concept that I think should be able
> to find the shortest distance numerically.

Perhaps if the linear pieces of the path were requireded to run between vertices of the polyhedron. Otherwise, I don't see what sort of backward induction rule you could set up.