Exact computational methods for calculating distances between objects in a cartographic database

Cartography and Geographic Information Systems

Volumn 23, Issue 4, 1996, Pages 180-195

  Okabe, Atsuyuki ^a   Miller, Harvey J ^b  

^a UNIVERSITY OF TOKYO   (Japan)

^b UNIVERSITY OF UTAH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMPUTATIONAL METHODS; DATABASE SYSTEMS; MAPPING;

CARTOGRAPHIC DATABASE; SPATIAL ANALYSIS; SPATIAL MEASURES; SPATIAL OBJECTS;

GEOGRAPHIC INFORMATION SYSTEMS;

EID: 0030258414     PISSN: 10509844     EISSN: None     Source Type: Journal    
DOI: 10.1559/152304096782438846     Document Type: Article

References (32)

1. Aho, A. V., J. E. Hopcroft, and J. D. Ullman. 1974. The design and analysis of computer algorithms. Reading: Addison-Wesley
2. Atallah M. J. 1983. A linear time algorithm for the Hausdorff distance between convex polygons. Information Processing Letters 17:207-9.
3. Casillas, P. A. 1987. Data aggregation and the p-median problem in continuous space. In A. Ghosh and G. Rushton, eds. Spatial analysis and location-allocation models. New York: Van Nostrand Reinhold, 327-44.
4. Chin, F., and C. A. Wang. 1984. Minimum vertex distance between separable convex polygons. Information Processing Letters 18:41-5.
5. Current, J. R., and D. A. Schilling. 1987. Elimination of source a and b errors in p-median location problems. Geographical Analysis 19:95-110.
6. Current, J. R., and D. A. Schilling. 1990. Analysis of errors due to demand aggregation in the set covering and maximal covering location problems. Geographical Analysis 22:116-26.
7. Drysdale R. L., and D.-T. Lee. 1978. Generalized Voronoi diagram in the plane. Proceedings, 16th Annual Allerton Conference on Communications, Control and Computing. 833-42.
8. Egenhofer, M. J., and R. D. Franzosa. 1991. Point-set topological spatial relations. International Journal of Geographical Information Systems 5:161-74.
9. Egenhofer, M. J., and J. Sharma. 1993. Assessing the consistency of complete and incomplete topological information Geographical Systems 1:47-68.
10. Eilon, S., C. D. T. Watson-Gandy, and N. Chrisofides. 1971. Distribution management: Mathematical modeling and practical analysis. London: Griffith.
11. Fotheringham, A. S. 1988. Market share analysis techniques: A review and illustration of current U.S. practice. In N. Wrigley, ed. Store choice, store location and market analysis. London: Routledge, 120-59.
12. Fujishige, S., and P. Zhan. 1992. A dual algorithm for finding a nearest pair of points in two polytopes. Journal of the Operations Research Society of Japan 35:353-65.
13. Goodchild, M. F. 1979. The aggregation problem in location-allocation. Geographical Analysis 11:240-55.
14. Griffith, D. A. 1989. Distance calculations and errors in geographic data-bases. In M. Goodchild and S. Gopa, eds. Accuracy of spatial databases. London: Taylor & Francis, 81-90.
15. Hillsman, E. L., and R. Rhoda. 1978. Errors in measuring distances from populations to service centers. Annals of Regional Science 7(3): 74-88.
16. Imai, T. 1994. SEGVOR reference manual. Tokyo: Department of Mathematical Engineering and Information Physics, University of Tokyo.
17. Koshizuka, T., and O. Kurita. 1991. Approximate formulas of average distances associated with regions and their applications to location problems. Mathematical Programming 52:99-123.
18. Lee, D.T. 1980. Two-dimensional Voronoi diagrams in the Lp-metric. Journal of the Association for Computing Machinery 27:604-18.
19. MacKinnon, R. D., and G. M. Barber. 1972. A new approach to network generation and map representation: The linear case of the location-allocation problem. Geographical Analysis 4:156-68.
20. Morris, J. G., and J. P. Norback. 1980 A simple approach to linear facility location. Transportation Science 14:1-8.
21. Ohya T., M. Iri, and K. Murota. 1984. Improvements of the incremental method for the Voronoi diagram with computational comparison of various algorithms. Journal of Operations Research Society of Japan 27:306-36.
22. Okabe, A., B. Boots, and K. Sugihara. 1992. Spatial tessellations: Concepts and applications of Voronoi diagrams. New York: Wiley.
23. Okabe, A., and F. Miki. 1987. A conditional nearest-neighbor spatial association measure for the analysis of conditional locational interdependence. Environment and Planning A 16:163-71.
24. Openshaw, S. 1991. A spatial analysis research agenda. In I. Masser and M. Blakemore, eds. Handling geographical information: Methodology and potential applications. New York: Longman, 18-37.
25. Peuquet, D. J. 1992. An algorithm for calculating the minimum distance between two geographic features. Computers and Geosciences 18:989-1001.
26. Peuquet, D. J., and Z. Xiang. 1987. An algorithm to determine the directional relationship between arbitrarily-shaped polygons in the plane. Pattern Recognition 20:65-74.
27. Preparata, F. P., and M. I. Shamos. 1985. Computational geometry: An introduction. New York: Wiley.
28. Rodriguez-Bachiller, A. 1983. Errors in the measurement of spatial distances between discrete region. Environment and Planning A 15:781-99.
29. Schwartz, J. T. 1981. Finding the minimum distance between two convex polygons. Information Processing Letters 13:168-70.
30. Stone, R. E. 1991. Some average distance results. Transportation Science 25:83-91.
31. Vaughan, R. 1984. Approximate formulas for average distances associated with zones. Transportation Science 18:231-44.
32. Wilson, R. M. 1990. The average distance between two zones. Geographical Analysis 22:348-51.