New applications of random sampling in computational geometry
- 1 June 1987
- journal article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 2 (2) , 195-222
- https://doi.org/10.1007/bf02187879
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Constructing Arrangements of Lines and Hyperplanes with ApplicationsSIAM Journal on Computing, 1986
- A linear algorithm for determining the separation of convex polyhedraJournal of Algorithms, 1985
- How to search in historyInformation and Control, 1985
- On the number of line separations of a finite set in the planeJournal of Combinatorial Theory, Series A, 1985
- Geometric retrieval problemsInformation and Control, 1984
- Polygon RetrievalSIAM Journal on Computing, 1982
- Voronoi diagrams from convex hullsInformation Processing Letters, 1979
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- On the Uniform Convergence of Relative Frequencies of Events to Their ProbabilitiesTheory of Probability and Its Applications, 1971
- The maximum numbers of faces of a convex polytopeMathematika, 1970