Some New Effectivity Bounds in Computational Geometry.
Leandro CanigliaAndré GalligoJoos HeintzPublished in: AAECC (1988)
Keyphrases
- computational geometry
- computer graphics
- complexity theory
- digital image analysis
- convex hull
- upper bound
- art gallery
- voronoi diagram
- computer vision
- digital geometry
- nearest neighbor searching
- point sets
- discrete geometry
- uniform sampling
- persistent homology
- parametric curves
- feature selection
- computationally efficient
- multiresolution
- feature space
- feature extraction
- image processing