Applications of random sampling in computational geometry, II
Open Access
- 1 October 1989
- journal article
- research article
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 4 (5) , 387-421
- https://doi.org/10.1007/bf02187740
Abstract
No abstract availableKeywords
This publication has 36 references indexed in Scilit:
- The number of small semispaces of a finite set of points in the planeJournal of Combinatorial Theory, Series A, 1986
- Primitives for the manipulation of general subdivisions and the computation of VoronoiACM Transactions on Graphics, 1985
- The power of geometric dualityBIT Numerical Mathematics, 1985
- On the number of k-subsets of a set of n points in the planeJournal of Combinatorial Theory, Series A, 1984
- Linear Programming in Linear Time When the Dimension Is FixedJournal of the ACM, 1984
- On the shape of a set of points in the planeIEEE Transactions on Information Theory, 1983
- Finding the intersection of two convex polyhedraTheoretical Computer Science, 1978
- Convex hulls of finite sets of points in two and three dimensionsCommunications of the ACM, 1977
- QuicksortThe Computer Journal, 1962
- Beweis einer Vermutung von A. VázsonyiActa Mathematica Hungarica, 1956