@article{48b1dfb0cf7a11dea1f3000ea68e967b,
title = "Maximal independent set graph partitions for representations of body-centered cubic lattices",
abstract = "A maximal independent set graph data structure for a body-centered cubic lattice is presented. Refinement and coarsening operations are defined in terms of set-operations resulting in robust and easy implementation compared to a quad-tree-based implementation. The graph only stores information corresponding to the leaves of a quad-tree thus has a smaller memory foot-print. The adjacency information in the graph relieves one from going up and down the quad-tree when searching for neighbors. This results in constant time complexities for refinement and coarsening operations.",
author = "Kenny Erleben",
year = "2009",
doi = "10.1007/s00371-009-0330-8",
language = "English",
volume = "25",
pages = "423--430",
journal = "Visual Computer",
issn = "0178-2789",
publisher = "Springer",
number = "5-7",
}