mdoerr@uklirb.UUCP (06/09/87)
I'm looking for algorithms and/or references to solutions of the
following problems:
1. I want to approximate 4-point Bezier curves with straight line segments.
The number of segments is dependent on a so called flatness parameter.
How are these segments computed? I'm actually looking for something like
the PostScript operator flattenpath.
2. I want to approximate arcs with 4-point Bezier curves. I have the following
information at my disposition: center of arc, radius, starting and ending
angle. How many Bezier curves are needed for a given arc (this depends on
the difference between ending and starting angle)? How have the control
points to be chosen to yield a minimum error? This is the way how PostScript
machines do circles.
Please respond by Email to the following address:
uucp: ...!seismo!unido!uklirb!mdoerr
ARPA: mdoerr%uklirb%unido@seismo.CCS.GOV
BITNET: mdoerr%uklirb.UUCP@unido.BITNET
If there's enough interest I'll post a summary of answers to the net.
Thanks in advance, Michael.
===================================================================
Michael "The Turtle" Doerr %% /-------\ %%
CS Department (FB Informatik) % o o %
University of Kaiserslautern -{ o o o }==O
D-6750 Kaiserslautern (West Germany) % o o %
uucp: ...!seismo!unido!uklirb!mdoerr %% \-------/ %%