메뉴 건너뛰기




Volumn 31, Issue 8, 1999, Pages 507-515

Data reduction of polygonal curves using B-splines

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; DATA REDUCTION;

EID: 0033155666     PISSN: 00104485     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0010-4485(99)00049-4     Document Type: Article
Times cited : (37)

References (32)
  • 1
    • 0024921405 scopus 로고
    • Geographic logic in line generalization
    • Jenks G.F. Geographic logic in line generalization. Cartographica. 26:1989;27-42.
    • (1989) Cartographica , vol.26 , pp. 27-42
    • Jenks, G.F.1
  • 2
    • 0024937550 scopus 로고
    • The integration of simplification and smoothing algorithms in line generalisation
    • McMaster R.B. The integration of simplification and smoothing algorithms in line generalisation. Cartographica. 26:(1):1989;101-121.
    • (1989) Cartographica , vol.26 , Issue.1 , pp. 101-121
    • McMaster, R.B.1
  • 3
    • 0026281724 scopus 로고
    • Theory of the cartographic line revisited
    • Beard K. Theory of the cartographic line revisited. Cartographica. 28:(4):1991;32-58.
    • (1991) Cartographica , vol.28 , Issue.4 , pp. 32-58
    • Beard, K.1
  • 4
    • 0027059438 scopus 로고
    • Integrating quantitative and qualitative aspects of digital line simplification
    • Cromley R.G., Campbell G.M. Integrating quantitative and qualitative aspects of digital line simplification. The Cartographic Journal. 29:(1):1992;25-30.
    • (1992) The Cartographic Journal , vol.29 , Issue.1 , pp. 25-30
    • Cromley, R.G.1    Campbell, G.M.2
  • 6
    • 0001489753 scopus 로고
    • Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
    • Douglas D.H., Peucker T.K. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer. 10/2:1973;112-122.
    • (1973) The Canadian Cartographer , vol.102 , pp. 112-122
    • Douglas, D.H.1    Peucker, T.K.2
  • 7
    • 0016406969 scopus 로고
    • Optimizing curve segmentation in computer graphics
    • A. Gunther, B. Levrat, & H. Lipps. New York: Elsevier
    • Reumann K., Witkam A.P.M. Optimizing curve segmentation in computer graphics. Gunther A., Levrat B., Lipps H. International computer symposium. 1974;467-472 Elsevier, New York.
    • (1974) International Computer Symposium , pp. 467-472
    • Reumann, K.1    Witkam, A.P.M.2
  • 9
    • 0022794678 scopus 로고
    • Computational-geometric methods for polygonal approximations of a curve
    • Imai H., Iri M. Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics and Image Processing. 36:1986;31-41.
    • (1986) Computer Vision, Graphics and Image Processing , vol.36 , pp. 31-41
    • Imai, H.1    Iri, M.2
  • 10
    • 0003719683 scopus 로고
    • Data reduction of piecewise linear curves
    • SINTEF Informatics, Oslo, Norway
    • Arge E, Dæhlen M. Data reduction of piecewise linear curves. Research Report STF33 A94042, SINTEF Informatics, Oslo, Norway, 1994.
    • (1994) Research Report STF33 A94042
    • Arge, E.1    Dæhlen, M.2
  • 11
    • 58149415051 scopus 로고
    • An iterative procedure for the polygonal approximation of plane curves
    • Ramer U. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing. 1:1972;244-256.
    • (1972) Computer Graphics and Image Processing , vol.1 , pp. 244-256
    • Ramer, U.1
  • 12
    • 0018024597 scopus 로고
    • An efficient algorithm for the piecewise linear approximation of planar curves
    • Williams C.M. An efficient algorithm for the piecewise linear approximation of planar curves. Computer Graphics and Image Processing. 8:1978;286-293.
    • (1978) Computer Graphics and Image Processing , vol.8 , pp. 286-293
    • Williams, C.M.1
  • 13
    • 0019148998 scopus 로고
    • Fast polygonal approximation of digitized curves
    • Sklansky J., Gonzalez V. Fast polygonal approximation of digitized curves. Pattern Recognition. 12:1980;327-331.
    • (1980) Pattern Recognition , vol.12 , pp. 327-331
    • Sklansky, J.1    Gonzalez, V.2
  • 15
    • 0000728115 scopus 로고
    • Some informational aspects of visual perception
    • Attneave F. Some informational aspects of visual perception. Psychological Review. 61:1954;183-193.
    • (1954) Psychological Review , vol.61 , pp. 183-193
    • Attneave, F.1
  • 16
    • 0018130812 scopus 로고
    • Shape description via the use of critical points
    • Freeman H. Shape description via the use of critical points. Pattern Recognition. 10:1978;159-166.
    • (1978) Pattern Recognition , vol.10 , pp. 159-166
    • Freeman, H.1
  • 17
    • 0024836979 scopus 로고
    • Data compression and critical points detection using normalized symmetric scattered matrix
    • Baltimore
    • Thapa K. Data compression and critical points detection using normalized symmetric scattered matrix. In: Proceedings of Auto Carto 9, Baltimore, 1989. pp. 78-89.
    • (1989) In: Proceedings of Auto Carto , vol.9 , pp. 78-89
    • Thapa, K.1
  • 21
    • 0023453273 scopus 로고
    • Knot removal for parametric B-spline curves and surfaces
    • Lyche T., Morken K. Knot removal for parametric B-spline curves and surfaces. Computer Aided Geometric Design. 4:1987;217-230.
    • (1987) Computer Aided Geometric Design , vol.4 , pp. 217-230
    • Lyche, T.1    Morken, K.2
  • 23
    • 0342628579 scopus 로고    scopus 로고
    • B-spline approximation with energy constraints
    • J. Hoschek, & P. Kaklis. Stuttgart: Teubner
    • Dietz U. B-spline approximation with energy constraints. Hoschek J., Kaklis P. Advanced course on fairshape. 1996;229-239 Teubner, Stuttgart.
    • (1996) Advanced Course on Fairshape , pp. 229-239
    • Dietz, U.1
  • 24
    • 0242499421 scopus 로고    scopus 로고
    • Data fitting with B-spline curves
    • J. Teixeira, & J. Rix. Berlin: Springer
    • Daniel M. Data fitting with B-spline curves. Teixeira J., Rix J. Modelling and graphics in science and technology. 1996;91-104 Springer, Berlin.
    • (1996) Modelling and Graphics in Science and Technology , pp. 91-104
    • Daniel, M.1
  • 26
    • 0024699908 scopus 로고
    • Choosing nodes in parametric curve interpolation
    • Lee E.T.Y. Choosing nodes in parametric curve interpolation. Computer Aided Design. 21:(6):1989;363-370.
    • (1989) Computer Aided Design , vol.21 , Issue.6 , pp. 363-370
    • Lee, E.T.Y.1
  • 27
    • 0002894694 scopus 로고
    • Knot selection for parametric spline interpolation
    • T. Lyche, & L.L. Schumaker. Boston: Academic Press
    • Foley T.A., Nielson G.M. Knot selection for parametric spline interpolation. Lyche T., Schumaker L.L. Mathematical methods in computer aided geometric design. 1989;261-271 Academic Press, Boston.
    • (1989) Mathematical Methods in Computer Aided Geometric Design , pp. 261-271
    • Foley, T.A.1    Nielson, G.M.2
  • 28
    • 0024034379 scopus 로고
    • Intrinsic parameterization for approximation
    • Hoschek J. Intrinsic parameterization for approximation. Computer Aided Geometric Design. 5:1988;27-31.
    • (1988) Computer Aided Geometric Design , vol.5 , pp. 27-31
    • Hoschek, J.1


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