Coloring Octrees

  • Udo Adamy
  • Michael Hoffmann
  • József Solymosi
  • Miloš Stojaković
Conference paper

DOI: 10.1007/978-3-540-27798-9_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3106)
Cite this paper as:
Adamy U., Hoffmann M., Solymosi J., Stojaković M. (2004) Coloring Octrees. In: Chwa KY., Munro J.I.J. (eds) Computing and Combinatorics. COCOON 2004. Lecture Notes in Computer Science, vol 3106. Springer, Berlin, Heidelberg

Abstract

An octree is a recursive partition of the unit cube, such that in each step a cube is subdivided into eight smaller cubes. Those cubes that are not further subdivided are the leaves of the octree. We consider the problem of coloring the leaves of an octree using as few colors as possible such that no two of them get the same color if they share a face. It turns out that the number of colors needed depends on a parameter that we call unbalancedness. Roughly speaking, this parameter measures how much adjacent cubes differ in size. For most values of this parameter we give tight bounds on the minimum number of colors, and extend the results to higher dimensions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Udo Adamy
    • 1
  • Michael Hoffmann
    • 1
  • József Solymosi
    • 2
  • Miloš Stojaković
    • 1
  1. 1.Institute of Theoretical Computer ScienceETH ZurichZurichSwitzerland
  2. 2.Department of MathematicsUniversity of British ColumbiaVancouverCanada

Personalised recommendations