首页> 外文会议>Electrical and Computer Engineering, 1993. Canadian Conference on >A fast distance approximation algorithm for encoded quadtree locations
【24h】

A fast distance approximation algorithm for encoded quadtree locations

机译:编码四叉树位置的快速距离近似算法

获取原文

摘要

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.
机译:综述了二维欧几里德平面上两点的欧几里得距离的几种距离近似函数。提出了一种改进的距离函数,并将其与以前的函数进行比较,以求它们的最大相对误差和执行时间。然后,使用膨胀的整数算法将改进的距离函数应用于线性四叉树域中的距离计算。讨论了最大相对误差并报告了执行时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号