请输入您要查询的百科知识:

 

词条 Chebyshev distance
释义

  1. Definition

  2. Properties

  3. See also

  4. References

  5. External links

{{About|the finite-dimensional vector space distance|the function space norm|uniform norm}}{{Chess diagram small
| tright
|
|x5|x4|x3|x2|x2|x2|x2|x2
|x5|x4|x3|x2|x1|x1|x1|x2
|x5|x4|x3|x2|x1|kl|x1|x2
|x5|x4|x3|x2|x1|x1|x1|x2
|x5|x4|x3|x2|x2|x2|x2|x2
|x5|x4|x3|x3|x3|x3|x3|x3
|x5|x4|x4|x4|x4|x4|x4|x4
|x5|x5|x5|x5|x5|x5|x5|x5
| The Chebyshev distance between two spaces on a chess board gives the minimum number of moves a king requires to move between them. This is because a king can move diagonally, so that the jumps to cover the smaller distance parallel to a rank or column is effectively absorbed into the jumps covering the larger. Above are the Chebyshev distances of each square from the square f6.
}}

In mathematics, Chebyshev distance (or Tchebychev distance), maximum metric, or L metric[1] is a metric defined on a vector space where the distance between two vectors is the greatest of their differences along any coordinate dimension.[2] It is named after Pafnuty Chebyshev.

It is also known as chessboard distance, since in the game of chess the minimum number of moves needed by a king to go from one square on a chessboard to another equals the Chebyshev distance between the centers of the squares, if the squares have side length one, as represented in 2-D spatial coordinates with axes aligned to the edges of the board.[3] For example, the Chebyshev distance between f6 and e2 equals 4.

Definition

The Chebyshev distance between two vectors or points p and q, with standard coordinates and , respectively, is

This equals the limit of the Lp metrics:

hence it is also known as the L metric.

Mathematically, the Chebyshev distance is a metric induced by the supremum norm or uniform norm. It is an example of an injective metric.

In two dimensions, i.e. plane geometry, if the points p and q have Cartesian coordinates

and , their Chebyshev distance is

Under this metric, a circle of radius r, which is the set of points with Chebyshev distance r from a center point, is a square whose sides have the length 2r and are parallel to the coordinate axes.

On a chess board, where one is using a discrete Chebyshev distance, rather than a continuous one, the circle of radius r is a square of side lengths 2r, measuring from the centers of squares, and thus each side contains 2r+1 squares; for example, the circle of radius 1 on a chess board is a 3×3 square.

Properties

In one dimension, all Lp metrics are equal – they are just the absolute value of the difference.

The two dimensional Manhattan distance also has circles in the form of squares, with sides of length {{sqrt|2}}r, oriented at an angle of π/4 (45°) to the coordinate axes, so the planar Chebyshev distance can be viewed as equivalent by rotation and scaling to the planar Manhattan distance.

However, this equivalence between L1 and L metrics does not generalize to higher dimensions. A sphere formed using the Chebyshev distance as a metric is a cube with each face perpendicular to one of the coordinate axes, but a sphere formed using Manhattan distance is an octahedron: these are dual polyhedra, but among cubes, only the square (and 1-dimensional line segment) are self-dual polytopes.

The Chebyshev distance is sometimes used in warehouse logistics,[4] as it effectively measures the time an overhead crane takes to move an object (as the crane can move on the x and y axes at the same time but at the same speed along each axis).

On a grid (such as a chessboard), the points at a Chebyshev distance of 1 of a point are the Moore neighborhood of that point.

See also

  • King's graph
  • Uniform norm

References

1. ^{{cite book | title = Modern Mathematical Methods for Physicists and Engineers | author = Cyrus. D. Cantrell | isbn = 0-521-59827-3 | publisher = Cambridge University Press | year = 2000 }}
2. ^{{cite book | title = Handbook of Massive Data Sets | author = James M. Abello, Panos M. Pardalos, and Mauricio G. C. Resende (editors) | isbn = 1-4020-0489-3 | publisher = Springer | year = 2002}}
3. ^{{cite book | title = Classification, Parameter Estimation and State Estimation: An Engineering Approach Using MATLAB |author1=David M. J. Tax |author2=Robert Duin |author3=Dick De Ridder | isbn = 0-470-09013-8 | publisher = John Wiley and Sons | year = 2004}}
4. ^{{cite book | title = Logistics Systems |author1=André Langevin |author2=Diane Riopel | publisher = Springer | year = 2005 | isbn = 0-387-24971-0 | url = https://books.google.com/books?id=9I8HvNfSsk4C&pg=PA96&dq=Chebyshev+distance++warehouse+logistics&ei=LJXFSLn7FIi8tAOB_8jXDA&sig=ACfU3U27UgodD209FOO7fzTysZFyPJxejw }}

External links

{{DEFAULTSORT:Chebyshev Distance}}

3 : Metric geometry|Mathematical chess problems|Distance

随便看

 

开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。

 

Copyright © 2023 OENC.NET All Rights Reserved
京ICP备2021023879号 更新时间:2024/11/17 9:00:49