Region representation: Quadtrees from binary arrays

@article{citeulike:2986174, abstract = {An algorithm is presented for constructing a quadtree from the array representation of a binary image. The algorithm examines each pixel in the image once and only once. In addition, as the tree is constructed, only maximal sized nodes are ever created. Thus the algorithm never requires temporary nodes. The execution time of the algorithm is equal to the number of pixels in the image. The amount of space, in addition to that necessary for the final quadtree, is proportional to the log of the image diameter.}, author = {Samet, Hanan }, citeulike-article-id = {2986174}, doi = {10.1016/0146-664X(80)90118-5}, journal = {Computer Graphics and Image Processing}, keywords = {octree, quadtree}, month = {May}, number = {1}, pages = {88--93}, posted-at = {2008-07-10 23:57:49}, priority = {2}, title = {Region representation: Quadtrees from binary arrays}, url = {http://dx.doi.org/10.1016/0146-664X(80)90118-5}, volume = {13}, year = {1980} }

TY - JOUR ID - citeulike:2986174 L3 - citeulike-article-id:2986174 TI - Region representation: Quadtrees from binary arrays JF - Computer Graphics and Image Processing VL - 13 IS - 1 SP - 88 EP - 93 N2 - An algorithm is presented for constructing a quadtree from the array representation of a binary image. The algorithm examines each pixel in the image once and only once. In addition, as the tree is constructed, only maximal sized nodes are ever created. Thus the algorithm never requires temporary nodes. The execution time of the algorithm is equal to the number of pixels in the image. The amount of space, in addition to that necessary for the final quadtree, is proportional to the log of the image diameter. KW - octree KW - quadtree AU - Samet, Hanan PY - 1980/05// UR - http://dx.doi.org/10.1016/0146-664X(80)90118-5 ER -