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.
| Original language | English |
|---|---|
| Journal | Visual Computer |
| Volume | 25 |
| Issue number | 5-7 |
| Pages (from-to) | 423-430 |
| Number of pages | 8 |
| ISSN | 0178-2789 |
| DOIs | |
| Publication status | Published - 2009 |