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 dimension, Voronoi diagrams of line segments in the plane, arrangements of curves in the plane, and others.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
D. Avis, H. ElGindy, and R. Seidel, Simple on-line algorithms for convex polygons,Computational Geometry (G. T. Toussaint, ed.), North-Holland, Amsterdam, 1985, pp. 23–42.
J.-D. Boissonnat, O. Devillers, and M. Teillaud, A semi-dynamic construction of higher-order Voronoi diagrams and its randomized analysis,Algorithmica (to appear). Full paper available as Technical Report INRIA 1207. Abstract published inSecond Canadian Conference on Computational Geometry, Ottawa 1990.
J.-D. Boissonnat and M. Teillaud, A hierarchical representation of objects: the Delaunay tree,Second ACM Symposium on Computational Geometry, Yorktown Heights, June 1986.
J.-D. Boissonnat and M. Teillaud, On the randomized construction of the Delaunay tree,Theoretical Computer Science (to appear). Full paper available as Technical Report INRIA 1140.
B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane,IEEE Symposium on Foundations of Computer Science, 1988, pp. 590–600.
K. L. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir, and E. Welzl, Combinatorial complexity bounds for arrangements of curves and surfaces,Discrete and Computational Geometry,5 (1990), 99–160.
K. L. Clarkson and P. W. Shor, Applications of random sampling in computational geometry, II,Discrete and Computational Geometry,4 (5) (1989).
R. A. Dwyer, Higher-dimensional Voronoi diagrams in linear expected time,5th ACM Symposium on Computational Geometry, Saarbrücken, June 1989.
H. Edelsbrunner,Algorithms on Combinatorial Geometry, Springer-Verlag, New York, 1987.
L. J. Guibas, D. E. Knuth, and M. Sharir, Randomized incremental construction of Delaunay and Voronoi diagrams,ICALP 90, Springer-Verlag, New York, 1990, pp. 414–431.
K. Mehlhorn, S. Meiser, and C. O'Dúnlaing, On the construction of abstract Voronoi diagrams,STACS 90 (C. Choffrut and T. Lengauer, eds.), Springer-Verlag, New York, 1990, pp. 227–239.
K. Mulmuley, On obstruction in relation to a fixed viewpoint,IEEE Symposium on Foundations of Computer Science, 1989, pp. 592–597.
R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face,ACM Symposium on Theory of Computing, 1986, pp. 404–413.
R. Seidel, A Convex Hull Algorithm Optimal for Point Sites in Even Dimensions, Technical Report 14, Department of Computer Science, University British Columbia, Vancouver, BC, 1981.
E. Welzl, Constructing the visibility graph forn line segments ino(n 2) time,Information Processing Letters,20 (1985), 167–171.
Author information
Authors and Affiliations
Additional information
This work has been supported in part by the ESPRIT Basic Research Action Nr. 3075 (ALCOM).
Rights and permissions
About this article
Cite this article
Boissonnat, JD., Devillers, O., Schott, R. et al. Applications of random sampling to on-line algorithms in computational geometry. Discrete Comput Geom 8, 51–71 (1992). https://doi.org/10.1007/BF02293035
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02293035