Misplaced Pages

In metric geometry, the Karlsruhe metric is a measure of distance that assumes travel is only possible along rays through the origin and circular arcs centered at the origin. The name alludes to the layout of the city of Karlsruhe, which has radial streets and circular avenues around a central point. This metric is also called Moscow metric.

In this metric, there are two types of shortest paths. One possibility, when the two points are on nearby rays, combines a circular arc through the nearer to the origin of the two points and a segment of a ray through the farther of the two points. Alternatively, for points on rays that are nearly opposite, it is shorter to follow one ray all the way to the origin and then follow the other ray back out. Therefore, the Karlsruhe distance between two points ${\displaystyle d_{k}(p_{1},p_{2})}$ is the minimum of the two lengths that would be obtained for these two types of path. That is, it equals $${\displaystyle d_{k}(p_{1},p_{2})={\begin{cases}\min(r_{1},r_{2})\cdot \delta (p_{1},p_{2})+|r_{1}-r_{2}|,&{\text{if }}0\leq \delta (p_{1},p_{2})\leq 2\\r_{1}+r_{2},&{\text{otherwise}}\end{cases}}}$$ where ${\displaystyle (r_{i},\varphi _{i})}$ are the polar coordinates of ${\displaystyle p_{i}}$ and ${\displaystyle \delta (p_{1},p_{2})=\min(|\varphi _{1}-\varphi _{2}|,2\pi -|\varphi _{1}-\varphi _{2}|)}$ is the angular distance between the two points.

See also

• Manhattan distance
• Hamming distance

Notes

1. Karlsruhe-Metric Voronoi Diagram
2. Klein, Rolf (1988). "Abstract Voronoi diagrams and their applications". Computational Geometry and its Applications. Berlin, Heidelberg: Springer. pp. 148–157. doi:10.1007/3-540-50335-8_31.

External links

• Karlsruhe-metric Voronoi diagram, by Takashi Ohyama
• Karlsruhe-Metric Voronoi Diagram, by Rashid Bin Muhammad

This metric geometry-related article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Metric spaces
• Metric geometry stubs