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

Active Bibliography

78 Arrangements and Their Applications – Pankaj K. Agarwal, Micha Sharir - 1998
3 Output-Sensitive Construction Of Convex Hulls – Timothy Moon-yew Chan - 1995
8 Lower Bounds for Fundamental Geometric Problems – Jeffrey Gordon Erickson - 1996
46 Geometric Range Searching – Jiri Matousek - 1994
10 Computational Geometry – Steven Fortune - 1994
33 Random Sampling, Halfspace Range Reporting, and Construction of (≤k)-Levels in Three Dimensions – Timothy M. Chan - 1999
65 Output-Sensitive Results on Convex Hulls, Extreme Points, and Related Problems – T. M. Chan - 1996
60 Backwards Analysis of Randomized Geometric Algorithms – Raimund Seidel - 1992
37 Shapes And Implementations In Three-Dimensional Geometry – Ernst Peter Mücke - 1993
9 Computational Geometry – D. T. Lee - 1996
277 Simulation of Simplicity: A Technique to Cope with Degenerate Cases in Geometric Algorithms – Herbert Edelsbrunner, Ernst Peter Mücke - 1990
19 Computational geometry -- a survey – D. T. Lee, Franco P. Preparata - 1984
17 Derandomization in Computational Geometry – Jirí Matousek - 1996
110 A deterministic view of random sampling and its use in geometry – Bernard Chazelle, Joel Friedman - 1990
31 Primal Dividing and Dual Pruning: Output-Sensitive Construction of 4-d Polytopes and 3-d Voronoi Diagrams – Timothy Chan, Jack Snoeyink, Chee-keng Yap - 1997
198 Voronoi Diagrams and Delaunay Triangulations – Steven Fortune - 1992
36 Hierarchical Geometric Approximations – Amitabh Varshney - 1994
4 Erased Arrangements of Lines and Convex Decompositions of Polyhedra – J. E. Hershberger, J. S. Snoeyink - 1997
2 Trends and Developments in Computational Geometry – M. de Berg, M. De Berg, Mark De Berg - 1995