Abstract
This paper presents some new methods for ordering spatial entities to reflect spatial proximity. The ordering methods work not only for point sets, but also for a variety of types of 1-D, 2-D, and higher-dimensional spatial objects. The paper describes some important, less traditional applications for spatially sorted data, including list frames for systematic sampling and efficient organization of hierarchical geographic neighborhoods. The new methods derive from methods for ordering vertices or edges in a tree (connected acyclic graph), making novel use of an Eulerian tour to assign a cyclic order. The new orderings are canonical in the sense that they are coordinate system independent, rotation invariant, and do not depend on prior bucketing of space as do some standard existing methods. They depend instead on the spatial distribution of the input data and on the metric of the underlying space. We call our new orderings tree-orders. They can be constructed in linear time from topological graph data structures; and we show that they are fully characterized by a useful proximity-preserving property called branch-recursion.
Similar content being viewed by others
References
D.J. Abel and D.M. Mark, “A Comparative Analysis of Some Two”Dimensional Orderings” International Journal of Geographical Information Systems, Vol. 4(1):21”31, 1990.
A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison”Wesley: Reading, MA, 1974.
A. Aho, J. Hopcroft, and J. Ullman, Data Structures and Algorithms, Addison”Wesley: Reading, MA, 1985.
H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer”Verlag: New York, 1987.
H. Edelsbrunner, personal communication, 1990.
C. Faloutsos and Y. Rong, “Spatial Access Methods Using Fractals: Algorithms and Performance Evaluation,” University of Maryland Computer Science Technical Report Series, UMIACS”TR”89”31, CS”TR”2214, 1989.
C. Faloutsos, and S. Roseman, “Fractals for Secondary Key Retrieval,” University of Maryland Computer Science Technical Report Series, UMIACS”TR”89”47, CS”TR”2242, 1989.
M.R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP”Completeness, W. H. Freeman: New York, 1979.
F. Harary, Graph Theory, Addison”Wesley: Reading, MA, 1969.
L. Kish, Survey Sampling, John Wiley: New York, 1965.
D.M. Mark, “Neighbor”based Properties of Some Orderings of Two”Dimensional Space,” Geographical Analysis, Vol. 22(2): 145”157, 1990.
C. Monma and S. Suri, “Transitions in Geometric Minimum Spanning Trees” in Proceedings of Seventh Annual Symposium on Computational Geometry, North Conway, NH, ACM Press: Baltimore, MD, 239”249, 1991.
F. Preparata and M. Shamos, Computational Geometry, An Introduction, Springer”Verlag: New York, 1985.
A. Saalfeld, “Canonical Cyclic Orders for Points in the Plane,” in Proceedings of the Third Canadian Conference on Computational Geometry, Vancouver, BC, Canada, 1990.
A. Saalfeld, “New Proximity”Preserving Orderings for Spatial Data,” in Proceedings of the Tenth International Symposium on Computer”Assisted Cartography (AutoCarto 10), ACSM/ASPRS, Baltimore, MD, 59”76, 1991.
K. Wolter and R. Harter, “Sample Maintenance Based on Peano Keys,” presented at Statistics Canada Symposium on Analysis of Data in Time, Ottawa, Canada, 1989.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Saalfeld, A. Sorting Spatial Data for Sampling and Other Geographic Applications. GeoInformatica 2, 37–57 (1998). https://doi.org/10.1023/A:1009741021887
Issue Date:
DOI: https://doi.org/10.1023/A:1009741021887