File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

A new region growing algorithm for triangular mesh recovery from scattered 3d points

Author(s)
Long ChengjiangZhao JianhuiGoonetilleke Ravindra S.Xiong, ShupingDing YihuaYuan ZhiyongZhang Yuanyuan
Issued Date
2011
DOI
10.1007/978-3-642-22639-7_23
URI
https://scholarworks.unist.ac.kr/handle/201301/37421
Citation
Lecture Notes in Computer Science, v.6758, pp.237 - 246
Abstract
A novel region growing algorithm is proposed for triangular mesh recovery from scattered 3D points. In our method, the new principle is used to determine the seed triangle considering both maximum angle and minimum length; the open influence region is defined for the active edge under processing; positional element is added into the criterion to choose the most suitable active point; geometric integrity is maintained by analyzing different situations of the selected active point and their corresponding treatments. Our approach has been tested with various unorganized point clouds, and the experimental results proved its efficiency in both accuracy and speed. Compared with the existing similar techniques, our algorithm has the ability to recover triangular meshes while preserving better topological coherence with the original 3D points.
Publisher
Lecture Notes in Computer Science
ISBN
978-364222638-0
ISSN
0302-9743

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.