Fast Algorithm for Finding Maximum Distance with Space Subdivision in E2
Finding an exact maximum distance of two points in the given set is a fundamental computational problem which is solved in many applications. This paper presents a fast, simple to implement and robust algorithm for finding this maximum distance of two points in E2. This algorithm is based on a polar subdivision followed by division of remaining points into uniform grid. The main idea of the algorithm is to eliminate as many input points as possible before finding the maximum distance. The proposed algorithm gives the significant speed up compared to the standard algorithm.
KeywordsMaximum distance Polar space subdivision Uniform 2D grid Points reduction
- 2.Dobkin, D.P., Snyder, L.: On a general method for maximizing and minimizing among certain geometric problems. In: Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, pp. 9–17 (1979)Google Scholar
- 4.Hilyard, J., Teilhet, S.: C# Cookbook. O’Reilly Media Inc., Sebastopol (2006)Google Scholar
- 8.Skala, V.: Fast Oexpected (N) algorithm for finding exact maximum distance in E2 instead of O (N2) or O (N lgN). In: AIP Conference Proceedings, no. 1558, pp. 2496–2499 (2013)Google Scholar