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

Authors:
Chengjiang Long;Jianhui Zhao;Ravindra S. Goonetilleke;Shuping Xiong;Yihua Ding;Zhiyong Yuan;Yuanyuan Zhang
Affiliations:
Computer School, Wuhan University, Wuhan, Hubei, PR China;Computer School, Wuhan University, Wuhan, Hubei, PR China;Dept. Industrial Engineering and Logistics Management, Hong Kong University of Science and Technology (HKUST), Hong Kong;School of Design and Human Engineering, Ulsan National Institute of Science and Technology, Ulsan, Republic of Korea;Computer School, Wuhan University, Wuhan, Hubei, PR China;Computer School, Wuhan University, Wuhan, Hubei, PR China;Computer School, Wuhan University, Wuhan, Hubei, PR China
Venue:
Transactions on edutainment VI
Year:
2011

Citing 9
Cited 1

Surface reconstruction from unorganized points

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Smooth surface reconstruction via natural neighbour interpolation of distance functions

Proceedings of the sixteenth annual symposium on Computational geometry
Reconstruction and representation of 3D objects with radial basis functions

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The Ball-Pivoting Algorithm for Surface Reconstruction

IEEE Transactions on Visualization and Computer Graphics
High-Quality Extraction of Isosurfaces from Regular and Irregular Grids

IEEE Transactions on Visualization and Computer Graphics
A fast all nearest neighbor algorithm for applications involving large point-clouds

Computers and Graphics
Reconstructing domain boundaries within a given set of points, using Delaunay triangulation

Computers & Geosciences
A Heuristic Approach to Reconstruct Triangle Mesh from Unorganized Point Cloud

FSKD '09 Proceedings of the 2009 Sixth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 05
Regular and non-regular point sets: Properties and reconstruction

Computational Geometry: Theory and Applications

Tree branching reconstruction from unilateral point clouds

Transactions on Edutainment VIII

Quantified Score

Hi-index	0.00

Visualization

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.