Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!rutgers!mit-eddie!uw-beaver!tektronix!cae780!leadsv!morse
From: morse@leadsv.UUCP (Terry Morse)
Newsgroups: comp.graphics
Subject: Computational Geometry Question
Message-ID: <1501@leadsv.UUCP>
Date: Fri, 1-May-87 17:08:57 EDT
Article-I.D.: leadsv.1501
Posted: Fri May  1 17:08:57 1987
Date-Received: Sun, 3-May-87 04:51:19 EDT
Organization: Lockheed, Sunnyvale CA
Lines: 16

I am looking for algorithms that can efficiently route around polygonal
obstacles.  Does anybody have any pointers?  I have found only one
reference:

	Clarkson, Kapoor, Vaidya:

	"Rectilinear Shortest Paths Through Polygonal Obstacles in
	O(n log^2 n) Time"

The authors are from Bell Labs.  If any of the authors are out there, would you
please respond to me?  I have not been able to locate the paper yet.  Many
thanks in advance.
-- 

Terry Morse  (408)743-1487
{ hplabs!cae780 } | { ihnp4!sun!sunncal } !leadsv!morse