Referências
- 1
-
B. Chazelle, Triangulating a simple polygon in linear time, Discrete and
Computational Geometry 6 (1991), 485-524.
- 2
-
B. Chazell, Computational geometry: A retrospective, Proceedings of the
Twenty-Sixth 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.
- 3
-
T.H. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to
algorithms, The MIT Electrical Engineering and Computer Scienece Series, The
MIT Press, MacGraw-Hill Book Company, 1990, QA758 C811i.
- 4
-
R. Courant and H. Robbins, What is mathematics?, Oxford University
Press, New York, 1941.
- 5
-
M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf,
Computational geometry, algorithms and applications, Springer Verlag,
1997, second edition, 2000.
- 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
-
L.H. Figueiredo and P.C.P. Carvalho, Introdução à geometria
computacional, 18o.
Colóquio Brasileiro de Matemática, IMPA,
1991, QA758 F475i.
- 10
-
S. Fortune, A sweepline algorithm for Voronoi diagrams, Algorithmica
2 (1987), 153-174.
- 11
-
T. Godfried, Cs-507a computational geometry, 1999, Course Syllabus.
- 12
-
R.L. Graham, An efficient algorithm for determining the convex hull of a
finite planar set, Information Processing Letters 1 (1972),
132-133.
- 13
-
R.L. Graham and F. Yao, A whirlwind tour of computational geometry, The
American Mathematical Monthly 97 (1990), no. 8, 687-701.
- 14
-
L.J. Guibas, CS368: Geometric algorithms, Stanford University, 1997.
- 15
-
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, 1988, pp. 111-165.
- 16
-
S. Khuller, Cmsc 754 computational geometry, Spring 1996, Course
Syllabus.
- 17
-
M.J. Laszlo, Computational geometry and computer graphics in C++,
Prentice Hall, Upper Saddle River, NJ, 1996.
- 18
-
D. Mount, Cmsc 754: Computational geometry, Spring 2000, Course
Syllabus.
- 19
-
K. Mulmuley, Computational geometry: An introduction through randomized
algorithms, Prentice Hall, Englewood Cliffs, NJ, 1994.
- 20
-
J. O'Rourke, Art gallery theorems and algorithms, The International
Series of Monographs on Computer Science, Oxford University Press, New York,
1987, QA830 O74a.
- 21
-
J. O'Rourke, Computational geometry in C, Cambridge University Press,
Cambridge, 1993.
- 22
-
S. Pemmaraju, Computacional geometry 22C:196, Notas de aula, Spring
1996.
- 23
-
F.P. Preparata and M.I. Shamos, Computational geometry: An introduction,
Texts and Monographs in Computer Science, Springer-Verlag, New York, 1985,
QA758 P927c.
- 24
-
M.I. Shamos, Computacional geometry, Ph.D. thesis, Yale University, New
Haven, 1978.
- 25
-
M.I. Shamos and D. Hoey, Closest point problems, Proc. 16th Annual IEEE
Symposium in Foundations of Computer Science, 1975, pp. 151-162.
- 26
-
F.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.
MAC 5747: Apresentação
Last modified: Thu Feb 17 11:48:00 BRST 2000