Location of Repository

Polychromatic Colorings of n-dimensional Guillotine-Partitions

By Balázs Keszegh

Abstract

A strong hyperbox-respecting coloring of an n-dimensional hyperbox partition is a coloring of the corners of its hyperboxes with 2 n colors such that any hyperbox has all the colors appearing on its corners. A guillotine-partition is obtained by starting with a single axis-parallel hyperbox and recursively cutting a hyperbox of the partition into two hyperboxes by a hyperplane orthogonal to one of the n axes. We prove that there is a strong hyperbox-respecting coloring of any n-dimensional guillotine-partition. This theorem generalizes the result of Horev et al. [8] who proved the 2-dimensional case. This problem is a special case of the n-dimensional variant of polychromatic colorings. The proof gives an efficient coloring algorithm as well

Year: 2008
OAI identifier: oai:CiteSeerX.psu:10.1.1.189.5374
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.renyi.hu/%7Ekeszegh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.