References

[1]

Aurenhammer F., Voronoi Diagrams: A Survey of a Fundemental Geometric Data Structure, ACM Computing Surveys, Vol. 23, No.3, September 1991, pp. 345-405.

[2]

Cormen T. H., Leiserson C. E., Rivest R. L., Introduction to Algorithms, 1990.

[3]

Edelsbrunner H., Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, Germany, 1987.

[4]

Edelsbrunner H., Mucke E. P., Simulation of Simplicity: a technique to cope with degenerate cases in geometric algorithms. Proceedings Annual ACM Symposium on Computational Geometry, 1988, pp. 118-133.

[5]

Edelsbrunner H., Two Weeks Worth of Teaching, Lecture notes of CS373, University of Illinois U.C, Spring 1997.

[6]

Fortune S., A Sweepline Algorithm for Voronoi Diagrams, Algorithmica, Vol. 2, pp. 153-174.

[7]

Guibas L., Stolfi J., ``Primitives for the manipulation of General Subdivisions and Computation of Voronoi Diagrams'', ACM Transactions on Graphics, Vol. 4, No. 2, April 1985, pp. 74-123.

[8]

Hausner A., Dobkin D. P., Making Geometry Visible: An Introduction to the Animation of Geometric Algorithms, Technical Report, Computer Science Department, Princeton University, May 1996.

[9]

Lazslo M. J., Computational Geometry and Computer Graphics in C++, Prentice Hall, 1996.

[10]

Mulmuley K., Computational Geometry: An Introduction through Randomized Algorithms, Prentice Hall, Englewood Cliffs, NJ, 1994.

[11]

O'Rourke J., Computational Geometry in C, Cambridge University Press, 1994.

[12]

Preparata F. P., Shamos M. I., Computational Gemoetry: An Introduction, Springer-Verlag, NewYork, 1985.

[13]

Sedgewick R., Algorithms, Addison-Wesley, 2nd edition, 1988.

[14]

Weiss M. A., Data Structures and Algorithms Analysis, Benjamin Cummings, 1992.