Nearest neighbourhood operations with generalized voronoi diagrams: A review

International Journal of Geographical Information Systems

Volumn 8, Issue 1, 1994, Pages 43-71

  Okabe, Atsuyuki ^a   Boots, Barry ^b   Sugihara, Kok1chi ^a  

^a UNIVERSITY OF TOKYO   (Japan)

^b WILFRID LAURIER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GENERALISATION; GIS; NEIGHBOURHOOD; VORONOI DIAGRAM;

EID: 0028259669     PISSN: 02693798     EISSN: None     Source Type: Journal    
DOI: 10.1080/02693799408901986     Document Type: Article

References (62)

1. Abler, R. F, 1987, The National Science Foundation National Center for Geographic Information and Analysis. International Journal of Geographical Information Systems, 1, 303-326.
2. Aronov, B, 1987, On the geodesic Voronoi diagram of point sites in a simple polygon. Proceedings of the ACM Symposium on Computational Geometry, Waterloo, Ontario (New York: Association for Computing Machinery), 39-49.
3. Asano, T, and Asano, T, 1987, Voronoi diagram of points in a simple polygon. In Discrete Algorithms and Complexity, Perspectives in Computing, edited by D. S. Johnson, T. Nishizeki and H. S. Wilf, Volume 15 (New York: Academic Press), pp. 51-64.
4. Ash, P. F., and Bolker, E. D., 1985, Recognizing Dirichlet tessellations. Geometriae Dedicata, 20, 209-243.
5. Aurenhammer, F., 1987, Power diagrams: properties, algorithms and applications. SIAM Journal of Computing, 16, 78-96.
6. Aurenhammer, F, 1988, Voronoi diagrams-a survey. Institute for Information Processing, Technical University of Graz, Report 236.
7. Aurenhammer, F, 1992, Voronoi diagrams-A survey of a fundamental geometric data structure. ACM Computing Surveys, 23, 345-405.
8. Aurenhammer, F., and Edelsbrunner, H, 1984, An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition, 17, 251-257.
9. Bentley, J. L., and Maurer, H. A, 1979, A note on Euclidean near neighbour searching in the plane. Information Processing Letters, 8, 133-136.
10. Brown, K. Q., 1980, Geometric Transformations for Fast Geometric Algorithms. Ph.D. thesis, Report CMU-CS-80-101, Carnegie-Mellon University, Pittsburgh, Pennsylvania.
11. Carter, G. M, Chaiken, J. M, and Ignall, E, 1972, Response areas for two emergency units. Operations Research, 20, 571-594.
12. Chazelle, B, Cole, R, Preparata, F. P, and Yap, C. K, 1986, New bounds for neighbour searching. Information and Control, 68, 105-124.
13. Chezelle, B, and Guibas, L. J, 1985, Visibility and intersection problems in plane geometry. Proceedings of the ACM Symposium on Computational Geometry, Baltimore, Maryland (New York: Association of Computing Machinery), pp. 135-146.
14. Dehne, F, and Klein, R, 1987, An optimal algorithm for computing the Voronoi diagram on a cone. Report SCS-TR-122, School of Computer Science, Carleton University, Ottawa, Canada.
15. Drysdale, R. L., 1979, Generalized Voronoi Diagrams and Geometric Search. Unpublished Ph.D. Thesis, Department of Computer Science, Stanford University.
16. Drysdale, R. L, and Lee, D-T, 1978, Generalized Voronoi diagrams in the plane. Proceedings of the I6th Annual Allerton Conference on Communications, Control and Computing, pp. 833-842.
17. Edelsbrunner, H, 1987, Algorithms in Computational Geometry (Berlin: Springer-Veriag).
18. ELGINDY, H. A., and Avis, D, 1981, A linear algorithm for computing the visibility polygon from a point. Journal of Algorithms, 2, 186-197.
19. Fisher, M. M, and Nijkamp, P, 1992, Editorial. Annals of Regional Science, 26, 1.
20. Ford, L. K., and Fulkerson, D. K., 1962, Flows in Networks (Princeton: Princeton University Press).
21. Goodchild, M., 1987, A spatial analytical perspective on geographical information systems. International Journal of Geographical Information Systems, 1, 327-334.
22. Hanjoul, P., Beguin, H, and Thill, J.-C., 1989, Advances in the theory of market areas. Geographical Analysis, 221, 185-196.
23. HWANG, F. K, 1979, An O(n log n) algorithm for rectilinear minimal spanning trees. Journal of the Association of Computing Machinery, 26, 177-182.
24. Imai, H., Asano, T., and Asano, T., 1985(a), Visibility of disjoint polygons. Research Memorandum RMI 85-02, Department of Mathematical Engineering and Instrumentation Physics, University of Tokyo.
25. Imai, H, Iri, M, and Murota, K, 1985, Voronoi diagram in the Laguerre geometry and its applications, SIAM Journal of Computing, 14, 93-105.
26. Kokubo, I., 1985, Computational Methods of Generalized Voronoi Diagrams. Unpublished Master’s thesis, Department of Mathematical Engineering and Information Physics, University of Tokyo (in Japanese).
27. Kirkpatrick, D. G., 1979, Efficient computation of continuous skeletons. Proceedings of the 20th Annual I.E.E.E. Symposium on Foundations of Computer Science (Los Alamitos, CA: 1. E.E.E. Computer Society Press), pp. 18-27.
28. Klein, R., 1988, Abstract Voronoi diagrams and their applications. Lecture Notes in Computer Science, 333 (Berlin: Springer-Verlag), pp. 148-157.
29. Klein, R., and Wood, D., 1989, Voronoi diagrams based on general metrics in the plane. Lecture Notes in Computer Science (Berlin: Springer-Verlag), 281-291.
30. Lee, D-T., 1980, Two-dimensional Voronoi diagrams in Lp-metric. Journal of the Association for Computing Machinery, 27, 604-618.
31. Lee, D.-T., 1982, On k-nearest neighbor Voronoi diagrams in the plane. I.E.E.E. Transactions on Pattern Analysis and Machine Intelligence, 4, 363-369.
32. Lee, D.-T., 1983, Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing, 2, 207-211.
33. Lee, D.-T., and Chen, L. M., 1985, Display of visible edges of a set of convex polygons. In Computational Geometry, editor G. T. Toussaint (Amsterdam: North Holland), pp. 249-266.
34. Lee, D.-T., and Drysdale, R. L., 1981, Generalization of Voronoi diagrams in the plane. SIAM Journal of Computing, 10, 73-87.
35. Lee, D.-T., and Wong, C. K., 1980, Voronoi diagrams in L1, (Lm) metrics with-2-dimensional storage applications. SIAM Journal of Computing, 9, 200-211.
36. Luka tela, H., 1987, Hipparchus geopositioning model: an overview. Auto Carto 8, Proceedings of the 8th International Symposium on Computer-Assisted Cartography, Baltimore, Maryland (Falls Church, VA: American Society for Photogrammetry and Remote Sensing and American Congress on Surveying and Mapping), pp. 87-96.
37. Masser, I., 1988, The regional research laboratory initiative. A progress report. International Journal of Geographical Information Systems, 2, 11-22.
38. Miles, R. E., 1970, On the homogeneous planar Poisson point process. Mathematical Biosciences„ 6, 85-127.
39. Miles, R. E., 1971, Random points, sets and tessellations on the surface of sphere. Sankhaya, Series A, 33, 145-174.
40. Miles, R. E., and Maillardet, R. J., 1982, The basic structures of Voronoi and generalized Voronoi polygons. Journal of Applied Probability, 19A, 97-111.
41. Mount, D. M., 1985, Voronoi Diagram on the Surface of a Polyhedron, Report 1496, University of Maryland.
42. NCGIA, 1989, The research plan of the National Center for Geographic Information and Analysis. International Journal of Geographical Information Systems, 3, 117-136.
43. Okade, A., and Miki, F., 1984, A conditional nearest-neighbour spatial association measure for the analysis of conditional locational interdependence. Environment and Planning A, 16, 163-171.
44. Okaije, A., Boots, B., and Sugihara, K., 1992, Spatial Tessellations: Concepts and Applications of Voronoi Diagrams (Chichester: John Wiley).
45. Okahe, A., Yoshikawa, T., Fujii, A., and Oikawa, K., 1988, The statistical analysis of a distribution of activity points in relation to surface-like elements. Environment and Planning A, 20, 609-620.
46. Openshaw, S., 1987, An automated geographical analysis system. Environment and Planning A, 19, 431-436.
47. Paschinger, I., 1982, Konvex Polytope und Dirichiletsche Zellenkomplexe, Unpublished Dissertation. Insitut fur Mathematik, University of Salzburg, Austria.
48. Preparata, F. P., and Shamos, M, I, 1985, Computational Geometry-An Introduction (New York: Springer-Verlag).
49. SEOUNG, Y. M., and Asano, T., 1987, Facility location problems with obstacles. Proceedings of the 1987 Joint Technical Conference on Circuits and Systems (JTC-CAS'87) (Tokyo: I.E.I.C.E.), pp. 237-242.
50. Shamos, M. I., 1978 Computational Geometry, Unpublished Ph.D. Thesis, Yale University.
51. Shamos, M. I., and Hoey, D., 1975, Closest-point problems. Proceedings of the 16th Annual I.E.E.E. Symposium on Foundations of Computer Science (Los Alamitos, CA: I.E.E.E. Computer Society Press), pp. 151-162.
52. Sharir, M., 1985, Intersection and closest-pair problems for a set of planar discs. SIAM Journal of Computing, 14, 448-468.
53. Sharir, M., and Baltsam, A., 1986, On shortest paths a mist convex polyhedra. Proceedings of the 2nd Annual ACM Symposium on Computational Geometry, Yorktown Heights, New York (New York: A.C.M.), 193-206.
54. Sharir, M., and Schorr, A, 1984, On shortest paths in polyhedral spaces, The 16th ACM Symposium of Theory and Computing (New York: C.A.M.), 144-153.
55. Sibson, R, 1980, A vector identity for the Dirichlet tessellation. Mathematical Proceedings of the Cambridge Philosophical Society, 87, 151-155.
56. Star, J, and Estes, J., 1990, Geographic Information Systems: An Introduction (Englewood: Prentice-Hall).
57. SuGihara, K, 1992, Voronoi diagrams in a river. Internationa! Journal of Computational Geometry and Applications, 2, 29-48.
58. Sugihara, K, and Iri, M, 1992, Construction of the Voronoi diagram for ‘one million' generators in single-precision arithmetic. Proceedings of the I.E.E.E. (New York, NY: I. E.E.E, Headquarters), 80, 1471-1484.
59. Thikssen, A. H., 1911, Precipitation averages for large areas. Monthly Weather Review, 39,1082-1084.
60. Voronoi, G, 1908, Nouvelles applications des parametres continus a la theorie des formes quadratiques, deuxieme memoire, recherches sur les paraltelloedres primitifs. Journal fur die Reine und Angewandte Methematik, 134, 198-287.
61. Yap, C. K, 1987, An O(nlogn) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Computational Geometry, 2, 365-393.
62. Yomono, H, 1991, Voronoi Diagram on a Network. Technical Report, 91-09-02, Toshiba Advanced Systems Co. Tokyo (in Japanese).