Display options
Cite
Mark DM, Abel DJ. Linear quadtrees from vector representations of polygons. IEEE Trans Pattern Anal Mach Intell. 1985;7(3):344-9doi: 10.1109/tpami.1985.4767664.
Mark, D. M., & Abel, D. J. (1985). Linear quadtrees from vector representations of polygons. IEEE transactions on pattern analysis and machine intelligence, 7(3), 344-9. https://doi.org/10.1109/tpami.1985.4767664
Mark, D M, and Abel, D J. "Linear quadtrees from vector representations of polygons." IEEE transactions on pattern analysis and machine intelligence vol. 7,3 (1985): 344-9. doi: https://doi.org/10.1109/tpami.1985.4767664
Mark DM, Abel DJ. Linear quadtrees from vector representations of polygons. IEEE Trans Pattern Anal Mach Intell. 1985 Mar;7(3):344-9. doi: 10.1109/tpami.1985.4767664. PMID: 21869270.
Copy Download .nbib Format: NLM
Share it on

IEEE Trans Pattern Anal Mach Intell. 1985 Mar;7(3):344-9. doi: 10.1109/tpami.1985.4767664.

Linear quadtrees from vector representations of polygons.

IEEE transactions on pattern analysis and machine intelligence

D M Mark, D J Abel

Affiliations

  1. Visiting Scientist, CSIRO Division of Computing Research; Department of Geography, State University of New York, Buffalo, NY 14260.

PMID: 21869270 DOI: 10.1109/tpami.1985.4767664

Abstract

A new algorithm is presented which produces various forms of linear quadtrees directly from a vector representation of a polygon. This algorithm takes advantage of specific properties of linear quadtrees and associated linear keys to infer the colors of all parts of the region not cut by the polygon boundary. The method is further extended to multicolored (rather than binary) linear quadtrees which may be useful in geographic information systems applications.

Publication Types