会议专题

A Surface Approximation Algorithm for Complex Shapes

In the paper, we propose one surface approximation algorithm which could handle the geometrical and topological errors contained by the complex shapes. The algorithm firstly builds one initial coarse envelop based on the voxel hulls of the input shape, then one iterative approximation is processed by two alternative steps: matching the envelop to the input shape by using the Laplacian deformation, and the Laplacian fairing. The experiments demonstrate that our algorithm could efficiently build one surface that approximates the input shape, which could be in by arbitrary representations, such as meshes, polygon soups, and point sets.

Shuai Lin Gang Dang Zhi-Quan Cheng Hong-Hua Li Kai Xu Shi-Yao Jin

PDL Laboratory, National University of Defense Technology, Changsha, P.R. China, 410073

国际会议

2010 International Conference on Audio,Language and Image Processing(2010年音频、语言与图像处理国际会议 ICALIP 2010)

上海

英文

1252-1256

2010-11-23(万方平台首次上网日期,不代表论文的发表时间)