This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Linear Quadtrees from Vector Representations of Polygons
March 1985 (vol. 7 no. 3)
pp. 344-349
David M. Mark, Visiting Scientist, CSIRO Division of Computing Research; Department of Geography, State University of New York, Buffalo, NY 14260.
David J. Abel, CSIRO Division of Computing Research, Davies Laboratory, Queensland 4814, Australia.
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.
Citation:
David M. Mark, David J. Abel, "Linear Quadtrees from Vector Representations of Polygons," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 7, no. 3, pp. 344-349, March 1985, doi:10.1109/TPAMI.1985.4767664
Usage of this product signifies your acceptance of the Terms of Use.