×
Home Discussions Write at Opengenus IQ
×
  • Track your progress
  • RANDOM
  • Join our Internship šŸŽ“
  • 100+ Graph Algorithms
  • 100+ DP Problems
  • 50+ Linked List Problems
  • 50+ Array Problems
  • One Liner
  • 50+ Binary Tree problems
  • #7daysOfCode
  • Linux šŸ’½
  • šŸ”Š Data Structures
  • Graph Algorithms
  • Dynamic Programming šŸ’‘
  • Home

chebyshev distance

A collection of 2 posts

similarity measurement

Euclidean vs Manhattan vs Chebyshev Distance

Euclidean distance, Manhattan distance and Chebyshev distance are all distance metrics which compute a number based on two data points. All the three metrics are useful in various use cases and differ in some important aspects such as computation and real life usage.

OpenGenus Foundation OpenGenus Foundation
similarity measurement

Chebyshev distance

Chebyshev distance is a distance metric which is the maximum absolute distance in one dimension of two N dimensional points. It has real world applications in Chess, Warehouse logistics and many other fields. It is known as Tchebychev distance, maximum metric, chessboard distance and Lāˆž metric.

OpenGenus Foundation OpenGenus Foundation
OpenGenus IQ © 2022 All rights reserved ā„¢ [email: team@opengenus.org]
Top Posts LinkedIn Twitter