Open AccessClosest Pair Algorithms in 2D space,a commentary on complexity and reductions
Author(s) -
Anand Sunder,
AUTHOR_ID
Publication year - 2022
Publication title -
international journal of mathematics and computer research
Language(s) - English
Resource type - Journals
ISSN - 2320-7167
DOI - 10.47191/ijmcr/v10i1.03
Subject(s) - divide and conquer algorithms , rectangle , algorithm , class (philosophy) , computational complexity theory , set (abstract data type) , computational geometry , computer science , combinatorics , mathematics , space (punctuation) , theoretical computer science , geometry , artificial intelligence , programming language , operating system
One of the most challenging problems in computational geometry is closest pair of points given n points. Brute force algorithms[1] and Divide and conquer[1] have been verified and the lowest complexity of attributed to latter class of algorithms, with worst case being for the former being . We propose a method of partitioning the set of n-points based on the least area rectangle that can circumscribe these points