A non-recursive algorithm based on the quad-tree when required data missing

This paper mainly focuses on non-recursive algorithm on the base of the quad-tree for the situation that some data is missing during real-time visualization of massive multiplex dataset. This study introduces different kinds of basic data structures, including wait-static, wait-queue, main-static, missing-static and missing-queue. Upper level of the missing data can be found because of controllability of non-recursive algorithm and coordination between stacks and queues. The result of experiments shows that non-recursive algorithm is more efficient than recursive algorithm in solving the problem of data missing.