References

Cha89

Bernard Chazelle. An optimal algorithm for intersecting three-dimensional convex polyhedra. Technical report, Department of Computer Science, Princeton University, fevereiro 1989. (Extended Abstract at IEEE - 1989, pages 586 - 591).

Ede87

Herbert Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EACTS Monographs on Theoretical Computer Science. Springer-Verlag, Germany, 1987.

FC91

Luiz Henrique de Figueiredo and Paulo César Pinto Carvalho. Introdução à Geometria Computacional. IMPA / CNPq, Rio de Janeiro, RJ, 1991.

GS85

L. Guibas and J. Stolfi. Primitives for the manipulation of general subdivisions and the computation of voronoi diagrams. ACM Transactions on Graphics, 4(2):74 - 123, abril 1985.

GS89

L. Guibas and J. Stolfi. Ruler, compass, and computer: The design and analysis of geometric algorithms. Technical report, Digital Equipments Coorporation - DEC, Systems Research Center, Palo Alto, California, USA., fevereiro 1989.

HMMN84

Stefan Hertel, Martti Mäntylä, Kurt Mehlhorn, and Jurg Nievergelt. Space sweep solves intersection of convex polyhedra. Acta Informatica, 21:501 - 519, 1984. Springer-Verlag.

Pre79

F. P. Preparata. An optimal real-time algorithm for planar convex hulls. Communications of the ACM, 22(7):402 - 405, julho 1979.

PS85

F. P. Preparata and M. I. Shamos. Computational Geometry: An Introdution. Springer-Verlag, New York, USA, 1985.