23248 Oswin Aichholzer/.../Franz Aurenhammer/.../Margot Rabl: Divide-and-conquer
for Voronoi diagrams revisited. Internet 2009, 15p.

22311 Franz Aurenhammer/Rolf Klein: Voronoi diagrams.
Internet ca. 2000, 94p.

14172 Mark de Berg/Marc van Kreveld/Mark Overmars/Otfried Schwarzkopf:
Computational geometry. Springer 2000, 360p. DM 59.

8750 Bernard Chazelle a.o.: Application challenges to computational
geometry. Princeton Univ. TR-521-96 (1996), 57p.

8220 L. Chew/Klara Kedem/Stefan Schirra: On characteristic points
and approximate decision algorithms for the minimum Hausdorff distance.
Internet (MPI Informatik Saarbruecken), ca. 1995, 10p.

10504 O. Delgado Friedrichs/Andreas Dress/D. Huson: Tilings and symbols.
A report on the uses of symbolic calculation in tiling theory.
Internet ca. 1995, 16p.

2225 Herbert Edelsbrunner: Algorithms in combinatorial geometry.
Springer 1987.

10282 Herbert Edelsbrunner: Geometric algorithms.
In 10279 Gruber/Wills, 699-735.

14354 Martin Erwig: The graph Voronoi diagram with applications.
Internet ca. 1996, 14p.

H. Groemer: Continuity properties of Voronoi domains.
Monatshefte Math. 75 (1971), 423-431.

10279 Peter Gruber/Joerg Wills (ed.): Handbook of convex geometry. 2 volumes.
North-Holland 1993, 1600p. 0-444-89598-1. $ 309.

Martin Held: Reliable C code for computing triangle-triangle intersections
in 2D and 3D. Technical Note, SUNY Stony Brook, 1993.

7923 Martin Held: On computing Voronoi diagrams of convex polyhedra by
means of wavefront propagation. Internet, ca. 1994, 8.

10283 Martin Henk/Robert Weismantel: On Hilbert bases of polyhedral cones.
Internet 1996, 17p.

19874 Michael Joswig/Thorsten Theobald: Algorithmische Geometrie.
Vieweg 2008, 260p. Eur 30.

14231 Rolf Klein: Concrete and abstract Voronoi diagrams.
Springer LN CS 400 (1989), 170p. DM 62.

26432 Andreas Kriegl: Algorithmische Geometrie. Internet 2012, 118p.

K. Mehlhorn/S. Na''her: LEDA - a platform for combinatorial and
geometric computation. Cambridge UP 1999.

A. Okabe/B. Boots/K. Sugihara: Spatial tessellations. Concepts and 
applications of Voronoi diagrams. Wiley 1992, 530p. DM 217.

9587 Alfred Schmitt/Oliver Deussen/Marion Kreeb: Einfu''hrung in graphisch-
geometrische Algorithmen. Teubner 1996.

M. Shamos: Geometric complexity. 
ACM Symp. Theor. Comp. Sci. 7 (1975), ...

M. Shamos/D. Hoey: Closest point problems.
IEEE Conf. Found. Comp. Sci. 16 (1975), ...

M. Shamos/D. Hoey: Geometric intersection problems.
IEEE Conf. Found. Comp. Sci. 17 (1976), ...

9641 Robert Stein: A point about polygons. Linux Journal March 1997, 67-72.

12567 Ian Stewart: Krater, Kunst und Kegelschnitte. Spektrum 1999/5, 144-146.

22151 Thorsten Theobald: New algebraic methods in computational
geometry. Hab. TU München 2003, 180p.