메뉴 건너뛰기




Volumn 158, Issue 2, 2003, Pages 297-316

Progressive scattered data filtering

Author keywords

Data clustering; K Center problem; Progressive scattered data reduction; Scattered data modelling; Thinning algorithms

Indexed keywords

COMPUTATIONAL METHODS; OPTIMIZATION; SET THEORY;

EID: 0141849314     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(03)00449-7     Document Type: Article
Times cited : (5)

References (14)
  • 3
    • 0037102497 scopus 로고    scopus 로고
    • Adaptive thinning for bivariate scattered data
    • Dyn N. Floater M.S. Iske A. Adaptive thinning for bivariate scattered data J. Comput. Appl. Math. 145 2002 505-517
    • (2002) J. Comput. Appl. Math. , vol.145 , pp. 505-517
    • Dyn, N.1    Floater, M.S.2    Iske, A.3
  • 5
    • 0030571096 scopus 로고    scopus 로고
    • Multistep scattered data interpolation using compactly supported radial basis functions
    • Floater M.S. Iske A. Multistep scattered data interpolation using compactly supported radial basis functions J. Comput. Appl. Math. 73 1996 65-78
    • (1996) J. Comput. Appl. Math. , vol.73 , pp. 65-78
    • Floater, M.S.1    Iske, A.2
  • 6
    • 0001684598 scopus 로고    scopus 로고
    • Thinning algorithms for scattered data interpolation
    • Floater M.S. Iske A. Thinning algorithms for scattered data interpolation BIT 38 1998 705-720
    • (1998) BIT , vol.38 , pp. 705-720
    • Floater, M.S.1    Iske, A.2
  • 8
    • 0022064511 scopus 로고
    • A best possible heuristic for the k-center problem
    • Hochbaum D.S. Shmoys D.B. A best possible heuristic for the k-center problem Math. Oper. Res. 10 1985 180-184
    • (1985) Math. Oper. Res. , vol.10 , pp. 180-184
    • Hochbaum, D.S.1    Shmoys, D.B.2
  • 9
    • 0141758579 scopus 로고    scopus 로고
    • Reconstruction of smooth signals from irregular samples by using radial basis function approximation
    • Y. Lyubarskii (Ed.), The Norwegian University of Science and Technology, Trondheim
    • A. Iske, Reconstruction of smooth signals from irregular samples by using radial basis function approximation, in: Y. Lyubarskii (Ed.), Proceedings of the 1999 International Workshop on Sampling Theory and Applications, The Norwegian University of Science and Technology, Trondheim, 1999, pp. 82-87.
    • (1999) Proceedings of the 1999 International Workshop on Sampling Theory and Applications , pp. 82-87
    • Iske, A.1
  • 10
    • 0141535477 scopus 로고    scopus 로고
    • Hierarchical scattered data filtering for multilevel interpolation schemes
    • T. Lyche, L. L. Schumaker (Eds.), Nashville, TN: Vanderbilt University Press
    • Iske A. Hierarchical scattered data filtering for multilevel interpolation schemes Lyche T. Schumaker L.L. Mathematical Methods for Curves and Surfaces: Oslo 2000 2001 211-221 Vanderbilt University Press Nashville, TN
    • (2001) Mathematical Methods for Curves and Surfaces: Oslo 2000 , pp. 211-221
    • Iske, A.1
  • 11
    • 0141870196 scopus 로고    scopus 로고
    • Scattered data modelling using radial basis functions
    • A. IsKe, E. Quak, M. S. Floater (Eds.), Berlin: Springer
    • Iske A. Scattered data modelling using radial basis functions IsKe A. Quak E. Floater M.S. Tutorials on Multiresolution in Geometric Modelling 2002 205-242 Springer Berlin
    • (2002) Tutorials on Multiresolution in Geometric Modelling , pp. 205-242
    • Iske, A.1
  • 12
    • 0018683792 scopus 로고
    • An algorithmic approach to network location problems, part I: The p-centers
    • Kariv O. Hakimi S.L. An algorithmic approach to network location problems, part I: the p-centers SIAM J. Appl. Math. 37 3 1979 513-538
    • (1979) SIAM J. Appl. Math. , vol.37 , Issue.3 , pp. 513-538
    • Kariv, O.1    Hakimi, S.L.2
  • 14
    • 0038887088 scopus 로고
    • Computing near-optimal solutions to combinatorial optimization problems
    • W. Cook, L. Lovasz, P. Seymour (Eds.), DIMACS Ser. Discrete Math. Theoret. Comput. Sci
    • D.B. Shmoys, Computing near-optimal solutions to combinatorial optimization problems, in: W. Cook, L. Lovasz, P. Seymour (Eds.), Combinatorial Optimization, DIMACS Ser. Discrete Math. Theoret. Comput. Sci., vol. 20, 1995, pp. 355-397.
    • (1995) Combinatorial Optimization , vol.20 , pp. 355-397
    • Shmoys, D.B.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.