.png){kind=icon}
返回
Optimistic parallel Delaunay triangulation
.png){kind=icon}
PRE
AI
DOI：10.1007/s00371-002-0173-z.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The paper describes a new parallel algorithm of Delaunay triangulation based on randomized incremental insertion. The algorithm is practical, simple and can be modified also for constrained triangulation or tetrahedralization. It was developed for architectures with a lower degree of parallelism, such as several-processor workstations, and tested on up to 8 processors.
Keyword:
computer graphics
computational geometry
Delaunay triangulation
parallelization
incremental insertion
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
