Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!usc!elroy.jpl.nasa.gov!ames!vsi1!octopus!pete
From: pete@Octopus.COM (Pete Holzmann)
Newsgroups: comp.graphics
Subject: Request: Plotter pen vector optimization algorithm
Message-ID: <1990Mar8.060653.14280@Octopus.COM>
Date: 8 Mar 90 06:06:53 GMT
Reply-To: pete@octopus.COM (Pete Holzmann)
Organization: Octopus Enterprises, Cupertino CA
Lines: 27

Does anybody know of references or working code to solve the following
problem?...

Problem: Given a set of mostly multiply-connected 2D line segments (think
of a piece of a street map, but with lots of dangling segments around the
edges, and extra or missing connections in various places in the middle),
I would like to produce the longest possible (preferably mostly-straight)
segment chains in order to plot the complete set of segments.

Basically, the goal is:
	1) Avoid lifting the pen
	2) Avoid sharp corners

It is more important to do a pretty good job quickly, than to do a perfect
job in a ridiculous amount of time.

Any ideas out there?

Thanks!

Pete
-- 
Peter Holzmann, Octopus Enterprises   |(if you're a techie Christian & are
19611 La Mar Ct., Cupertino, CA 95014 |interested in helping w/ the Great
UUCP: {hpda,pyramid}!octopus!pete     |Commission, email dsa-contact@octopus)
DSA office ans mach=408/996-7746;Work (SLP) voice=408/985-7400,FAX=408/985-0859