Path: news.mathworks.com!not-for-mail
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$1@fred.mathworks.com>
References: <hss9t2$8ue$1@fred.mathworks.com> <hssaqo$9k5$1@canopus.cc.umanitoba.ca> <9cf53832-31d4-4c7e-b5a2-4994719d03a4@u7g2000vbq.googlegroups.com>
Reply-To: <HIDDEN>
NNTP-Posting-Host: webapp-05-blr.mathworks.com
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
X-Trace: fred.mathworks.com 1274135465 20818 172.30.248.35 (17 May 2010 22:31:05 GMT)
X-Complaints-To: news@mathworks.com
NNTP-Posting-Date: Mon, 17 May 2010 22:31:05 +0000 (UTC)
X-Newsreader: MATLAB Central Newsreader 1440443
Xref: news.mathworks.com comp.soft-sys.matlab:636667

ImageAnalyst <imageanalyst@mailinator.com> wrote in message <9cf53832-31d4-4c7e-b5a2-4994719d03a4@u7g2000vbq.googlegroups.com>...
> 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.
> http://en.wikipedia.org/wiki/Dynamic_programming
=================

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.