A New Region Growing Algorithm for Triangular Mesh Recovery from Scattered 3D Points

Cited 0 time in webofscience Cited 4 time in scopus
  • Hit : 237
  • Download : 0
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
Springer Berlin Heidelberg
Issue Date
2011
Language
English
Citation

Lecture Notes in Computer Science, v.6758, pp.237 - 246

ISSN
0302-9743
DOI
10.1007/978-3-642-22639-7_23
URI
http://hdl.handle.net/10203/208538
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0