image: This is a process flow of the feature sensitive re-sampling algorithm: (a) original uniform sampling of Max Planck model; (b) clusters after the naive index propagation step; (c) clusters after the optimized normalized rectification step; (d) feature sensitive sampling result of Max Planck model; (e) splat rendering result of simplified Max Planck model. view more
Credit: ©Science China Press
Feature sensitive re-sampling of point set surfaces is an important and challenging task in many computer graphics and geometric modeling applications. Professor MIAO Yongwei and his group at the College of Computer Science and Technology, Zhejiang University of Technology, set out to tackle this problem. Based on regular sampling of a Gaussian sphere and the mapping of surface normals onto the Gaussian sphere, they have presented an adaptive re-sampling framework for point set surfaces. The proposed re-sampling scheme can generate non-uniformly distributed discrete sample points for the underlying point sets in a feature sensitive manner. Their work, entitled "Feature sensitive re-sampling of point set surfaces with Gaussian spheres", has been published in SCIENCE CHINA Information Sciences, Vol. 55, 2012.
Feature sensitive re-sampling of point set surfaces is an important and challenging task in many computer graphics and geometric modeling applications. Using regular triangulation of a Gaussian sphere and distribution of the surface normals over the Gaussian sphere, a Gaussian sphere based sampling scheme can be used to simplify the underlying point set surfaces in order to develop a simplified algorithm. The authors have proposed a novel framework of re-sampling point set surfaces, which can efficiently generate feature sensitive non-uniformly distributed discrete sample points.
The proposed algorithm takes as input a set of unstructured surfels rather than a discrete point cloud. A high-level outline of the proposed feature sensitive re-sampling algorithm based on a Gaussian sphere is summarized below.
1) Neighbor selection: Adaptive neighborhoods for each sample point are determined according to the normal deviation.
2) Naive sampling: All sample points of the underlying model are clustered into regions using the proposed index propagation scheme, and then singleton points are merged into their nearest clusters;
3) Optimized sampling: The following two steps are iterated until convergence:
- cluster normalization: non-normalized clusters are split to generate normalized disk-like clusters, and
- singleton rejoining: singleton points located in the corner of Gaussian triangles are grouped with their nearest clusters.
4) Simplified surfel generation: Each cluster region is replaced by a representative surfel.
5) Splat rendering: The generated simplified models are finally rendered by elliptic splats.
The process flow of this feature sensitive re-sampling algorithm is illustrated in Figure 1.
See the article: Miao Y W, Bosch J, Pajarola R, et al. Feature sensitive re-sampling of point set surfaces with Gaussian spheres. Sci China Inf Sci, 2012, 55(9): 2075-2089. DOI: 10.1007/s11432-012-4637-0
http://info.scichina.com:8084/sciFe/EN/Y2012/V55/I9/2075
Journal
Science China Information Sciences