Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!utgpu!water!watmath!clyde!rutgers!ames!hao!husc6!seismo!mcvax!unido!uklirb!mdoerr
From: mdoerr@uklirb.UUCP
Newsgroups: comp.graphics
Subject: Help needed with Bezier curves - (nf)
Message-ID: <23800001@uklirb.UUCP>
Date: Tue, 9-Jun-87 06:15:00 EDT
Article-I.D.: uklirb.23800001
Posted: Tue Jun  9 06:15:00 1987
Date-Received: Sun, 14-Jun-87 19:44:33 EDT
Lines: 30
Nf-ID: #N:uklirb:23800001:000:1350
Nf-From: uklirb!mdoerr    Jun  9 11:15:00 1987

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		%% \-------/ %%