Jean-Daniel Boissonnat, Olivier Devillers, René Schott, Monique Teillaud, Mariette Yvinec  Home/Search
Context Related
| sop.inria.fr/prism...styarsol92.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: sop.inria.fr/prisme...DEVILLERSO (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: This paper presents a general framework for the design and randomized analysis of geometric algorithms. These algorithms are on-line and the framework provides general bounds for their expected space and time complexities when averaging over all permutations of the input data. The method is general and can be applied to various geometric problems. The power of the technique is illustrated by new efficient on-line algorithms for constructing convex hulls and Voronoi diagrams in any... (Update)
Cited by: More
Voronoi Diagrams - Aurenhammer, Klein (Correct)
Furthest Site Abstract Voronoi Diagrams - Mehlhorn, Meiser, Rasch (Correct)
The Shuffling Buffer - Devillers, Guigue (Correct)
Similar documents (at the sentence level):
49.3%: Towards Dynamic Randomized Algorithms in Computational Geometry - Teillaud (1992) (Correct)
48.4%: Applications of Random Sampling to On-line.. - Boissonnat.. (1992) (Correct)
Active bibliography (related documents): More All
0.6: On The Randomized Construction Of The Delaunay Tree - Boissonnat, Teillaud (1991) (Correct)
0.2: A Semi-Dynamic Construction of Higher Order Voronoi.. - Boissonnat.. (1993) (Correct)
0.2: A Semi-Dynamic Construction of Higher Order.. - Boissonnat.. (1993) (Correct)
Similar documents based on text: More All
0.5: Fully Dynamic Delaunay Triangulation in Logarithmic.. - Devillers, Meiser.. (1992) (Correct)
0.5: Voronoi Diagrams in Higher Dimensions under.. - Boissonnat.. (1998) (Correct)
0.4: Randomization Yields Simple O(n log* n) Algorithms for Difficult .. - Devillers (1992) (Correct)
Related documents from co-citation: More All
39: Applications of random sampling in computational geometry - Clarkson, Shor - 1989
26: Randomized incremental construction of Delaunay and Voronoi diagrams (context) - Guibas, Knuth et al. - 1992
16: the randomized construction of the Delaunay tree - Boissonnat, Teillaud - 1993
BibTeX entry: (Update)
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. http://citeseer.ist.psu.edu/boissonnat92applications.html More
@article{ boissonnat92applications,
author = "Jean-Daniel Boissonnat and Olivier Devillers and Ren{\'e} Schott and Monique Teillaud and Mariette Yvinec",
title = "Applications of Random Sampling to On-Line Algorithms in Computational Geometry",
journal = "Discrete and Computational Geometry",
volume = "8",
pages = "51--71",
year = "1992",
url = "citeseer.ist.psu.edu/boissonnat92applications.html" }
Citations (may not include all citations):481 Algorithms on Combinatorial Geometry (context) - Edelsbrunner - 1987
335 Applications of random sampling in computational geometry - Clarkson, Shor - 1989
114 An optimal algorithm for intersecting line segments in the p.. (context) - Chazelle, Edelsbrunner - 1988
108 Combinatorial complexity bounds for arrangements of curves a.. (context) - Clarkson, Edelsbrunner et al. - 1990
101 Randomized incremental construction of Delaunay and Voronoi .. (context) - Guibas, Knuth et al. - 1992
56 Constructing higher-dimensional convex hulls at logarithmic .. (context) - Seidel - 1986
41 the randomized construction of the Delaunay tree - Boissonnat, Teillaud
39 the construction of abstract Voronoi diagrams (context) - Mehlhorn, Meiser et al. - 1991
38 Higher-dimensional Voronoi diagrams in linear expected time (context) - Dwyer - 1991
34 Constructing the visibility graph for n line segments in O (context) - Welzl - 1985
24 A hierarchical representation of objects: The Delaunay Tree (context) - Boissonnat, Teillaud - 1986
11 A semi-dynamic construction of higher order Voronoi diagrams.. - Boissonnat, Devillers et al. - 1990
6 On obstruction in relation to a fixed viewpoint (context) - Mulmuley - 1989
5 Simple on-line algorithms for convex polygons (context) - Avis, ElGindy et al. - 1985
4 A convex hull algorithm optimal for point sites in even dime.. (context) - Seidel - 1981
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sop.inria.fr/prisme/biblio/Author/DEVILLERS-O.html): More
Computing a Single Cell in the Overlay of two Simple.. - de Berg, Devillers.. (1997) (Correct)
Scalable Algorithms For Bichromatic Line Segment.. - Fabri, Devillers (1993) (Correct)
Computing Largest Circles Separating Two Sets of Segments - Boissonnat, Czyzowicz (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC