Multiresolution analysis of arbitrary meshes
SIGGRAPH '95 Proceedings of the 22nd annual conference on Computer graphics and interactive techniques
Reconstruction and representation of 3D objects with radial basis functions
Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Surface reconstruction using umbrella filters
Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
A greedy Delaunay-based surface reconstruction algorithm
The Visual Computer: International Journal of Computer Graphics
Surface reconstruction from scan paths
Future Generation Computer Systems
Regular and non-regular point sets: Properties and reconstruction
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
A heuristic algorithm was presented to reconstruct triangle mesh from unorganized point cloud, and a new error evaluation rule was presented to measure the reconstruction errors. The triangle meshes were reconstructed through two phases of mesh growing based on different strategies, where regions with high point density usually grow at the first phase and the remaining regions grow later. In each phase of mesh growing, the smoothest regions always grow firstly and then largely avoid errors emerging in sharp regions. The reformative best point selection method can improve the topology and geometry quality of the reconstructed meshes. The presented error estimation was inspired by the level of detail model and was also can be used in other region grow reconstruction approaches. Experiments show that the algorithm is efficient and effective.