🚀 go-pugleaf

In article <1992Aug21.090522.10455@adobe.com> delahunt@adobe.com (Jim DeLaHunt) writes:
>The solutions to this problem are unfortunately application-specific.  
>If the application knows its polygon doesn't self-intersect and has no holes
>in it, it might get away with simply issuing 'fill' operators every 1500
>vertices or so.  This will print correctly on most PostScript interpreter
>implementations. ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
 ^^^^^^^^^^^^^^^
This works for non-trivial (i.e., concave) polygons??  BTW, what is implemen-
tation-dependent about it?

Is there some philosophical reason why PS doesn't decompose polygons that
are too complex?  In an application, the poor developer is stuck with 
decomposing curved-edge polygons into simpler pieces, which is slow and
prone to numeric errors.  In the interpreter, this could be done after the 
path is flattened, so that only line segments need be dealt with.  Sure 
seems like something that the interpreter should deal with, not the app, 
IMHO.

-- 
Larry Spence
larry@cs.com
uunet!csccat!larry or sun!texsun!csccat!larry