Efficient measurement of continuous space shortest distance around barriers

There are many different metrics used to estimate proximity between locations. These metrics are good in some situations and not so good in others, depending on permissible movement behavior. A complicating issue for general metrics to accurately reflect proximity is the presence of obstacles and barriers prohibiting certain directions of movement. This paper develops a continuous space-based technique for deriving a guaranteed shortest path between two locations that avoids barriers. The problem is formalized mathematically. A solution approach is presented that relies on geographic information system (GIS) functionality to exploit spatial knowledge, making it accessible for use in various kinds of spatial analyses. Results are presented to illustrate the effectiveness of the solution approach and demonstrate potential for general integration across a range of spatial analysis contexts. The contribution of the paper lies in the formal specification of the problem and an efficient GIS-based solution technique.

[1]  Harold S. Luft,et al.  Correlation of Travel Time on Roads versus Straight Line Distance , 1995, Medical care research and review : MCRR.

[2]  Yunjun Gao,et al.  Continuous obstructed range queries in spatio-temporal databases , 2011, 2011 International Conference on System science, Engineering design and Manufacturing informatization.

[3]  Leonidas J. Guibas,et al.  Visibility of disjoint polygons , 2005, Algorithmica.

[4]  D. Harvey.  The Professional Geographer , 2023, The Professional Geographer.

[5]  Richard L. Church,et al.  Geographical information systems and location science , 2002, Comput. Oper. Res..

[6]  Hans Rohnert,et al.  Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..

[7]  Joseph S. B. Mitchell,et al.  Geometric Shortest Paths and Network Optimization , 2000, Handbook of Computational Geometry.

[8]  Michel Pocchiola,et al.  Minimal Tangent Visibility Graphs , 1996, Comput. Geom..

[9]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[10]  R. Stock.  Distance and the utilization of health facilities in rural Nigeria. , 1983, Social science & medicine.

[11]  Deok-Soo Kim,et al.  Shortest Paths for Disc Obstacles , 2004, ICCSA.

[12]  K. Klamroth.  Planar weber location problems with line barriers , 2001 .

[13]  Richard L. Church,et al.  Business Site Selection, Location Analysis and GIS , 2008 .

[14]  Pierre Hansen,et al.  Finding shortest paths in the plane in the presence of barriers to travel (for any lp - norm) , 1985 .

[15]  Trevor C. Bailey,et al.  Interactive Spatial Data Analysis , 1995 .

[16]  Sergio J. Rey,et al.  Perspectives on Spatial Data Analysis , 2010 .

[17]  Richard C. Larson,et al.  Facility Locations with the Manhattan Metric in the Presence of Barriers to Travel , 1983, Oper. Res..

[18]  Subhash Suri,et al.  Efficient computation of Euclidean shortest paths in the plane , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[19]  David J. Martin,et al.  Increasing the sophistication of access measurement in a rural healthcare study. , 2002, Health & place.

[20]  M. Charlton,et al.  Quantitative geography : perspectives on spatial data analysis by , 2001 .

[21]  Alan T. Murray,et al.  Surrogate Markers of Transport Distance for Out-of-Hospital Cardiac Arrest Patients , 2012, Prehospital emergency care : official journal of the National Association of EMS Physicians and the National Association of State EMS Directors.

[22]  Leonidas J. Guibas,et al.  Optimal shortest path queries in a simple polygon , 1987, SCG '87.

[23]  Rajan Batta,et al.  Locating Facilities on the Manhattan Metric with Arbitrarily Shaped Barriers and Convex Forbidden Regions , 1989, Transp. Sci..

[24]  Stephen G. Jones,et al.  Spatial implications associated with using Euclidean distance measurements and geographic centroid imputation in health care research. , 2010, Health services research.

[25]  D. Fone,et al.  Comparison of perceived and modelled geographical access to accident and emergency departments: a cross-sectional analysis from the Caerphilly Health and Social Needs Study , 2006, International journal of health geographics.

[26]  Mengjie Han,et al.  Does Euclidean distance work well when the p-median model is applied in rural areas? , 2012, Ann. Oper. Res..

[27]  Alan T. Murray,et al.  Geographic influences on sexual and reproductive health service utilization in rural Mozambique. , 2012, Applied geography.

[28]  Kathrin Klamroth,et al.  An efficient solution method for Weber problems with barriers based on genetic algorithms , 2007, Eur. J. Oper. Res..

[29]  M. J. Hodgson,et al.  Spatial Accessibility to Health Care Facilities in Suhum District, Ghana , 1994 .

[30]  David J. Martin,et al.  Geographical aspects of the uptake of renal replacement therapy in England , 1998 .

[31]  Gary Higgs,et al.  The role of GIS for health utilization studies: literature review , 2009, Health Services and Outcomes Research Methodology.

[32]  Emo WELZL,et al.  Constructing the Visibility Graph for n-Line Segments in O(n²) Time , 1985, Inf. Process. Lett..

[33]  David O'Sullivan,et al.  Geographic Information Analysis , 2002 .

[34]  Alan T. Murray.  Advances in location modeling: GIS linkages and contributions , 2010, J. Geogr. Syst..

[35]  L. Cooper,et al.  Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle , 1981 .

[36]  David M. Mount,et al.  An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.

[37]  Kyriakos Mouratidis,et al.  Query processing in spatial databases containing obstacles , 2005, Int. J. Geogr. Inf. Sci..

[38]  Paul Roderick,et al.  International Journal of Health Geographics Open Access Distance, Rurality and the Need for Care: Access to Health Services in South West England , 2022 .

[39]  Gang Chen,et al.  On efficient obstructed reverse nearest neighbor query processing , 2011, GIS.

[40]  Subhash Suri,et al.  An Optimal Algorithm for Euclidean Shortest Paths in the Plane , 1999, SIAM J. Comput..

[41]  D. T. Lee,et al.  A New Approach for the Geodesic Voronoi Diagram of Points in a Simple Polygon and Other Restricted Polygonal Domains , 1998, Algorithmica.

[42]  Kathrin Klamroth,et al.  A reduction result for location problems with polyhedral barriers , 2001, Eur. J. Oper. Res..

[43]  David M. Mount,et al.  An output sensitive algorithm for computing visibility graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[44]  Mahmut Parlar,et al.  Technical Note - Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel , 1994, Transp. Sci..

[45]  Joseph S. B. Mitchell,et al.  Shortest paths among obstacles in the plane , 1993, SCG '93.

[46]  Manfred M. Fischer,et al.  Recent Developments in Spatial Analysis , 1997 .

[47]  Michael J de Smith,et al.  Geospatial Analysis: A Comprehensive Guide to Principles, Techniques and Software Tools , 2007 .

[48]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.