Applications of Random Sampling in Computational Geometry, II (1995)

Cached

Download Links

by Kenneth L. Clarkson , Peter W. Shor
Venue:Discrete Comput. Geom
Citations:394 - 12 self

Documents Related by Co-Citation

694 Algorithms in Combinatorial Geometry – H Edelsbrunner - 1987
1770 Computational Geometry: An Introduction – Franco P Preparata, Michael Ian Shamos - 1985
266 Epsilon-Nets and Simplex Range Queries – David Haussler, Emo Welzl - 1986
115 A randomized algorithm for closest-point queries – K L Clarkson - 1988
156 Randomized incremental construction of delaunay and voronoi diagrams – Leonidas J Guibas, Donald E Knuth, Micha Sharir - 1992
272 Algorithms for reporting and counting geometric intersections – J Bentley, T Ottmann - 1979
110 A deterministic view of random sampling and its use in geometry – Bernard Chazelle, Joel Friedman - 1990
560 Voronoi diagrams -- a survey of a fundamental geometric data structure – Franz Aurenhammer - 1991
127 RAY SHOOTING AND PARAMETRIC SEARCH – Pankaj K. Agarwal, et al. - 1993
335 A sweepline algorithm for voronoi diagrams. Algorithmica – S Fortune - 1987
41 Partition trees for triangle counting and other range searching problems – E Welzl - 1988
45 Applications of Random Sampling to On-line Algorithms in Computational Geometry – Jean-daniel Boissonnat, Olivier Devillerst, RenĂ© Schott, Monique Teillaud, Mariette Yvinec - 1992
186 Small-dimensional linear programming and convex hulls made easy – R Seidel - 1991
60 E.: On a multidimensional search technique and its application to the Euclidean one-center problem – M Dyer - 1986
94 R.J.: Multidimensional searching problems – D Dobkin, Lipton - 1976
68 Voronoi diagrams from convex hulls – K Q Brown - 1979
92 Four Results on Randomized Incremental Constructions – Kenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel - 1993
79 Visibility and intersection problems in plane geometry – B Chazelle, L Guibas - 1989
194 Linear programming in linear time when the dimension is fixed – Nimrod Megiddo - 1984