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.
This work was initiated at the 1st Gremo Workshop on Open Problems (GWOP), held at Hof de Planis, Stels, Switzerland, July 8–11, 2003.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benantar, M., Dogrusöz, U., Flaherty, J.E., Krishnamoorthy, M.S.: Coloring quadtrees (1996) (manuscript)
Benantar, M., Flaherty, J.E., Krishnamoorthy, M.S.: Coloring procedures for finite element computation on shared-memory parallel computers. In: Adaptive, Multilevel, and Hierarchical Computation Strategies, New York. AMD, vol. 157, pp. 435–449 (1992)
Bern, M.W., Eppstein, D., Hutchings, B.: Algorithms for coloring quadtrees. Algorithmica 32(1), 87–94 (2002)
Robertson, N., Sanders, D., Seymour, P., Thomas, R.: The four-colour theorem. J. Combin. Theory Ser. B 70(1), 2–44 (1997)
Samet, H.: The quadtree and related hierarchical data structures. ACM Computing Surveys (CSUR) 16(2), 187–260 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-540-27798-9_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-27798-9_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22856-1
Online ISBN: 978-3-540-27798-9
eBook Packages: Springer Book Archive