1. F. Aurenhammer. Voronoi diagrams: a survey of a fundamental geometric data structure. ACM Comput. Surv., 23:345–405, 1991.
2. J.D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Technical report, INRIA, 1990.
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 and Computational Geometry, 8:51–71, 1992.
4. M.O. Benouamer, P. Jaillon, D. Michelucci, and J-M. Moreau. A “lazy” solution to imprecision in computational geometry. In 5th Canadian Conf. on Computational Geometry, pages 73–78, 1993.
5. J. Blömer. Computing sums of radicals in polynomial time. In FOCS91, pages 670–677, 1991.