A tight bound for the complexity of voroni diagrams under polyhedral convex distance functions in 3D.
Christian IckingLihong MaPublished in: STOC (2001)
Keyphrases
- distance function
- worst case
- upper bound
- lower bound
- knn
- convex hull
- similarity search
- nearest neighbor
- complex objects
- distance metric
- convex sets
- similarity function
- euclidean distance
- data points
- distance measure
- edit distance
- k nearest neighbor
- quadratic form
- computational complexity
- neural network
- convex optimization
- metric space
- space complexity
- image data
- generalization error bounds