One small step for a man
One Giant leap for the mankind

There is no wealth like Knowledge
                            No Poverty like Ignorance
Journal of Emerging Trends in Computing and Information Sciences Logo

Journal of Emerging Trends in Computing and Information Sciences >> Call for Papers Vol. 8 No. 3, March 2017

Journal of Emerging Trends in Computing and Information Sciences

Smallest axis-parallel rectangle enclosing at least k points

Full Text Pdf Pdf
Author Priya Ranjan Sinha Mahapatra
ISSN 2079-8407
On Pages 1003-1007
Volume No. 3
Issue No. 6
Issue Date June 01, 2012
Publishing Date June 01, 2012
Keywords Enclosing Problem, k-Enclosing Problem, Optimization Problem, Decision Problem


Abstract

Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identi es a smallest area axis-parallel rectangle enclosing at least k points of P (1 < k  n). The worst case time and space complexities of the algorithm are O(n4) and O(n2) respectively.  

Back

Seperator
    Journal of Computing | Call for Papers (CFP) | Journal Blog | Journal of Systems and Software | ARPN Journal of Science and Technology | International Journal of Health and Medical Sciences | International Journal of Economics, Finance and Management     
Copyrights
© 2015 Journal of Computing