summaryrefslogtreecommitdiff
path: root/BIBLIOGRAPHY
diff options
context:
space:
mode:
authorCarl Worth <cworth@cworth.org>2006-11-30 09:15:00 -0800
committerCarl Worth <cworth@cworth.org>2006-11-30 09:15:00 -0800
commit7fb4e978735bd7c9f3cff970ac6757feff3e74bb (patch)
tree4a68ea84e74d5ed98d4b3190e74f15c5f5f53a27 /BIBLIOGRAPHY
parent7fbe594d3d04137daca4d3c3a28057b71b03f33d (diff)
BIBLIOGRAPHY: Add Joseph O'Rourke's book as recommended by Rafael Villar Burke
Diffstat (limited to 'BIBLIOGRAPHY')
-rw-r--r--BIBLIOGRAPHY7
1 files changed, 5 insertions, 2 deletions
diff --git a/BIBLIOGRAPHY b/BIBLIOGRAPHY
index 46693a66..073e636d 100644
--- a/BIBLIOGRAPHY
+++ b/BIBLIOGRAPHY
@@ -11,13 +11,16 @@ Given a Bézier path, approximate it with line segments:
That technical report might be "hard" to find, but fortunately
this algorithm will be described in any reasonable textbook on
- computational geometry. One that is recommended by a
- contributor to cairo is:
+ computational geometry. Two that have been recommended by
+ cairo contributors are:
"Computational Geometry, Algorithms and Applications", M. de
Berg, M. van Kreveld, M. Overmars, M. Schwarzkopf;
Springer-Verlag, ISBN: 3-540-65620-0.
+ "Computational Geometry in C (Second Edition)", Joseph
+ O'Rourke, Cambridge University Press, ISBN 0521640105.
+
Then, if stroking, construct a polygonal representation of the pen
approximating a circle (if filling skip three steps):