MAC 331 / MAC 5747 Geometria Computacional

1. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf, Computational Geometry, Algorithms and Applications, Springer Verlag, 1997 (second edition, 2000).
2. B. Chazelle, Triangulating a simple polygon in linear time, Discrete and Computacional Geometry (1991), 6, 485--524.
3. B. Chazelle, Computational geometry: A retrospective, Proceedings of the Twenty-Sisth Annual ACM Symposium on Theory of Computing (Montréal, Québec, Canada), The ACM Special Interest Group for Algorithms and Computation Theory, May 1994, pp. 75--94.
4. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, The MIT Press, McGraw-Hill Book Company, 1990, QA758 C811i.
5. R. Courant and H. Robbins, What is mathematics?,, Oxford University Press, New York, 1941.
6. P.J. de Resende, and J. Stolfi, Fundamentos de geometria computacional, IX Escola de Computação, 1994.
7. H. Edelsbrunner, Algorithms in Combinatorial Geometry, EATCS Monographs on Theoretical Computer Science, no. 10, Springer-Verlag, Berlin, 1987, QA758 E21a.
8. C.E. Ferreira, MAC-747 geometria computacional, Notas de aula, 1995.
9. C.E. Ferreira, MAC-5747 geometria computacional, Notas de aula, 1999.
10. L.H. Figueiredo and P.C.P. Carvalho, Introdução à geometria computacional, 18o. Colóquio Brasileiro de Matemática, IMPA, 1991, QA758 F475i.
11. S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica 2 (1987), 153--174.
12. T. Godfried, CS-507A Computational Geometry, Course Syllabus, 1999.
13. R.L. Graham, An efficient algorithm for determining the convex hull of a finite planar set, Information Processing Letters 1 (1972), 132--133.
14. R.L. Graham and F. Yao, A whirlwind tour of computational geometry, The American Mathematical Monthly 97 (1990), no. 8, 687--701.
15. L.J. Guibas, CS368: Geometric algorithms, Stanford University, 1997.
16. L.J. Guibas and J. Stolfi, Ruler, Compass and Computer: The Design and Analysis of Geometric Algorithms, Theoretical Foundations of Computer Graphics and CAD (R.A. Earnshaw, ed.), NATO ASI Series, vol. F40, Springer-Verlag, pp. 111--165.
17. L.J. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , ACM Transactions on Graphics 4 (1986), no. 2, 74--123.
18. Samir Khuller, CMSC 754 Computational Geometry, Course Syllabus, Spring 1996.
19. D.E. Knuth, The art of computer programming, vol 1: Fundamental algorithms, Addison-Wesley, Reading, Mass., 1968, QA758 K74a.
20. D.E. Knuth, Literate Programming, CSLI Lecture Notes Number 27, Center for the Study of Language and Information, 1992, QA752 K74L.
21. D.E. Knuth, The Stanford GraphBase: A platform for combinatorial computing, Addison Wesley, New York, 1993.
22. D.E. Knuth, and Silvio Levy, The CWEB System of Structured Documentation, Addison Wesley, Reading, Massachusetts, 1994.
23. T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to algorithms, The MIT Press, McGraw-Hill Book Company, 1990, QA758 C811i.
24. M.J. Laszlo, Computational Geometry and Computer Graphics in C++, Prentice Hall, Upper Saddle River, NJ, 1996.
25. K. Mehlhorn and St. Näher, The LEDA Platform of Combinatorial and Geometric Computing, Cambridge Press, 2000.
26. David Mount, CMSC 754: Computational Geometry, Course Syllabus, Spring 2000.
27. K. Mulmuley, Computational Geometry: An Introduction Through Randomized Algorithms, Prentice Hall, Englewood Cliffs, NJ, 1994.
28. J. O'Rourke, Art Gallery Theorems and Algorithms, The International Series of Monographs on Computer Science, Oxford University Press, New York, 1987, QA830 O74a.
29. J. O'Rourke, Computational Geometry in C, Cambridge University Press, Cambridge, 1994 [second edition, 1998].
30. S. Pemmaraju, Computational geometry 22C:196, Course Syllabus, Spring 1996.
31. F.P. Preparata and M.I. Shamos, Computational Geometry: An Introduction, Texts and Monographs in Computer Science, Springer-Verlag, New York, 1985, QA758 P927c.
32. M.I. Shamos, Computational geometry, Ph.D. thesis, Yale University, New Haven, 1978.
33. M.I. Shamos and D. Hoey, Closest point problems, Proc. 16th Annual IEEE Symposium in Foundations of Computer Science, 1975, pp. 151--162.
34. F. Yao, Computational geometry, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), vol. A, The MIT Press/Elsevier, Amsterdam, 1990, QA810.C3 V259h v.1A, pp. 343--389.