Interpolating implicit surfaces from scattered surface data using compactly supported radial basis functions

被引:185
作者
Morse, BS [1 ]
Yoo, TS [1 ]
Rheingans, P [1 ]
Chen, DT [1 ]
Subramanian, KR [1 ]
机构
[1] Brigham Young Univ, Dept Comp Sci, Provo, UT 84602 USA
来源
INTERNATIONAL CONFERENCE ON SHAPE MODELING AND APPLICATIONS, PROCEEDING | 2001年
关键词
D O I
10.1109/SMA.2001.923379
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We describe algebraic methods for creating implicit surfaces using linear combinations of radial basis interpolants to form complex models from scattered surface points. Shapes with arbitrary topology are easily represented without the usual interpolation or aliasing errors arising from discrete sampling. These methods were first applied to implicit surfaces by Savchenko, et al. and later developed independently by Turk and O'Brien as a means of performing shape interpolation. Earlier approaches were limited as a modeling mechanism because of the order of the computational complexity involved. We explore and extend these implicit interpolating methods to make them suitable for systems of large numbers of scattered surface points by using compactly supported radial basis interpolants. The use of compactly supported elements generates a sparse solution space, reducing the computational complexity and making the technique practical for large models. The local nature of compactly supported radial basis functions permits the use of computational techniques and data structures such as k-d trees for spatial subdivision, promoting fast solvers and methods to divide and conquer many of the subproblems associated with these methods. Moreover, the representation of complex models permits the exploration of diverse surface geometry. This reduction in computational complexity enables the application of these methods to the study of shape properties of large complex shapes.
引用
收藏
页码:89 / 98
页数:10
相关论文
共 19 条
  • [1] MULTIDIMENSIONAL BINARY SEARCH TREES USED FOR ASSOCIATIVE SEARCHING
    BENTLEY, JL
    [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (09) : 509 - 517
  • [2] Blinn J. F., 1982, Computer Graphics, V16, DOI 10.1145/965145.801290
  • [3] DONGARRA JJ, 1990, ACM T MATH SOFTWARE, V16, P1, DOI 10.1145/77626.79170
  • [4] DUCHON J, 1978, RAIRO-ANAL NUMER-NUM, V12, P325
  • [5] HART J, 1997, NEW FONTIERS MODELIN
  • [6] Kimia B., 1994, Geometry-driven diffusion in computer vision, P307
  • [7] Lindeberg T., 2013, Scale-space theory in computer vision, V256
  • [8] FRONTS PROPAGATING WITH CURVATURE-DEPENDENT SPEED - ALGORITHMS BASED ON HAMILTON-JACOBI FORMULATIONS
    OSHER, S
    SETHIAN, JA
    [J]. JOURNAL OF COMPUTATIONAL PHYSICS, 1988, 79 (01) : 12 - 49
  • [9] PARALLEL CIRCUIT SIMULATION ON SUPERCOMPUTERS
    SALEH, RA
    GALLIVAN, KA
    CHANG, MC
    HAJJ, IN
    SMART, D
    TRICK, TN
    [J]. PROCEEDINGS OF THE IEEE, 1989, 77 (12) : 1915 - 1931
  • [10] FUNCTION REPRESENTATION OF SOLIDS RECONSTRUCTED FROM SCATTERED SURFACE POINTS AND CONTOURS
    SAVCHENKO, VV
    PASKO, AA
    OKUNEV, OG
    KUNII, TL
    [J]. COMPUTER GRAPHICS FORUM, 1995, 14 (04) : 181 - 188