DocumentCode
2168491
Title
A fast distance approximation algorithm for encoded quadtree locations
Author
Schrack, Günther ; Wu, Wendy ; Liu, Xian
Author_Institution
Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada
fYear
1993
fDate
14-17 Sep 1993
Firstpage
1135
Abstract
Several distance approximation functions to the Euclidean distance of two points in the two-dimensional Euclidean plane are reviewed. An improved distance function is proposed and compared with previous ones as to their maximum relative errors and their execution times. The improved distance function is then applied for distance calculations in the domain of linear quadtrees using dilated integer arithmetic. The maximum relative error is discussed and execution times are reported
Keywords
approximation theory; computational geometry; digital arithmetic; encoding; spatial data structures; tree data structures; trees (mathematics); 2D Euclidean plane; Euclidean distance; dilated integer arithmetic; encoded quadtree locations; execution times; fast distance approximation algorithm; linear quadtrees; maximum relative errors; Approximation algorithms; Euclidean distance; Temperature;
fLanguage
English
Publisher
ieee
Conference_Titel
Electrical and Computer Engineering, 1993. Canadian Conference on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-2416-1
Type
conf
DOI
10.1109/CCECE.1993.332256
Filename
332256
Link To Document