pete@Octopus.COM (Pete Holzmann) (03/08/90)
Thanks to all who sent 'me too' requests to me as a result of my request
for an implementable complex polygon-polygon clipper to replace Weiler-
Atherton!
I've got leads on a couple of possible algorithms at this point. I'll
post a summary once the stuff arrives.
In the meantime, I thought I'd mention: it appears that this is NOT a
well-answered question. If any students out there want to grab an interesting
topic of study for graduate work, this probably counts as a good one!
Most clipping algorithms I've seen so far are simply unusable in the
real world. One, for example, assumes:
- no horizontal or vertical edges
- no colocated vertices
- infinite precision math
Real handy, huh! BIG sigh.
Anyway, more info to come in a few days...
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