Complexity of the delaunay triangulation of points on surfaces the smooth case

SCG '03 Pub Date : 2003-06-08 DOI:10.1145/777792.777823
D. Attali, J. Boissonnat, A. Lieutier
{"title":"Complexity of the delaunay triangulation of points on surfaces the smooth case","authors":"D. Attali, J. Boissonnat, A. Lieutier","doi":"10.1145/777792.777823","DOIUrl":null,"url":null,"abstract":"It is well known that the complexity of the Delaunay triangulation of N points in R 3, i.e. the number of its faces, can be O (N2). The case of points distributed on a surface is of great practical importance in reverse engineering since most surface reconstruction algorithms first construct the Delaunay triangulation of a set of points measured on a surface.In this paper, we bound the complexity of the Delaunay triangulation of points distributed on generic smooth surfaces of R 3. Under a mild uniform sampling condition, we show that the complexity of the 3D Delaunay triangulation of the points is O(N log N).","PeriodicalId":324763,"journal":{"name":"SCG '03","volume":"54 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"124","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SCG '03","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/777792.777823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 124

Abstract

It is well known that the complexity of the Delaunay triangulation of N points in R 3, i.e. the number of its faces, can be O (N2). The case of points distributed on a surface is of great practical importance in reverse engineering since most surface reconstruction algorithms first construct the Delaunay triangulation of a set of points measured on a surface.In this paper, we bound the complexity of the Delaunay triangulation of points distributed on generic smooth surfaces of R 3. Under a mild uniform sampling condition, we show that the complexity of the 3D Delaunay triangulation of the points is O(N log N).
光滑曲面上点的delaunay三角剖分的复杂性
众所周知,r3中N个点的Delaunay三角剖分的复杂度,即它的面数,可以是O (N2)。点分布在曲面上的情况在逆向工程中具有重要的实际意义,因为大多数曲面重构算法首先构造在曲面上测量的一组点的Delaunay三角剖分。本文给出了分布在广义光滑曲面上的点的Delaunay三角剖分的复杂度。在温和均匀采样条件下,我们证明了点的三维Delaunay三角剖分的复杂度为O(N log N)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书