In this paper, we give a short survey on discrete geometry on red and blue points in the
plane, most of whose results were obtained in the past decade. We consider balanced …

In this paper we consider the following embedding problem. A point set P in the plane in
general position is partitioned into two disjoint sets R and B, and we are asked to embed a …

Let S be a bicolored set of n points in the plane. A subset I of S is an island if there is a
convex set C such that I= C∩ S. We give an O (n3)-time algorithm to compute a …

Once upon a time, around the 1970's, Computational Geometry was born. Some people in
the community establish that the father was M. Shamos with his Ph. D. thesis at Yale …

Let X and Y be two disjoint sets of points in the plane such that| X|=| Y| and no three points of
X∪ Y are on the same line. Then we can draw an alternating Hamilton cycle on X∪ Y in the …

Let R and B be two sets of points such that the points of R are colored red and the points of B
are colored blue. Let G be a planar graph such that| R| vertices of G are red and| B| vertices …

Dados R y B, conjuntos disjuntos de puntos en el plano (puntos rojos y azules
respectivamente), un camino alternante es un camino sin cortes que une alternativamente …

An address generation and optimization environment (ADOPT) for distributed memory
architectures, is presented. ADOPT is oriented to minimize the area overhead introduced by …

Let S be a finite set of points in the plane in general position such that each point of S is
colored red or blue. In this paper, we solve the following problem: find two geometric …

In this paper, we study the problem of computing a geometric embedding of a tree onto a
point set in the Euclidean plane such that the total edge length of the embedding is …