Algorithms for Coloring Quadtrees
David Eppstein, Marshall W. Bern, Brad Hutchings
Abstract
We describe simple linear time algorithms for coloring the squares of balanced and unbalanced quadtrees so that no two adjacent squares are given the same color. If squares sharing sides are defined as adjacent, we color balanced quadtrees with three colors, and unbalanced quadtrees with four colors; these results are both tight, as some quadtrees require this many colors. If squares sharing corners are defined as adjacent, we color balanced or unbalanced quadtrees with six colors; for some quadtrees, at least five colors are required.
Create a lesson
Related papers
Numerical Simulation of Transdermal Insulin Delivery Using a Coated Microneedle in a 2D Skin Model
Milana Tesfamarian, Michael Heisig, Gabriel Wittum et al.
Multi-Stage NeRF for Efficient 3D Coronary Artery Reconstruction from Two Narrow-Angle Angiographic Projections
Deyu Meng, Mojtaba Lashgari, Yiying Wang et al.
Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons
Shouvik Mondal, Udvas Das, Sasanka Roy
Low-Dimensional Embeddings for Gaussian Kernels on Manifolds
Soumik Dutta, Kunal Dutta
Flip Graphs for Eight Points in Three Dimensions Are Connected
Marc Khoury
Computing the minimal perimeter polygon for digital objects in the triangular tiling
Petra Wiederhold