9.19 H. Shape

Chapter Contents (Back)

9.19.1 H.1. Representation, Topology, Decomposition

Chapter Contents (Back)

Samet, H.,
The Design And Analysis Of Spatial Data Structures, Addison-Wesley, Reading,
MA(90), pp. 1990. BibRef

Samet, H.,
Applications Of Spatial Data Structures, Addison-Wesley, Reading,
MA(90), pp. 1990. BibRef

Erdos, P., Gruber, P.M., Hammer, J.,
Lattice Points, Wiley,
NEW(York), pp. 1989. BibRef

Shaffer, C.A., Samet, H.,
Set Operations For Unaligned Linear Quadtrees,
CVGIP(50), 1990, pp. 29-49. BibRef

Bhattacharya, P., Rosenfeld, A.,
Contour Codes Of Isothetic Polygons,
CVGIP(50), 1990, pp. 353-363. BibRef

Gunther, O., Wong, E.,
The Arc Tree: An Approximation Scheme To Represent Arbitrary Curved Shapes,
CVGIP(51), 1990, pp. 313-337. BibRef

Manohar, M., Sudarsana Rao, P., Sitarama Iyengar, S.,
Template Quadtrees For Representing Region And Line Data Present In Binary Images,
CVGIP(51), 1990, pp. 338-354. BibRef

Marshall, S.,
Review Of Shape Coding Techniques,
IVC(7), 1989, pp. 281-294. BibRef

Holroyd, F.C., Mason, D.C.,
Efficient Linear Quadtree Construction Algorithm,
IVC(8), 1990, pp. 218-224. BibRef

Wise, D.S., Franco, J.,
Costs Of Quadtree Representation Of Nondense Matrices,
JPDC(9), 1990, pp. 282-296. BibRef

Dinstein, I., Landau, G.M.,
Parallel Algorithms For Contour Extraction And Coding On An Erew Pram Computer,
PRL(11), 1990, pp. 87-93. BibRef

Grattoni, P., Guiducci, A.,
Contour Coding For Image Description,
PRL(11), 1990, pp. 95-105. BibRef

Kim, W., Park, R.H.,
Contour Coding Based On The Decomposition Of Line Segments,
PRL(11), 1990, pp. 191-195. BibRef

Lavakusha, A.K. Pujari, And P.G. Reddy, Polygonal Representation By Edge K-D Trees, Prl 11,

Devroye, L., Laforest, L.,
An Analysis Of Random D-Dimensional Quad Trees,
SIAM JC(19), 1990, pp. 821-832. BibRef

Ang, C.H., Samet, H., Shaffer, C.A.,
A New Region Expansion For Quadtrees,
T-PAMI(12), 1990, pp. 682-686. BibRef

Cabrelli, C.A., Molter, U.M.,
Automatic Representation Of Binary Images,
T-PAMI(12), 1990, pp. 1190-1196. BibRef

Chaudhuri, B.B., Chandrashekhar, S.,
Neighboring Direction Runlength Coding: An Efficient Contour Coding Scheme,
T-SMC(20), 1990, pp. 916-921. BibRef

Samet, H., Webber, R.E.,
A Comparison Of The Space Requirements Of Multi-Dimensional Quadtree-Based File Structures,
VC(5), 1989, pp. 349-359. BibRef

Mobasseri, B.G.,
Expected Complexity In Hierarchical Representations For Random Fields,
ICPR-B(90), pp. 508-512. BibRef

Lindenbaum, M., Samet, H.,
A Probabilistic Analysis Of Hierarchical Geometric Data Structures,
ICPR-C(90), pp. 91-96. BibRef

Yu, B., Lin, X.,
The Extended Binary Tree Representation Of Binary Image And Its Application To Engineering Drawing Entry,
ICPR-C(90), pp. 109-114. BibRef

Cinque, L., Guerra, C., Levialdi, S.,
Optimal Parallel Computation Of The Quadtree Medial Axis Transform On A Multi-Layered Architecture,
ICPR-D(90), pp. 462-466. BibRef

Chang, L.W., Leu, K.L.,
A Fast Algorithm For The Restoration Of Images Based On Chain Codes Description And Its Applications,
CVGIP(50), 1990, pp. 296-307. BibRef

Herman, G.T.,
On Topology As Applied To Image Analysis,
CVGIP(52), 1990, pp. 409-415. BibRef

Han, Y., Wagner, R.A.,
An Efficient And Fast Parallel-Connected Component Algorithm,
J. ACM(37), 1990, pp. 626-642. BibRef

Kong, T.Y., Rosenfeld, A.,
If We Use 4- Or 8-Connectedness For Both The Objects And The Background, The Euler Characteristic Is Not Locally Computable,
PRL(11), 1990, pp. 231-232. BibRef

Cypher, R.E., Sanz, J.L.C., Snyder, L.,
Algorithms For Image Component Labeling On Simd Mesh-Connected Computers,
T-COMP(39), 1990, pp. 276-281. BibRef

Shima, Y., Murakami, T., Koga, M., Yashiro, H., Fujisawa, H.,
A High Speed Algorithm For Propagation-Type Labeling Based On Block Sorting Of Runs In Binary Images,
ICPR-B(90), pp. 655-658. BibRef

Mandler, E., Oberlander, M.F.,
One-Pass Encoding Of Connected Components In Multi-Valued Images,
ICPR-C(90), pp. 64-69. BibRef

Hattori, T.,
A High-Speed Pipeline Processor For Regional Labeling Based On A New Algorithm,
ICPR-D(90), pp. 494-496. BibRef

Clermont, P., Zavidovique, B.,
Communication Control In A Pyramid Computer-Application To Region Labeling,
ICPR-D(90), pp. 551-555. BibRef

Ghosh, P.K.,
A Solution Of Polygon Containment, Spatial Planning, And Other Related Problems Using Minkowski Operations,
CVGIP(49), 1990, pp. 1-35. BibRef

Jakubowski, R.,
Decomposition Of Complex Shapes For Their Structural Recognition,
IS(50), 1990, pp. 35-71. BibRef

Liu, H.C., Srinath, M.D.,
Corner Detection From Chain-Code,
PR(23), 1990, pp. 51-68. BibRef

Pitas, I., Venetsanopoulos, A.N.,
Morphological Shape Decomposition,
T-PAMI(12), 1990, pp. 38-45. BibRef

Walker, N.,
Using Neural Networks To Learn Shape Decomposition By Successive Prototypication,
ECCV(90), pp. 610-612. BibRef

Borgefors, G., Sanniti di Baja, G.,
Parallel Smoothing And Decomposition Of Digital Shapes Using A Multiresolution Structure,
ICPR-B(90), pp. 745-748. BibRef

Katzir, N., Lindenbaum, M., Porat, M.,
Planar Curve Segmentation For Recognition Of Partially Occluded Shapes,
ICPR-B(90), pp. 842-846. BibRef

Rattarangsi, A., Chin, R.T.,
Scale-Based Detection Of Corners Of Planar Curves,
ICPR-B(90), pp. 923-930. BibRef

Chapter on Rosenfeld Bibliography for 1990 continues in
H.2. Lines, Curves, Specific Shapes .

Last update:Jun 7, 2018 at 10:14:50