The shuffling buffer

International Journal of Computational Geometry and Applications

Volumn 11, Issue 5, 2001, Pages 555-572

  Devillers, Olivier ^a   Guigue, Philippe ^a  

^a INRIA   (France)

Author keywords

Computational and structural complexity; Computational geometry; On line algorithms; Randomized algorithms

Indexed keywords

EID: 0035634788     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S021819590100064X     Document Type: Article

References (15)

1. J.-D. Boissonnat, O. Devillers, R. Schott, M. Teillaud, and M. Yvinec. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput. Geom., 8:51-71, 1992.
2. Jean-Daniel Boissonnat and Monique Teillaud. On the randomized construction of the Delaunay tree. Technical Report 1140, INRIA Sophia-Antipolis, Valbonne, France, 1989.
3. K. L. Clarkson and P. W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom., 4:387-421, 1989.
4. O. Devillers, M. Teillaud, and M. Yvinec. Dynamic location in an arrangement of line segments in the plane. Rapport de recherche 1558, INRIA, 1991.
5. Olivier Devillers. The Delaunay hierarchy. Internat. J. Found. Comput. Sci., to appear.
6. Olivier Devillers and Philippe Guigue. Le tampon mélangeur. Rapport de recherche 3988, INRIA, 2000.
7. P. J. Green and R. R. Sibson. Computing Dirichlet tessellations in the plane. Comput. J., 21:168-173, 1978.
8. Leonidas J. Guibas, D. E. Knuth, and Micha Sharir. Randomized incremental construction of Delaunay and Voronoi diagrams. Algorithmica, 7:381-413, 1992.
9. Rolf Klein, Kurt Mehlhorn, and Stefan Meiser. Randomized incremental construction of abstract Voronoi diagrams. Comput. Geom. Theory Appl., 3(3):157-184, 1993.
10. J.-M. Moreau. Hierarchical Delaunay triangulation. In Proc. 6th Canad. Conf. Comput. Geom., pages 165-170, 1994.
11. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, New York, NY, 1995.
12. Ernst P. Mücke, Isaac Saias, and Binhai Zhu. Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 274-283, 1996.
13. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, Englewood Cliffs, NJ, 1993.
14. R. Seidel. Backwards analysis of randomized geometric algorithms. Report TR-92-014, Computer Science Division, University of California, Berkeley, February 1992.
15. A. Wiernik and Micha Sharir. Planar realizations of nonlinear Davenport-Schinzel sequences by segments. Discrete Comput. Geom., 3:15-47, 1988.