Results

**1 - 1**of**1**### Journal of Emerging Trends in Computing and Information Sciences c©2009-2012 CIS Journal. All rights reserved. Smallest axis-parallel rectangle enclosing at least k points

"... Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identifies 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. ..."

Abstract
- Add to MetaCart

(Show Context)
Let P be a set of n points on a two-dimensional plane. In this work, we present an algorithm that identifies 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.