Given a set of n points in the plane, and a parameter kk, we consider the problem of
computing the minimum (perimeter or area) axis-aligned rectangle enclosing kk points. We …

Given a set of n colored points in IR2 with a total of m (3≤ m≤ n) colors, the problem of
identifying the smallest color-spanning object of some predefined shape is studied in this …

For a set of n points in the plane, we consider the axis-aligned (p, k)-Box Covering problem:
Find p axis-aligned, pairwise-disjoint boxes that together contain at least n− k points. In this …

Abstract The Maximizing Range Sum problem is widely applied in facility locating, spatial
data mining, and clustering problems. The current most efficient method solves it in time O …

We investigate three kinds of optimization problems regarding n points in the 2-dimensional
plane that need to be enclosed by squares.(1) Find a given number of squares that enclose …

ABSTRACT A paper published in 1983 established that the rotating calipers paradigm
provides an elegant, simple, and yet powerful computational tool for solving several …

In this paper a novel and dynamic rectangular roundabout ('rectabout') collision avoidance
method based on human behaviour is presented for multiple, homogeneous, autonomous …

Let $ P $ be a set of $ n $ points in the plane. We show how to find, for a given integer $ k>
0$, the smallest-area axis-parallel rectangle that covers $ k $ points of $ P $ in $ O (nk^ 2\log …

Let P be the point set in two dimensional plane. In this paper, we consider the problem of
locating two isothetic unit squares such that together they cover maximum number of points …

We study the problem of minimum enclosing rectangle with outliers, which asks to find, for a
given set of $ n $ planar points, a rectangle with minimum area that encloses at least $(nt) …