.png){kind=icon}
返回
An efficient sweep-line Delaunay triangulation algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cad.2004.10.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper introduces a new algorithm for constructing a 2D Delaunay triangulation. It is based on a sweep-line paradigm, which is combined with a local optimization criterion - a characteristic of incremental insertion algorithms. The sweep-line status is represented by a so-called advancing front, which is implemented as a hash-table. Heuristics have been introduced to prevent the construction of tiny triangles, which would probably be legalized. This algorithm has been compared with other popular Delaunay algorithms and it is the fastest algorithm among them. In addition, this algorithm does not use a lot of memory for supporting data structure, it is easy to understand and simple to implement. (c) 2004 Elsevier Ltd. All rights reserved.
Keyword:
computational geometry
Delaunay triangulation
sweep-line paradigm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
3.1
论文数:
3.2K
被引数:
6.4K
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容