메뉴 건너뛰기




Volumn 30, Issue 1, 2003, Pages 33-50

B-spline functions and wavelets for cartographic line generalization

Author keywords

B spline wavelets; B splines; Line generalization

Indexed keywords

AGGLOMERATION; COMPUTER SIMULATION; CURVES (ROAD); FUNCTIONS; MAPPING; SPLINES;

EID: 0037266380     PISSN: 15230406     EISSN: None     Source Type: Journal    
DOI: 10.1559/152304003100010938     Document Type: Article
Times cited : (19)

References (57)
  • 3
    • 0000728115 scopus 로고
    • Some informational aspects of visual perception
    • Attneave, F. 1954. Some informational aspects of visual perception. Psychological Review 61:183-93.
    • (1954) Psychological Review , vol.61 , pp. 183-193
    • Attneave, F.1
  • 5
    • 0026281724 scopus 로고
    • Theory of the cartographic line revisited
    • Beard, K. 1991a. Theory of the cartographic line revisited. Cartographica 28: 32-58.
    • (1991) Cartographica , vol.28 , pp. 32-58
    • Beard, K.1
  • 6
    • 0026306128 scopus 로고
    • Constraints on rule formation
    • B. Buttenfield and R. B. McMaster (eds), Essex, UK: Longman
    • Beard, K. 1991b. Constraints on rule formation. In: B. Buttenfield and R. B. McMaster (eds), Map generalization. Essex, UK: Longman. pp. 121-35.
    • (1991) Map Generalization , pp. 121-135
    • Beard, K.1
  • 7
    • 0019032952 scopus 로고
    • Inserting new knots into B-spline curves
    • Boehm, W. 1980. Inserting new knots into B-spline curves. Computer Aided Design 12: 199-201.
    • (1980) Computer Aided Design , vol.12 , pp. 199-201
    • Boehm, W.1
  • 8
    • 0021482875 scopus 로고
    • On the efficiency of knot insertion algorithms
    • Boehm, W. 1985. On the efficiency of knot insertion algorithms. Computer Aided Design 2: 141-3.
    • (1985) Computer Aided Design , vol.2 , pp. 141-143
    • Boehm, W.1
  • 10
    • 0022185949 scopus 로고
    • Treatment of the cartographic line
    • Buttenfield, B. P. 1985. Treatment of the cartographic line. Cartographica 22: pp. 1-26.
    • (1985) Cartographica , vol.22 , pp. 1-26
    • Buttenfield, B.P.1
  • 11
    • 0026306127 scopus 로고
    • A rule for describing line feature geometry
    • B. Buttenfield and R. B. McMaster (eds), London, U.K.: Longman Scientific and Technical
    • Buttenfield, B. P. 1991. A rule for describing line feature geometry. In: B. Buttenfield and R. B. McMaster (eds), Map generalization: Making rules for knowledge representation. London, U.K.: Longman Scientific & Technical. pp. 150-71.
    • (1991) Map Generalization: Making Rules for Knowledge Representation , pp. 150-171
    • Buttenfield, B.P.1
  • 13
    • 0002154873 scopus 로고
    • Wavelets on a bounded interval
    • D. Braess and L. L. Schumaker (eds), Basel, Switzerland: Birkhauser Verlag
    • Chui, C. K., and E. Quak. 1992. Wavelets on a bounded interval. In: D. Braess and L. L. Schumaker (eds), Numerical methods in approximation theory, vol. 9. Basel, Switzerland: Birkhauser Verlag. pp. 53-75.
    • (1992) Numerical Methods in Approximation Theory , vol.9 , pp. 53-75
    • Chui, C.K.1    Quak, E.2
  • 14
    • 0027059438 scopus 로고
    • Integrating quantitative and qualitative aspects of digital line simplification
    • Cromley, R. G., and G. M. Campbell. 1992. Integrating quantitative and qualitative aspects of digital line simplification. The Cartographic Journal 29: pp. 25-30.
    • (1992) The Cartographic Journal , vol.29 , pp. 25-30
    • Cromley, R.G.1    Campbell, G.M.2
  • 16
    • 0242499421 scopus 로고    scopus 로고
    • Data fitting with B-spline curves
    • J. Teixeira and J. Rix (eds), Berlin: Springer
    • Daniel, M. 1996. Data fitting with B-spline curves. In: J. Teixeira and J. Rix (eds), Modelling and graphics in science and technology, Berlin: Springer, pp. 91-104.
    • (1996) Modelling and Graphics in Science and Technology , pp. 91-104
    • Daniel, M.1
  • 17
    • 0001489753 scopus 로고
    • Algorithms for the reduction of the number of points required to represent a digitized line or its caricature
    • Douglas, D. H., and Peucker, T. K. 1973. Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer, vol. 10, pp. 112-122.
    • (1973) The Canadian Cartographer , vol.10 , pp. 112-122
    • Douglas, D.H.1    Peucker, T.K.2
  • 20
    • 0002894694 scopus 로고
    • Knot selection for parametric spline interpolation
    • T. Lyche and L. L. Schumaker (eds), Boston, Illinois: Academic Press
    • Foley, T. A., and G. M. Nielson. 1989. Knot selection for parametric spline interpolation. In: T. Lyche and L. L. Schumaker (eds), Mathematical methods in computer aided geometric design. Boston, Illinois: Academic Press. pp. 261-71.
    • (1989) Mathematical Methods in Computer Aided Geometric Design , pp. 261-271
    • Foley, T.A.1    Nielson, G.M.2
  • 21
    • 0018130812 scopus 로고
    • Shape description via the use of critical points
    • Freeman, H. 1978. Shape description via the use of critical points. Pattern Recognition 10: 159-66.
    • (1978) Pattern Recognition , vol.10 , pp. 159-166
    • Freeman, H.1
  • 23
    • 84958047179 scopus 로고
    • Spectral representation of linear features for generalisation
    • Vienna, Austria: Springer Verlag
    • Fritsch, E., and J.P. Lagrange. 1995. Spectral representation of linear features for generalisation. In: Proceedings of COSIT'95. Vienna, Austria: Springer Verlag. pp. 157-171.
    • (1995) Proceedings of COSIT'95 , pp. 157-171
    • Fritsch, E.1    Lagrange, J.P.2
  • 24
    • 0242416109 scopus 로고    scopus 로고
    • A hierarchical structure for locating intersections in large sets of B-spline curves
    • Saint-Malo, France, June 27 - July 3
    • Guilbert, E., E. Saux, and M. Daniel. 2002. A hierarchical structure for locating intersections in large sets of B-spline curves. Fifth International Conference: Curves and Surfaces, Saint-Malo, France, June 27 - July 3.
    • (2002) Fifth International Conference: Curves and Surfaces
    • Guilbert, E.1    Saux, E.2    Daniel, M.3
  • 25
    • 0033063566 scopus 로고    scopus 로고
    • The constraint method for solving spatial conflicts in cartographic generalization
    • Harrie, L. 1999. The constraint method for solving spatial conflicts in cartographic generalization. Cartography and Geographic Information Science 26(1): 55-69.
    • (1999) Cartography and Geographic Information Science , vol.26 , Issue.1 , pp. 55-69
    • Harrie, L.1
  • 26
    • 0033622621 scopus 로고    scopus 로고
    • Solving space conflicts in map generalization: Using a finite element method
    • Hojholt, P. 2000. Solving space conflicts in map generalization: Using a finite element method. Cartography and Geographic Information Science 27(1): 65-73.
    • (2000) Cartography and Geographic Information Science , vol.27 , Issue.1 , pp. 65-73
    • Hojholt, P.1
  • 27
    • 0024034379 scopus 로고
    • Intrinsic parameterization for approximation
    • Hoschek, J. 1988. Intrinsic parameterization for approximation. Computer Aided Geometric Design 5: 27-31.
    • (1988) Computer Aided Geometric Design , vol.5 , pp. 27-31
    • Hoschek, J.1
  • 28
    • 0022794678 scopus 로고
    • Computational-geometric methods for polygonal approximations of a curve
    • Imai, H., and M. Iri. 1986. Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics, and Image Processing 36: 31-41.
    • (1986) Computer Vision, Graphics, and Image Processing , vol.36 , pp. 31-41
    • Imai, H.1    Iri, M.2
  • 29
    • 0024921405 scopus 로고
    • Geographic logic in line generalization
    • Jenks, G. F. 1989. Geographic logic in line generalization. Cartographica 26: 27-42.
    • (1989) Cartographica , vol.26 , pp. 27-42
    • Jenks, G.F.1
  • 30
    • 0024699908 scopus 로고
    • Choosing nodes in parametric curve interpolation
    • Lee, E. T. Y. 1989. Choosing nodes in parametric curve interpolation. Computer Aided Design 21: 363-70.
    • (1989) Computer Aided Design , vol.21 , pp. 363-370
    • Lee, E.T.Y.1
  • 31
    • 0029326064 scopus 로고
    • A new approach towards free-form surfaces control
    • Léon, J. C., and P. Trompette. 1995. A new approach towards free-form surfaces control. Computer Aided Geometric Design 12: 395-416.
    • (1995) Computer Aided Geometric Design , vol.12 , pp. 395-416
    • Léon, J.C.1    Trompette, P.2
  • 32
    • 78650647176 scopus 로고
    • A natural principle for the objective generalization of digital maps
    • Li, Z., and S. Openshaw. 1993. A natural principle for the objective generalization of digital maps. Cartography and Geographic Information Systems 20: 19-29.
    • (1993) Cartography and Geographic Information Systems , vol.20 , pp. 19-29
    • Li, Z.1    Openshaw, S.2
  • 33
    • 0023453273 scopus 로고
    • Knot removal for parametric B-spline curves and surfaces
    • Lyche, T., and K. Morken. 1987. Knot removal for parametric B-spline curves and surfaces. Computer Aided Geometric Design 4: 217-30.
    • (1987) Computer Aided Geometric Design , vol.4 , pp. 217-230
    • Lyche, T.1    Morken, K.2
  • 34
    • 0028530442 scopus 로고
    • An algorithm for conflict identification and feature displacement in automated map generalisation
    • Mackaness, W. A. 1994. An algorithm for conflict identification and feature displacement in automated map generalisation. Cartography and Geographic Information Systems 21(4): 219-32.
    • (1994) Cartography and Geographic Information Systems , vol.21 , Issue.4 , pp. 219-232
    • Mackaness, W.A.1
  • 36
    • 0024937550 scopus 로고
    • The integration of simplification and smoothing algorithms in line generalization
    • McMaster, R. B. 1989. The integration of simplification and smoothing algorithms in line generalization. Cartographica 26: 101-21.
    • (1989) Cartographica , vol.26 , pp. 101-121
    • McMaster, R.B.1
  • 37
    • 0001751151 scopus 로고    scopus 로고
    • Spatial interpolation
    • P. A. Longley, M. F. Goodchild, D. J. Maguire, and D. W. Rhind (eds), New-York, New York: John Wiley
    • Mitas, L., and H. Mitasova. 1999. Spatial interpolation. In: P. A. Longley, M. F. Goodchild, D. J. Maguire, and D. W. Rhind (eds), Geographical Information Systems. New-York, New York: John Wiley. pp. 481-92.
    • (1999) Geographical Information Systems , pp. 481-492
    • Mitas, L.1    Mitasova, H.2
  • 41
    • 58149415051 scopus 로고
    • An iterative procedure for the polygonal approximation of plane curves
    • Ramer, U. 1972. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1: 244-56.
    • (1972) Computer Graphics and Image Processing , vol.1 , pp. 244-256
    • Ramer, U.1
  • 42
    • 0016406969 scopus 로고
    • Optimizing curve segmentation in computer graphics
    • A. Gunther, B. Levrat, and H. Lipps (eds), New York, New York: Amer. Elsevier
    • Reumann, K., and A. P. M. Witkam. 1974. Optimizing curve segmentation in computer graphics. In: A. Gunther, B. Levrat, and H. Lipps (eds), International Computer Symposium. New York, New York: Amer. Elsevier. pp. 467-72.
    • (1974) International Computer Symposium , pp. 467-472
    • Reumann, K.1    Witkam, A.P.M.2
  • 44
    • 84902377890 scopus 로고    scopus 로고
    • Line cartographic generalization. A mechanical approach with B-spline curves for exaggeration and displacement operators
    • Lisbon, Portugal
    • Saux, E. 1998. Line cartographic generalization. A mechanical approach with B-spline curves for exaggeration and displacement operators. In: Proceedings of the International Conference and Exhibition on Geographic Information, Lisbon, Portugal.
    • (1998) Proceedings of the International Conference and Exhibition on Geographic Information
    • Saux, E.1
  • 46
    • 0033155666 scopus 로고    scopus 로고
    • Data reduction of polygonal curves using B-splines
    • Saux, E., and M. Daniel. 1999. Data reduction of polygonal curves using B-splines. Computer Aided Design 31: 507-15.
    • (1999) Computer Aided Design , vol.31 , pp. 507-515
    • Saux, E.1    Daniel, M.2
  • 48
    • 0019148998 scopus 로고
    • Fast polygonal approximation of digitized curves
    • Sklansky, J., and V Gonzalez. 1980. Fast polygonal approximation of digitized curves. Pattern Recognition 12: 327-31.
    • (1980) Pattern Recognition , vol.12 , pp. 327-331
    • Sklansky, J.1    Gonzalez, V.2
  • 50
    • 0024836979 scopus 로고
    • Data compression and critical points detection using normalized symmetric scattered matrix
    • Baltimore, Maryland
    • Thapa, K. 1989. Data compression and critical points detection using normalized symmetric scattered matrix. In: Proceedings of Auto Carto 9, Baltimore, Maryland. pp. 78-89.
    • (1989) Proceedings of Auto Carto , vol.9 , pp. 78-89
    • Thapa, K.1
  • 52
    • 0025571644 scopus 로고
    • The Douglas-Peucker algorithm for line simplification: Reevaluation through visualization
    • Visvalingam, M., and J. Whyatt. 1990. The Douglas-Peucker algorithm for line simplification: Reevaluation through visualization. Computer Graphic Forum 9: 213-28.
    • (1990) Computer Graphic Forum , vol.9 , pp. 213-228
    • Visvalingam, M.1    Whyatt, J.2
  • 55
    • 0002164216 scopus 로고    scopus 로고
    • Generalising spatial data and dealing with multiple representations
    • P. A. Longley, M. F. Goodchild, D. J. Maguire, and D. W. Rhind (eds), New-York, New York: John Wiley
    • Weibel, R., and G. Dutton. 1999. Generalising spatial data and dealing with multiple representations. In: P. A. Longley, M. F. Goodchild, D. J. Maguire, and D. W. Rhind (eds), Geographical Information Systems. New-York, New York: John Wiley. pp. 125-55.
    • (1999) Geographical Information Systems , pp. 125-155
    • Weibel, R.1    Dutton, G.2
  • 56
    • 0018024597 scopus 로고
    • An efficient algorithm for the piecewise linear approximation of planar curves
    • Williams, C. M. 1978. An efficient algorithm for the piecewise linear approximation of planar curves. Computer Graphics and Image Processing 8: 286-93.
    • (1978) Computer Graphics and Image Processing , vol.8 , pp. 286-293
    • Williams, C.M.1
  • 57
    • 0032051109 scopus 로고    scopus 로고
    • A method for determining knots in parametric curve interpolation
    • Zhang, C., F. F. Cheng, and K.T. Miura. 1998. A method for determining knots in parametric curve interpolation. Computer Aided Geometric Design 15: 399-416.
    • (1998) Computer Aided Geometric Design , vol.15 , pp. 399-416
    • Zhang, C.1    Cheng, F.F.2    Miura, K.T.3


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