Estimation of errors between Euclidean and m-neighbor distance (Q1262140)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Estimation of errors between Euclidean and m-neighbor distance |
scientific article; zbMATH DE number 4123317
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimation of errors between Euclidean and m-neighbor distance |
scientific article; zbMATH DE number 4123317 |
Statements
Estimation of errors between Euclidean and m-neighbor distance (English)
0 references
1989
0 references
In n-dimensional grid point space, distance functions \(d_{n,m}\) are defined (called the m-neighbor distance) which may be used to approximate the Euclidean distance E. The definition of the m-neighbor distance \(d_{n,m}\) is based on a special neighborhood of grid points in n- dimensional grid point space, and n different neighborhoods are considered. The properties of approximation errors between \(d_{n,m}\) and E are dealt with. It is proved, that the proportional error (the ratio between \(d_{n,m}\) and E) is bounded. Using error measures based on this proportional error a method is proposed for selecting that m which gives ``the least error to approximate \(E''\).
0 references
digital geometry
0 references
geometric algorithms
0 references
Euclidean distance
0 references
m-neighbor distance
0 references
0.8625482
0 references
0.8608752
0 references
0.8560871
0 references
0 references