Title :
K-enclosing square or rectangle problem revisited
Author :
Mahapatra, Priya Ranjan Sinha
Author_Institution :
Dept. of Comput. Sci. & Eng., Univ. of Kalyani, Kalyani, India
Abstract :
Given a set P of n points in two dimensional plane. In this paper we study the minimum enclosing square problem. First an O(n log2 n) time and linear space algorithm is proposed to locate a minimum enclosing axis-parallel square that encloses at least k (1 ≤ k ≤ n) points of P. Then this algorithm is extended to find a minimum enclosing axis parallel square for large values of k (k >; k/2) in O(n+(n-k) log2(n-k)) using O(n) space. These algorithms can also be used to solve the minimum enclosing rectangle problem.
Keywords :
computational complexity; computational geometry; minimisation; K-enclosing rectangle problem; K-enclosing square problem; axis-parallel square; linear space algorithm; minimum enclosing square problem; Algorithm design and analysis; Arrays; Clustering algorithms; Computational geometry; Computers; Operations research; Optimization; Computational Geometry; Covering Location Problem; Enclosing problem; Facility Location; Maximum Covering Location Problem; Optimization Technique;
Conference_Titel :
Electronics Computer Technology (ICECT), 2011 3rd International Conference on
Conference_Location :
Kanyakumari
Print_ISBN :
978-1-4244-8678-6
Electronic_ISBN :
978-1-4244-8679-3
DOI :
10.1109/ICECTECH.2011.5941652
