Applications of Random Sampling to On-line Algorithms in Computational Geometry.
Jean-Daniel BoissonnatOlivier DevillersRené SchottMonique TeillaudMariette YvinecPublished in: Discret. Comput. Geom. (1992)
Keyphrases
- computational geometry
- random sampling
- sampling algorithm
- worst case
- learning algorithm
- sample size
- active learning
- lower bound
- convex hull
- computational complexity
- sampling methods
- complexity theory
- nearest neighbor searching
- multi dimensional
- computationally efficient
- computer vision
- voronoi diagram
- machine learning
- digital geometry