A Distance Measuring Algorithm for Location Analysis
Ruilin Ouyang, Dinghao Ma, M. S. Morshed, Md. Noor-E-Alam

TL;DR
This paper introduces a novel algorithm to accurately estimate distances between two irregular, concave regions in facility location problems, addressing a gap in existing methods.
Contribution
The work presents a new algorithm specifically designed for distance estimation between concave regions, with analysis of its properties and practical testing.
Findings
Effective in estimating distances between concave regions
Applicable to facility location problems with irregular shapes
Provides insights into geometric properties of the algorithm
Abstract
Approximating distance is one of the key challenge in a facility location problem. Several algorithms have been proposed, however, none of them focused on estimating distance between two concave regions. In this work, we present an algorithm to estimate the distance between two irregular regions of a facility location problem. The proposed algorithm can identify the distance between concave shape regions. We also discuss some relevant properties of the proposed algorithm. A distance-sensitive capacity location model is introduced to test the algorithm. Moreover, sSeveral special geometric cases are discussed to show the advantages and insights of the algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFacility Location and Emergency Management · Computational Geometry and Mesh Generation · Data Management and Algorithms
