Algorithm for approximating curveto by line segments

Article View: comp.lang.postscript

Article #3977

Back to comp.lang.postscript Previous Next

#3977

From: Eric Henry
Date: Thu, 05 Nov 1992 20:57

5 lines
637 bytes

The subject header pretty much says it.  Can anybody describe the algorithm
by which, for a given currentflat, a curveto is approximated by a set of
connected line segments?  E-mail or post would be fine.  Thank you...
Eric Henry
eric@helix.nih.gov

Technical Details

Message-ID: <1992Nov5.205748.4221@alw.nih.gov>

Path: arc1-ca.pugleaf.net!sparky!uunet!nih-csl.dcrt.nih.gov!postman

Show Full Headers

Complete Article Headers

Newsgroups: comp.lang.postscript
Path: arc1-ca.pugleaf.net!sparky!uunet!nih-csl.dcrt.nih.gov!postman
From: eric@helix.nih.gov (Eric Henry)
Subject: Algorithm for approximating curveto by line segments
Message-ID: <1992Nov5.205748.4221@alw.nih.gov>
Sender: postman@alw.nih.gov (AMDS Postmaster)
Organization: National Institutes of Health, Bethesda
Date: Thu, 5 Nov 1992 20:57:48 GMT
Lines: 6