The computational complexity of distance functions of two-dimensional domains.
Arthur W. ChouKer-I KoPublished in: Theor. Comput. Sci. (2005)
Keyphrases
- distance function
- computational complexity
- similarity search
- nearest neighbor
- knn
- complex objects
- metric space
- distance measure
- euclidean distance
- three dimensional
- distance metric
- similarity function
- np hard
- multi dimensional
- quadratic form
- distance computation
- np complete
- data points
- special case
- triangle inequality
- index structure
- bit rate
- optimal solution
- computer vision