A Model for the Analysis of Neighbor Finding in Pointer-Based Quadtrees
暂无分享,去创建一个
[1] Hanan Samet,et al. A Top-Down Quadtree Traversal Algorithm , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[2] Richard J. Lipton,et al. Preserving average proximity in arrays , 1978, CACM.
[3] Azriel Rosenfeld,et al. Region representation: boundary codes from quadtrees , 1980, CACM.
[4] Hanan Samet,et al. Neighbor finding techniques for images represented by quadtrees , 1982, Comput. Graph. Image Process..
[5] Azriel Rosenfeld,et al. Quadtree region representation in cartography: Experimental results , 1983, IEEE Transactions on Systems, Man, and Cybernetics.
[6] Hanan Samet,et al. Connected Component Labeling Using Quadtrees , 1981, JACM.
[7] Allen Klinger,et al. PATTERNS AND SEARCH STATISTICS , 1971 .
[8] Hanan Samet,et al. The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.
[9] Kenneth Steiglitz,et al. Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[10] Hanan Samet,et al. Region representation: quadtrees from boundary codes , 1980, CACM.
[11] Michael L. Rhodes,et al. Organization and Access of Image Data by Areas , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[12] Steven L. Tanimoto,et al. Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.