Samet, H.,
The Design And Analysis Of Spatial Data Structures, Addison-Wesley, Reading,
MA(89), pp. 1990.
BibRef
Samet, H.,
Applications Of Spatial Data Structures, Addison-Wesley, Reading,
MA(89), pp. 1990.
BibRef
Gao, P.,
Smith, T.R.,
Space Efficient Hierarchical Structures: Relatively Addressed Compact Quadtrees For Giss,
IVC(7), 1989, pp. 173-177.
BibRef
Kiem, H.,
Khoi, P.N.,
Space Efficiency Analysis Of Some Methods Of Image Representation,
J. NEW GENERATION COMPUTING SYSTEMS(1), 1988, pp. 353-359.
BibRef
Hung, Y.,
Rosenfeld, A.,
Parallel Processing Of Linear Quadtrees On A Mesh-Connected Computer,
JPDC(7), 1989, pp. 1-27.
BibRef
Krzyzak, A.,
Leung, S.Y.,
Suen, C.Y.,
Reconstruction Of Two-Dimensional Patterns From Fourier Descriptors,
MVA(2), 1989, pp. 123-140.
BibRef
Wu, A.Y.,
Bhaskar, S.K.,
Rosenfeld, A.,
Parallel Processing Of Region Boundaries,
PR(22), 1989, pp. 165-172.
BibRef
Kiryati, N.,
Maydan, D.,
Calculating Geometric Properties From Fourier Representation,
PR(22), 1989, pp. 469-475.
BibRef
Webber, R.E.,
Dillencourt, M.B.,
Compressing Quadtrees Via Common Subtree Merging,
PRL(9), 1989, pp. 193-200.
BibRef
Cordella, L.P.,
Sanniti di Baja, G.,
Geometric Properties Of The Union Of Maximal Neighborhoods,
T-PAMI(11), 1989, pp. 214-217.
BibRef
Goutsias, J.,
Schonfeld, D.,
Image Coding Via Morphological Transformations: A General Theory,
CVPR(89), pp. 178-183.
BibRef
Huang, S.T.,
Tsai, M.S.,
A Linear Systolic Algorithm For The Connected Component Problem,
BIT(29), 1989, pp. 217-226.
BibRef
Kong, T.Y.,
A Digital Fundamental Group,
C&G(13), 1989, pp. 159-166.
BibRef
Horn, W.P.,
Taylor, D.L.,
A Theorem To Determine The Spatial Containment Of A Point In A Planar Polyhedron,
CVGIP(45), 1989, pp. 106-116.
BibRef
Manohar, M.,
Ramapriyan, H.K.,
Connected Component Labeling Of Binary Images On A Mesh Connected Massively Parallel Processor,
CVGIP(45), 1989, pp. 133-149.
BibRef
Kovalevski, V.A.,
Finite Topology As Applied To Image Analysis,
CVGIP(46), 1989, pp. 141-161.
BibRef
Shih, Z.C.,
Lee, R.C.T.,
Yang, S.N.,
A Systolic Algorithm For Extracting Regions From A Planar Graph,
CVGIP(47), 1989, pp. 227-242.
BibRef
Kong, T.Y.,
Rosenfeld, A.,
Digital Topology: Introduction And Survey,
CVGIP(48), 1989, pp. 357-393.
BibRef
Cybenko, G.,
Allen, T.G.,
Polito, J.E.,
Practical Parallel Union-Find Algorithms For Transitive Closure And Clustering,
INTL. J. PARALLEL PROGRAMMING(17), 1988, pp. 403-423.
BibRef
Cypher, R.,
Hypercube And Shuffle-Exchange Algorithms For Image Component Labeling,
J. ALGORITHMS(10), 1989, pp. 140-150.
BibRef
Chen, M.H.,
Yan, P.F.,
A Fast Algorithm To Calculate The Euler Number For Binary Images,
PRL(8), 1988, pp. 295-297.
BibRef
Melter, R.A.,
Rosenfeld, A.,
New Views Of Linearity And Connectedness In Digital Geometry,
PRL(10), 1989, pp. 9-16.
BibRef
Lengauer, T.,
Wanke, E.,
Efficient Solution Of Connectivity Problems On Hierarchically Defined Graphs,
SIAM JC(17), 1988, pp. 1063-1080.
BibRef
Cypher, R.,
Sanz, J.L.C.,
Snyder, L.,
An Erew Pram Algorithm For Image Component Labeling,
T-PAMI(11), 1989, pp. 258-262.
BibRef
Brisson, E.,
Representing Geometric Structures In D Dimensions: Topology And Order,
CG(89), pp. 218-227.
BibRef
Milenkovic, V.J.,
Verifiable Implementations Of Geometric Algorithms Using Finite Precision Arithmetic,
AI(37), 1988, pp. 377-401.
BibRef
Fleming, A.,
Geometric Relationships Between Toleranced Features,
AI(37), 1988, pp. 403-412.
BibRef
Hoffmann, C.M.,
The Problems Of Accuracy And Robustness In Geometric Computation,
COMPUTER(22), No. 3, 1989, pp. 31-41.
BibRef
Sugihara, K.,
On Finite-Precision Representations Of Geometric Objects,
JCSS(39), 1989, pp. 236-247.
BibRef
Havelock, D.I.,
Geometric Precision In Noise-Free Digital Images,
T-PAMI(11), 1989, pp. 1065-1075.
BibRef
Milenkovic, V.J.,
Robust Geometric Computations For Vision And Robotics,
IUW(89), pp. 764-773.
BibRef
Chapter on Rosenfeld Bibliography for 1989 continues in
H.2. Curves, etc .