A new ordering strategy applied to spatial data processing

International Journal of Geographical Information Science

Volumn 12, Issue 1, 1998, Pages 3-22

  Liu, Xian ^a   Schrack, Günther F ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA PROCESSING; GIS; ORDERING STRATEGY; RASTER; SPATIAL DATA;

EID: 0031943119     PISSN: 13658816     EISSN: None     Source Type: Journal    
DOI: 10.1080/136588198241987     Document Type: Article

References (37)

1. ABEL, D., and MARK, D., 1990, A comparative analysis of some two-dimensional orderings. International Journal of Geographical Information Systems, 4, 21-31.
2. AHO, A., and ULLMAN, J., 1979, Optimal partial match retrieval when fields are independently specified. ACM Transactions on Database Systems, 4, 168-179.
3. BIALLY, Y., 1969, Space-filling curves: their generation and their application to bandwidth reduction. I.E.E.E. Transactions on Information Theory, IT-15, 658-664.
4. BURROUGH, P., 1986, Principles of Geographical Information Systems for Land Resources Assessment (Oxford: Clarendon Press).
5. BUTZ, A., 1971, Alternative algorithm for Hilbert's space-filling curve. I.E.E.E. Transactions on Computers, C-20, 166-171.
6. COLE, A., 1991, Halftoning without dither or edge enhancement. The Visual Computer, 7, 232-246.
7. CORMEN, T., LEISERSON, T., and RIVEST, R., 1990, Introduction to Algorithms (New York: McGraw-Hill).
8. EDDY, C., and LOONEY, B., 1993, Three-dimensional digital imaging of environmental data: selection of gridding parameters. International Journal of Geographical Information Systems, 7, 165-172.
9. FALOUTSOS, C., and ROSEMAN, S., 1989, Fractals for secondary key retrieval. In Proceedings of ACM Symposium on the Principles of Database Systems (New York: ACM Press), pp. 247-252.
10. GAHEGAN, M., 1989, An efficient use of quadtrees in a GIS. International Journal of Geographical Information Systems, 3, 201-214.
11. GARGANTINI, I., 1982, An effective way to represent quadtrees. Communications of the ACM, 25, 905-910.
12. GOLDSCHLAGER, L., 1981, Short algorithms for space-filling curves. Software Practice and Experience, 11, 99-100.
13. GOODCHILD, M. F., and GRANDFIELD, A. W., 1983, Optimizing raster storage: an evaluation of four alternatives. In Proceedings of AutoCarto 6 (Fall Church: American Congress on Surveying and Mapping), pp. 400-407.
14. HAMMING, R., 1986, Coding and Information Theory (2nd edition) (Englewood Cliffs: Prentice Hall).
15. HARARY, F., 1969, Graph Theory (Reading, MA., Addison-Wesley Publishing Company).
16. HILBERT, D., 1891, Ueber die stetige abbildung einer linie auf ein flaechenstueck. Mathematische Annalen, 38, 459-460.
17. IBBS, T., and STEVENS, A., 1988, Quadtree storage of vector data. International Journal of Geographical Information Systems, 2, 43-56.
18. JAGADISH, H., 1990, Linear clustering of objects with multiple attributes. In Proceedings of the ACM SIGMOD Conference (New York: ACM Press), pp. 332-342.
19. JONES, C., 1989, Data structures for three-dimensional spatial information systems in geology. International Journal of Geographical Information Systems, 3, 15-31.
20. LANGRAN, G., 1989, A review of temporal database research and its use in GIS applications. International Journal of Geographical Information Systems, 3, 215-232.
21. LIU, X., 1996 a, On the Ordering of Multiattribute Data in Information Retrieval Systems, Ph.D Thesis, The University of British Columbia, Vancouver, Canada.
22. LIU, X., and SCHRACK, G., 1996 b, Encoding and decoding the Hilbert order. Software Practice and Experience, 26, 1335-1346.
23. LIU, X., and SCHRACK, G., 1996 c, An algorithm for encoding and decoding the 3D Hilbert order. I.E.E.E. Transactions on Image Processing, October 1996.
24. LLOYD, J., 1980, Optimal partial-match retrieval. BIT, 20, 406-413.
25. MARK, D., 1990, Neighbor-based properties of some ordering of two-dimensional space. Geographical Analysis, 22, 145-157.
26. MARK, D., LAUZON, J., and CEBRIAN, J., 1989, A review of quadtree-based strategies for interfacing coverage data with digital elevation models in grid form. International Journal of Geographical Information Systems, 3, 3-14.
27. MASON, D. C., O'CONAILL, M.A., and BELL, S. B. M., 1994, Handling four-dimensional georeferenced data in environmental GIS. International Journal of Geographical Information Systems, 8, 191-215.
28. MORTON, G., 1966, A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing (Ottawa, Canada: IBM Ltd.).
29. ORENSTEIN, J., 1986, Spatial query processing in an object-oriented database system. SIGMOD Record, 15, 326-336.
30. ORENSTEIN, J., and MERRETT, T., 1984, A class of data structures for associative searching. In Proceedings of 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems (New York: ACM Press), pp. 181-190.
31. PEANO, G., 1890, Sur une courbe qui remplit toute une aire plane. Mathematische Annalen, 36, 157-160.
32. PREPARATA, F., and SHAMOS, M., 1985, Computational Geometry: An Introduction (New York: Springer-Verlag).
33. ROSENFELD, A., and PFALTZ, J., 1968, Distance functions on digital pictures. Pattern Recognition, 1, 33-61.
34. SCHRACK, G., 1992, Finding neighbors of equal size in linear quadtrees and octrees in constant time. Computer Vision, Graphics, and Image Processing: Image Understanding, 55, 221-230.
35. SCHRACK, G., 1995, Fast encoding and decoding algorithms for quadtree and actree location codes, Technical Report, Department of Electrical Engineering, The University of British Columbia, Vancouver, Canada.
36. SCHRACK, G., and LIU, X., 1995, The spatial U-order and some of its mathematical characteristics, In Proceedings of I.E.E.E. Pacific Rim Conference on Communications, Computers, and Signal Processing (Victoria, B. C., Canada), pp. 416-419.
37. WIRTH, N., 1976, Algorithm + Data Structures = Programs (Englewood Cliffs: Prentice Hall).