Skip to search formSkip to main contentSkip to account menu

Euclidean distance

Known as: Euclidean metric, Euclidean, Euclidian distance 
In mathematics, the Euclidean distance or Euclidean metric is the "ordinary" (i.e. straight-line) distance between two points in Euclidean space… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Alignment-free sequence analysisBackpropagationChemical databaseChemical similarity

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2015
Review
2015
Euclidean Distance Matrices: Essential theory, algorithms, and applications
Euclidean distance matrices (EDMs) are matrices of the squared distances between points. The definition is deceivingly simple… 
Review
2012
Review
2012
Euclidean Distance Geometry and Applications
Euclidean distance geometry is the study of Euclidean geometry based on the concept of distance. This is useful in several… 
Highly Cited
2009
Highly Cited
2009
Beyond the Euclidean distance: Creating effective visual codebooks using the Histogram Intersection Kernel
Common visual codebook generation methods used in a Bag of Visual words model, e.g. k-means or Gaussian Mixture Model, use the… 
Highly Cited
2004
Highly Cited
2004
Convex Optimization & Euclidean Distance Geometry
Optimization is the science of making a best choice in the face of conflicting requirements. Any convex optimization problem has… 
Highly Cited
2004
Highly Cited
2004
Similarity between Euclidean and cosine angle distance for nearest neighbor queries
Understanding the relationship among different distance measures is helpful in choosing a proper one for a particular application… 
Highly Cited
2003
Highly Cited
2003
A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions
A sequential algorithm is presented for computing the exact Euclidean distance transform (DT) of a k-dimensional binary image in… 
Highly Cited
1999
Highly Cited
1999
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP… 
Highly Cited
1995
Highly Cited
1995
Linear Time Euclidean Distance Algorithms
Two linear time (and hence asymptotically optimal) algorithms for computing the Euclidean distance transform of a two-dimensional… 
Highly Cited
1987
Highly Cited
1987
Compositional dissimilarity as a robust measure of ecological distance
The robustness of quantitative measures of compositional dissimilarity between sites was evaluated using extensive computer… 
Highly Cited
1980
Highly Cited
1980
Euclidean distance mapping
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)