Map and Line-Drawing Processing
Maps are line drawings used to represent data that is intrinsically two-dimensional in nature. The most common use of maps is for depicting geographically distributed data, though maps also find application for representing data based on totally different spatial coordinates. Once confined to representation solely on paper, today’s maps tend increasingly to be stored in digital form on magnetic tape or disk, with the “paper” map being merely a “hard copy” of the stored data. This article discusses some of the different map forms, data structures, and algorithms for analysis and manipulation, and describes some of the current problems relating to the processing of all-digital map data.
KeywordsIncome Coherence Assure Rosen Editing
Unable to display preview. Download preview PDF.
- 1.A. Rosenfeld and A. C. Kak, Digital Picture Processing, Academic Press, New York 1976, Chapt. 5.Google Scholar
- 2.W. K. Pratt, Digital Image Processing, John Wiley & Sons, New York, 1978, Chapt’s. 21–24.Google Scholar
- 6.H. Freeman, “Applications of the generalized chain coding scheme to map data processing”, Proc. Conf. on Pattern Recognition and Image Processing, IEEE Computer Society, publ. no. 78CH1318-5C, May 1978, pp. 220–226.Google Scholar
- 7.J. A. Saghri and H. Freeman. “Analysis of the precision of generalized chain codes for the representation of planar curves”, IEEE Trans. on Pattern Analysis and Machine Intelligence, 1980, (to appear).Google Scholar
- 8.D. A. McClure, “Computation of approximately optimal compressed representations of discretized plane curves”, Proc. Conf. on Pattern Recognition and Image Processing, IEEE Computer Society publ. no. 77CH1208-9C, June 1977, pp. 175–182.Google Scholar
- 11.S. P. Morse, “Computer storage of contour-map data”, Proc. 23rd National Conf. of ACM, LasVegas, Nevada, August 1968.Google Scholar
- 13.L. D. Shapiro and R. M. Haralick, “A general spatial data structure”, Proc. Conf. on Pattern Recognition and Image Processing, IEEE Computer Soc., publ. no. 78CH1318-5C, May 1978.Google Scholar
- 16.J. A. Saghri, Efficient encoding of line drawing data with generalized chain codes, Tech. Rept. IPL-TR-79-003, Rensselaer Polytechnic Institute, Troy, NY, August 1979.Google Scholar
- 17.A. Rosenfeld, “Algorithms for image/vector conversion”, Computer Graphics, vol. 12, no. 3, August 1978, pp. 135–139.Google Scholar
- 18.R. F. Sproull and I. E. Sutherland, “A clipping divider”, Proc. Fall Joint Computer Conf., 1968, AFIPS Press, pp. 765–775.Google Scholar
- 19.H. Freeman, “Analysis of line drawings”, in J. C. Simon and A. Rosenfeld, Digital Image Processing and Analysis, Noordhoff, Leyden, 1977, pp. 187–199.Google Scholar