quadtree

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

From quad- +‎ tree, coined by Raphael Finkel and J. L. Bentley in 1974.[1]

Noun[edit]

quadtree (plural quadtrees)

  1. A treelike data structure each of whose nodes has up to four children, most often used to partition a two-dimensional space by recursively subdividing it.
    • 2015, Benny Bing, Next-Generation Video Coding and Streaming, John Wiley & Sons, →ISBN, page 127:
      H.265 employs a more flexible quadtree structure that refines motion search.

Translations[edit]

See also[edit]

References[edit]

  1. ^ R. A. Finkel, J. L. Bentley (1974) “Quad trees a data structure for retrieval on composite keys”, in Acta Informatica, volume 4, number 1, →DOI, →ISSN, pages 1–9

Further reading[edit]

Anagrams[edit]

Retrieved from "https://en.wiktionary.org/w/index.php?title=quadtree&oldid=73689460"