2009 · 25 citations · 47 references
ComputingComputational Engineering3D ModelingComputational GeometryGeometric Modeling3D ReconstructionGeometry ProcessingMesh GenerationPoint Cloud ProcessingSurface ModelingSurface ReconstructionMesh ReconstructionNormal VectorsParallelizationPoint Cloud Normal EstimationPoint Cloud ReconstructionRobust Mesh GenerationRobust Surface ReconstructionSurface Fitting
We present a robust method to generate mesh surfaces from unoriented noisy points in this paper. The whole procedure consists of three steps. Firstly, the normal vectors at points are evaluated by a highly robust estimator which can fit surface corresponding to less than half of the data points and fit data with multi-structures. This benefits us with the ability to well reconstruct the normal vectors around sharp edges and corners. Meanwhile, clean point cloud equipped with piecewise normal is obtained by projecting points according to the robust fitting. Secondly, an error-minimized subsampling is applied to generate a well-sampled point cloud. Thirdly, a combinatorial approach is employed to reconstruct a triangular mesh connecting the down-sampled points, and a polygonal mesh which preserves sharp features is constructed by the dual-graph of triangular mesh. Parallelization method of the algorithm on a consumer PC using the architecture of GPU is also given.
47
Least squares quantization in PCM
Sheelagh Lloyd · IEEE Transactions on Information Theory · 1982 · 15.6K citations · Full text
Marching cubes: A high resolution 3D surface construction algorithm
William E. Lorensen, H. E. Cline · 1987 · 10.2K citations · Full text
Computing, Radiology, Visualization +17
Surface reconstruction from unorganized points
Hugues Hoppe, Tony DeRose, Tom Duchamp et al. · 1992 · 2.7K citations · Full text