17 search results - page 2 / 4 » Coloring axis-parallel rectangles |
JCT
2010
13 years 3 months ago
2010
For every k and r, we construct a finite family of axis-parallel rectangles in the plane such that no matter how we color them with k colors, there exists a point covered by prec...
CG
2006
Springer
13 years 5 months ago
2006
Springer
On the classical discrete grid, the analysis of digital straight lines (DSL for short) has been intensively studied for nearly half a century. In this article, we are interested i...
ESA
2001
Springer
13 years 9 months ago
2001
Springer
Motivated by questions in location planning, we show for a set of colored point sites in the plane how to compute the smallest— by perimeter or area—axis-parallel rectangle and...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We explore the complexity of computing tilings of orthogonal polygons using colored dominoes. A colored domino is a rotatable 2 × 1 rectangle that is partitioned into two unit squ...
DM
2010
13 years 5 months ago
2010
A general (rectangular) partition is a partition of a rectangle into an arbitrary number of non-overlapping subrectangles. This paper examines vertex colorings using four colors o...