We study broadcasting of information in a system of moving agents equipped with omnidirectional
as well as directional antenna. The agent communication protocol is inspired by the …

Given a set of n non-intersecting line segments L and a set Q of m points in R 2 ; we present
algorithms of the discrete two-center problem for (i) covering, (ii) stabbing and (iii) hitting the …

We study the Generalized Red-Blue Annulus Cover problem for two sets of points, red (R)
and blue (B). Each point p ∈ R ∪ B \documentclass[12pt]{minimal} \usepackage{amsmath} \…

This paper discusses the problem of covering and hitting a set of line segments L in R 2 by
a pair of axis-parallel congruent squares of minimum size. We also discuss the restricted …

In this paper, we consider the dynamic version of covering the convex hull of a point set P in
R2 by two congruent disks of minimum size. Here, the points can be added or deleted in the …

Given a set of colored geometric objects, a color spanning region of a desired shape is a
region (of that shape) that contains at least one object of each color. Here, the objective is to …

In this paper we have designed a randomized algorithm to generate a random polygon P
from a given set S={p 1 , p 2 ,. . ., p n } of n points lying on a two dimensional plane. As a …

We study the Generalized Red-Blue Annulus Cover problem for two sets of points, red ($R$)
and blue ($B$), where each point $p \in R\cup B$ is associated with a positive penalty ${\…

The convex layers of a given point set can be computed by iterative process of finding convex
hull after discarding the points of already computed convex hull. Computation of convex …

A heuristic ‘GRP_CH’ has been proposed to generate a random simple polygon from a given
set of ‘n’ points in 2-Dimensional plane. The “2-Opt Move” heuristic with time complexity $\…