Iyengar, S.S.,
Rao, N.S.V.,
Kashyap, R.L.,
Vaishnavi, V.K.,
Multidimensional Data Structures: Review And Outlook, In M.C. Yovits, Ed., Advances In Computers 27, Academic Press, Boston,
MA(XX), 1988, pp. 69-119.
BibRef
O'Rourke, J.,
Uniqueness Of Orthogonal Connect-The-Dots,
CM(88), pp. 97-104.
BibRef
Bonafatti, F.,
Cavazza, L.,
Sect: An Effective Coding Technique For Polygonal Geographic Data,
C&G(12), 1988, pp. 503-513.
BibRef
Samet, H.,
Webber, R.E.,
Hierarchical Data Structures And Algorithms For Computer Graphics,
CGA(8), No. 4, 1988, pp. 59-75.
BibRef
Samet, H.,
Webber, R.E.,
Hierarchical Data Structures And Algorithms For Computer Graphics. Part I: Fundamentals,
CGA(8), No. 5, 1988, pp. 48-68.
BibRef
Kim, S.D.,
Lee, J.H.,
Kim, J.K.,
A New Chain-Coding Algorithm For Binary Images Using Run-Length Codes,
CVGIP(41), 1988, pp. 114-128.
BibRef
Wu, A.Y.,
Bhaskar, S.K.,
Rosenfeld, A.,
Parallel Computation Of Geometric Properties From The Medial Axis Transform,
CVGIP(41), 1988, pp. 323-332.
BibRef
Bhaskar, S.K.,
Rosenfeld, A.,
Wu, A.Y.,
Parallel Processing Of Regions Represented By Linear Quadtrees,
CVGIP(42), 1988, pp. 371-380.
BibRef
Ghosh, P.K.,
A Mathematical Model For Shape Description Using Minkowski Operators,
CVGIP(44), 1988, pp. 239-269.
BibRef
Samet, H.,
Hierarchical Representations Of Collections Of Small Rectangles,
COMPUTING SURVEYS(20), 1988, pp. 271-309.
BibRef
Mathieu, C.,
Puech, C.,
Yahia, H.,
Average Efficiency Of Data Structures For Binary Image Processing,
IPL(26), 1987, pp. 89-93.
BibRef
Wu, A.Y.,
Rosenfeld, A.,
Parallel Processing Of Encoded Bit Strings,
PR(21), 1988, pp. 559-565.
BibRef
Shaffer, C.A.,
A Formula For Computing The Number Of Quadtree Node Fragments Created By A Shift,
PRL(7), 1988, pp. 45-49.
BibRef
Lindenbaum, M.,
Compression Of Chain Codes Using Digital Straight Line Sequences,
PRL(7), 1988, pp. 167-171.
BibRef
Menon, S.,
Gao, P.,
Smith, T.,
Multi-Colored Quadtrees For Gis: Exploiting Bit-Parallelism For Rapid Boolean Overlay,
PRL(8), 1988, pp. 171-179.
BibRef
Biswas, S.N.,
Pal, S.K.,
Dutta Majumder, D.,
Binary Contour Coding Using Bezier Approximation,
PRL(8), 1988, pp. 237-249.
BibRef
Vembar, M.,
Mohan, S.,
Tree Encoding Of Line Drawings,
T-ASSP(36), 1988, pp. 1542-1549.
BibRef
Kim, T.,
Neuhoff, D.L.,
Delta Codes For Line Drawings,
T-IT(34), 1988, pp. 400-416.
BibRef
Fuhrmann, D.R.,
Quadtree Traversal Algorithms For Pointer-Based And Depth-First Representations,
T-PAMI(10), 1988, pp. 955-960.
BibRef
Cheng, Y.,
Iyengar, S.S.,
Kashyap, R.L.,
A New Method Of Image Compression Using Irreducible Covers Of Maximal Rectangles,
T-SE(14), 1988, pp. 651-658.
BibRef
Unnikrishnan, A.,
Shankar, P.,
Venkatesh, Y.V.,
Threaded Linear Hierarchical Quadtrees For Computation Of Geometric Properties Of Binary Images,
T-SE(14), 1988, pp. 659-665.
BibRef
Ponce, J.,
Ribbons, Symmetries, And Skewed Symmetries,
IUW(88), pp. 1074-1079.
BibRef
Mobasseri, B.G.,
Soft-Linked Quadtree: A Cascaded Ring Structure Using Flexible Linkage Concept,
CVPR(88), pp. 622-627.
BibRef
Fan, N.P.,
Li, C.C.,
Computing Quadtree Medial Axis Transform By A Multi-Layered Pyramid Of Lisp-Processor Arrays,
CVPR(88), pp. 628-634.
BibRef
Nakamura, Y.,
Abe, S.,
Ohsawa, Y.,
Sakauchi, M.,
Md-Tree: A Balanced Hierarchical Data Structure For Multi-Dimensional Data With Highly Efficient Dynamic Characteristics,
ICPR(88), pp. 375-378.
BibRef
Chen, C.,
Zou, H.,
Linear Binary Tree,
ICPR(88), pp. 576-578.
BibRef
Punys, J.,
Hierarchical 2d Shape Representation And Compression By Rectangles,
ICPR(88), pp. 675-677.
BibRef
Kawaguchi, E.,
Taniguchi, R.I.,
Coded Df-Expression For Binary And Multi-Valued Picture,
ICPR(88), pp. 1159-1163.
BibRef
Chapter on Rosenfeld Bibliography for 1988 continues in
H.2. Contour approximation .