Point sampled surface reconstruction based on local geometry

Authors:
Lanfang Miao;Qunsheng Peng
Affiliations:
Department of Computer Science, Zhejiang Normal University, Jinhua, China and State Key Lab. of CAD&CG, Zhejiang Univerisity, Hangzhou, China;State Key Lab. of CAD&CG, Zhejiang Univerisity, Hangzhou, China
Venue:
Edutainment'07 Proceedings of the 2nd international conference on Technologies for e-learning and digital entertainment
Year:
2007

Citing 11
Cited 0

Volumetric shape description of range data using “Blobby Model”

Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Surface reconstruction from unorganized points

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A volumetric method for building complex models from range images

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A Generalization of Algebraic Surface Drawing

ACM Transactions on Graphics (TOG)
Reconstruction and representation of 3D objects with radial basis functions

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
Modelling with implicit surfaces that interpolate

ACM Transactions on Graphics (TOG)
Point set surfaces

Proceedings of the conference on Visualization '01
Efficient simplification of point-sampled surfaces

Proceedings of the conference on Visualization '02
A Multi-scale Approach to 3D Scattered Data Interpolation with Compactly Supported Basis Functions

SMI '03 Proceedings of the Shape Modeling International 2003
Multi-level partition of unity implicits

ACM SIGGRAPH 2003 Papers
Interpolating Implicit Surfaces from Scattered Surface Data Using Compactly Supported Radial Basis Functions

SMI '01 Proceedings of the International Conference on Shape Modeling & Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we presented a point sampled surface reconstruction method based on local geometry. First, an adaptive Binary Space Partition (aBSP) tree was built based on the local shape complexity which was judged by three factors: local main curvature, the normal cone and the number of points. Different local complexities produce different aBSP-trees. Then, each leaf node in the aBSP-tree was approximated by a weighted quadric function and the center points set of aBSP tree's leaf nodes could be treated as one approximation to the original point set at a given complexity of the local shape. Finally, a ray tracer based on point was used to render these aBSP-trees, which avoids triangulating of implicit surfaces before they are rendered. The experimental results show that the method can reconstruct sharp features very conveniently and effectively.