CCCG
2010
13 years 7 months ago
2010
A planar point set S is an (i, t) set of ghost chimneys if there exist lines H0, H1, . . . , Ht-1 such that the orthogonal projection of S onto Hj consists of exactly i + j distin...
CCCG
2010
13 years 7 months ago
2010
Do convex obstacles in the plane always leave 3 separate escape routes? Here, an escape route is a locally geodesic path that avoids the obstacles; escape routes are separate if t...
CCCG
2010
13 years 7 months ago
2010
In this paper we consider a wireless network, where each transceiver is equipped with a directional antenna, and study two direction assignment problems, determined by the type of...
CCCG
2010
13 years 7 months ago
2010
Three types of geometric structure--grid triangulations, rectangular subdivisions, and orthogonal polyhedra-can each be described combinatorially by a regular labeling: an assignm...
CCCG
2010
13 years 7 months ago
2010
In this paper we study polygonal transformations through an operation called deflation. It is known that some families of polygons deflate infinitely for given deflation sequences...
CCCG
2010
13 years 7 months ago
2010
Given a set R of red points and a set B of blue points in the plane of total size n, we study the problem of determining all angles for which there exists an L-shape containing al...
CCCG
2010
13 years 7 months ago
2010
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...
CCCG
2010
13 years 7 months ago
2010
CCCG
2010
13 years 7 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
CCCG
2010
13 years 7 months ago
2010
A watchman tour in a polygonal domain (for short, polygon) is a closed curve such that every point in the polygon is visible from at least one point of the tour. The problem of fin...