BIB-VERSION:: CS-TR-v2.0
ID:: ncstrl.dartmouthcs//TR90-146
ENTRY:: January 20, 1995
ORGANIZATION:: Dartmouth College, Computer Science
TITLE:: Planar Graphs and Sparse Graphs from Efficient Motion Planning in the Plane
TYPE:: Technical Report (paper)
REVISION:: 1
AUTHOR:: Chew, L. Paul
NOTE:: The 'January' in DATE is an arbitrary placeholder.
DATE:: January 1990
RETRIEVAL:: For a paper copy, email <reports@cs.dartmouth.edu>
RETRIEVAL:: For a paper copy, write to
       Technical Report Librarian
       Department of Computer Science
       Dartmouth College
       6211 Sudikoff Laboratory
       Hanover, NH 03755-3510
       USA
RETRIEVAL:: PDF at http://www.cs.dartmouth.edu/reports/TR90-146.pdf
ABSTRACT::
	Given a source, a destination, and a number of obstacles in
the plane, the Motion Planning Program is to determine the best path
to move an object (a robot) from the source to the destination without
colliding with any of the obstacles.  For us, motion is restricted to
the plane, the robot is represented by a point, and the obstacles are
represented by a set of polygons with a total of n vertices among all
the polygonal obstacles.
END:: ncstrl.dartmouthcs//TR90-146