An efficient implementation of RBF-based progressive point-sampled geometry

Authors:
Yong-Jin Liu;Kai Tang;Joneja Ajay
Affiliations:
Tsinghua University, Beijing, P.R. China;The Hong Kong University of Science and Technology, Hong Kong;The Hong Kong University of Science and Technology, Hong Kong
Venue:
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Year:
2006

Citing 11
Cited 0

Multivariate interpolation of large sets of scattered data

ACM Transactions on Mathematical Software (TOMS)
Progressive meshes

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Computational geometry: algorithms and applications

Computational geometry: algorithms and applications
Searching in metric spaces

ACM Computing Surveys (CSUR)
Pointshop 3D: an interactive system for point-based surface editing

Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Radial basis functions for the multivariate interpolation of large scattered data sets

Journal of Computational and Applied Mathematics - Special issue: Proceedings of the 9th International Congress on computational and applied mathematics
Computing and Rendering Point Set Surfaces

IEEE Transactions on Visualization and Computer Graphics
Multi-level partition of unity implicits

ACM SIGGRAPH 2003 Papers
Shape modeling with point-sampled geometry

ACM SIGGRAPH 2003 Papers
Efficient and Stable Numerical Algorithms on Equilibrium Equations for Geometric Modeling

GMP '04 Proceedings of the Geometric Modeling and Processing 2004
Defining point-set surfaces

ACM SIGGRAPH 2004 Papers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address practical implementation issues of generating a progressive representation of point-sampled geometry. Fast and stable algorithms are proposed to efficiently implement a progressive version of the modified RBF Shepard's method. Comparisons with several well-known methods are presented, showing that the proposed algorithms can achieve good balance between geometric error reduction and time efficiency.