首页> 外文期刊>Computers and Artificial Intelligence >SEQUENTIAL AND PARALLEL APPROXIMATE CONVEX HULL ALGORITHMS
【24h】

SEQUENTIAL AND PARALLEL APPROXIMATE CONVEX HULL ALGORITHMS

机译:顺序和并行近似凸包算法

获取原文
获取原文并翻译 | 示例
       

摘要

This paper defines the area measure of the quality of approximate convex hulls and proposes two new approximate convex hull algorithms. The first one is superior to known techniques under the area measure and comparable under the distance measure and time complexity. The second algorithm is superior to all known algorithms in both area and distance measures (including the first algorithm) while having slightly higher time complexity. Corresponding parallel algorithms for finding approximate convex hull are also described.
机译:本文定义了近似凸包质量的面积度量,并提出了两种新的近似凸包算法。第一个在面积度量下优于已知技术,在距离度量和时间复杂度下可比。第二种算法在面积和距离度量方面均优于所有已知算法(包括第一种算法),但时间复杂度稍高。还介绍了用于寻找近似凸包的相应并行算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号