Patent ID: 6526176
Filing Date: 2003-02-25
Classification: G06T

Abstract:
A method for processing data having a quadtree topology comprising the steps of:storing the data in memory, indexed for children nodes of a node to carry the indices 4p+i, where p is the index of said node, and i=1,2,3,4, and where the indices are assigned in a z-ordering of a first type, and where each child of said node, when such child, having an index pâ€², has its own children, which are grandchildren nodes of said node, has said grandchildren indexed to carry the indices 4pâ€²+j where j=1,2,3,4, where said indices of said grandchildren are assigned in a z-ordering of a second type; and traversing from one node of said quadtree to a destination node of said quadtree with a process that includes a single computation session that develops an index of said destination node, followed by an access to said data in said memory corresponding to said index of said destination node.