1. G. Albers, L.J. Guibas, J.S.B. Mitchell, and T. Roos, Voronoi diagrams of moving points, Tech. Rep. 235, ETH Zürich, 1995, to appear in Intl. J. Comp. Geom. & Appl.
2. F. Aurenhammer, Voronoi diagrams: A survey of a fundamental geometric data structure, ACM Comput. Surv., Vol. 23, pp 345–405, 1991.
3. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec, Applications of random sampling to on-line algorithms in Computational Geometry, Discrete & Computational Geometry, Vol. 8, pp 51–71, 1992.
4. P. Chew, Near-quadratic bounds for the L 1 Voronoi diagram of moving points, Proc. 5th Canad. Conf. Comp. Geom. CCCG'93, pp 364–369, 1993.
5. N.R. Chrisman, J.A. Dougenik, and D. White, Lessons for the design of polygon overlay processing from the Odyssey Whirlpool algorithm, Proc. 5th Intl. Symp. on Spatial Data Handling SDH'92, Charleston, pp 401–410, 1992.