By Topic

A fast distance approximation algorithm for encoded quadtree locations

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
G. Schrack ; Dept. of Electr. Eng., British Columbia Univ., Vancouver, BC, Canada ; W. Wu ; Xian Liu

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

Published in:

Electrical and Computer Engineering, 1993. Canadian Conference on

Date of Conference:

14-17 Sep 1993