Skip to content
Free planNo credit card requiredStart writing

article · 2010

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

Jue Zhang, Zhengwei Sui, Jingnong Weng, X. L. Ji

Cited by 0Abstract and details only

Abstract

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.

Cite this paper

APA 7

Zhang, J., Sui, Z., Weng, J., & Ji, X. L. (2010). A non-recursive algorithm based on the quad-tree when required data missing. https://doi.org/10.1109/geoinformatics.2010.5567499

MLA 9

Zhang, Jue, et al. “A non-recursive algorithm based on the quad-tree when required data missing.” 2010, pp. 1–5, https://doi.org/10.1109/geoinformatics.2010.5567499.

Chicago

Zhang, Jue, Zhengwei Sui, Jingnong Weng, and X. L. Ji. 2010. “A non-recursive algorithm based on the quad-tree when required data missing.” https://doi.org/10.1109/geoinformatics.2010.5567499.

Harvard

Zhang, J. et al. (2010) ‘A non-recursive algorithm based on the quad-tree when required data missing’. Available at: https://doi.org/10.1109/geoinformatics.2010.5567499.

BibTeX
@article{zhang2010recursive,
  title = {{A non-recursive algorithm based on the quad-tree when required data missing}},
  author = {Zhang, Jue and Sui, Zhengwei and Weng, Jingnong and Ji, X. L.},
  pages = {1--5},
  year = {2010},
  doi = {10.1109/geoinformatics.2010.5567499}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.