• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computational Science and Its Applications(ICCSA 2006) pt.1; 20060508-11; Glasgow(GB) >Efficient Computation of Elliptic Gabriel Graph
【24h】

Efficient Computation of Elliptic Gabriel Graph

机译：椭圆加百利图的有效计算

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Searching neighboring points around a point in a point set has been important for various applications and there have been extensive studies such as the minimum spanning tree, relative neighborhood graph, Delaunay triangulation, Gabriel graph, and so on. Observing the fact that the previous approaches of neighbor search may possibly sample severely biased neighbors in a set of unevenly distributed points, an elliptic Gabriel graph has recently been proposed. By extending the influence region from a circle to an ellipse, the elliptic Gabriel graph generalizes the ordinary Gabriel graph. Hence, the skew-ness in the sampled neighbors is rather reduced. In this paper, we present a simple observation which allows to compute the correct elliptic Gabriel graph efficiently by reducing the search space.
机译：在点集中搜索点周围的相邻点对于各种应用都很重要，并且已经进行了广泛的研究，例如最小生成树，相对邻域图，Delaunay三角剖分，Gabriel图等。观察到邻居搜索的先前方法可能会在一组不均匀分布的点中对严重偏置的邻居进行采样的事实，最近已提出了椭圆形的加百利图。通过将影响范围从圆形扩展到椭圆形，椭圆形的加百利图推广了普通的加百利图。因此，采样邻居中的偏斜度大大降低了。在本文中，我们提出了一个简单的观察方法，它可以通过减少搜索空间来有效地计算正确的椭圆Gabriel图。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号