期刊名称：American Journal of Computational Mathematics
印刷版ISSN：2161-1203
电子版ISSN：2161-1211
出版年度：2014
卷号：4
期号：3
页码：197-205
DOI：10.4236/ajcm.2014.43016
出版社：Scientific Research Publishing
摘要：Let P be a set of n points in two dimensional plane. For each
point , we locate an axis- parallel unit square having one particular side passing
through p and enclosing the maximum number of points
from P. Considering all
points , such n squares can be reported in O(nlogn) time. We show that this result can be used to
(i) locate m>(2) axis-parallel unit squares which are pairwise
disjoint and they together enclose the maximum number of points from P (if exists) and (ii) find the smallest
axis-parallel square enclosing at least k points of P , .
关键词：Axis-Parallel Unit Square; Sweep Line Algorithm; Maximium Enclosing Problem; K-Enclosing Problem
