15.8.3 H.3. Topology; geometry

Chapter Contents (Back)

Ronse, C., Devijver, P.A.,
Connected Components In Binary Images: The Detection Problem, Research Studies Press (Wiley),
NEW(York), pp. 1984. BibRef

Lipski, Jr., W., Preparata, F.P.,
Finding The Contour Of A Union Of Iso-Oriented Rectangles,
J. ALGORITHMS(1), 1980, pp. 235-246. BibRef

Shlien, S.,
Raster To Polygon Conversion Of Images,
C+G(7), 1983, pp. 327-332. BibRef

Dunlavey, M.R.,
Efficient Polygon-Filling Algorithms For Raster Displays,
TOG(2), 1983, pp. 264-273. BibRef

Imai, H., Asano, T.,
Finding The Connected Components And A Maximum Clique Of An Intersection Graph Of Rectangles In The Plane,
J. ALGORITHMS(4), 1983, pp. 310-323. BibRef

Di Gesu, V.,
A System For The Analysis Of The Boundaries Of A Shape,
DIA(84), pp. 144-148. BibRef

Gargantini, I., Atkinson, H.H.,
Linear Quadtrees: A Blocking Technique For Contour Filling,
PR(17), 1984, pp. 285-293. BibRef

Guting, R.H.,
An Optimal Contour Algorithm For Iso-Oriented Rectangles,
J. ALGORITHMS(5), 1984, pp. 303-326. BibRef

Savage, C.,
A Systolic Design For Connectivity Problems,
T-COMP(33), 1984, pp. 99-104. BibRef

Ibrahim, H.A.H.,
The Connected Component Algorithm On The Non-Von Supercomputer,
WCVRC(84), pp. 37-45. BibRef

Li, S.X., Loew, M.H.,
Boundary Chains From Quadcodetrees,
WCVRC(84), pp. 178-182. BibRef

Fong, A.C.,
A Scheme For Reusing Label Locations In Real Time Component Labeling Of Images,
7ICPR(84), pp. 243-245. BibRef

Fishkin, K.P., Barsky, B.A.,
A Family Of New Algorithms For Soft Filling,
SIGGRAPH(84), pp. 235-244. BibRef

Kovalevsky, V.A.,
Discrete Topology And Contour Definition,
PRL(2), 1984, pp. 281-288. BibRef

Capson, D.W.,
An Improved Algorithm For The Sequential Extraction Of Boundaries From A Raster Scan,
CVGIP(28), 1984, pp. 109-125. BibRef

Bieri, H., Nef, W.,
Algorithms For The Euler Characteristic And Related Additive Functionals Of Digital Objects,
CVGIP(28), 1984, pp. 166-175. BibRef

Zheng, C.Y.,
Fuzzy Path And Fuzzy Connectedness,
FUZZY SETS SYSTEMS(14), 1984, pp. 273-280. BibRef

Lipski, Jr., W., Preparata, F.P.,
Segments, Rectangles, Contours,
J. ALGORITHMS(2), 1981, pp. 63-76. BibRef

Chin, F., Wang, C.A.,
Optimal Algorithms For The Intersection And The Minimum Distance Problems Between Planar Polygons,
T-COMP(32), 1983, pp. 1203-1207. BibRef

Maus, A.,
Delaunay Triangulation And The Convex Hull Of N Points In Expected Linear Time,
BIT(24), 1984, pp. 151-163. BibRef

Guting, R.H.,
Optimal Divide-And-Conquer To Compute Measure And Contour For A Set Of Iso-Rectangles,
ACTA INFORMATICA(21), 1984, pp. 271-291. BibRef

Mudur, S.P., Koparkar, P.A.,
Interval Methods For Processing Geometric Objects,
CGA(4), No. 2, 1984, pp. 7-17. BibRef

Gabow, H.N., Bentley, J.L., Tarjan, R.E.,
Scaling And Related Techniques For Geometry Problems,
STOC(84), pp. 135-143. BibRef

Biswas, S.N., Dutta Majumder, D.,
A New Method For 2-D Shape Dilation,
7ICPR(84), pp. 102-104. BibRef

Stout, Q.F., Miller, R.,
Mesh-Connected Computer Algorithms For Determining Geometric Properties Of Figures,
7ICPR(84), pp. 475-477. BibRef

Ottmann, T., Wood, D.,
Dynamical Sets Of Points,
CVGIP(27), 1984, pp. 157-166. BibRef

Tiller, W., Hanson, E.G.,
Offsets Of Two-Dimensional Profiles,
CGA(4), No. 9, 1984, pp. 36-46. BibRef

Rosenfeld, A.,
The Fuzzy Geometry Of Image Subsets,
PRL(2), 1984, pp. 311-317. BibRef

Chazelle, B.,
Computational Geometry On A Systolic Chip,
T-COMP(33), 1984, pp. 774-785. BibRef

Lowry, M.,
Automatic Reformulation Of Algorithms In Computational Geometry,
IUW(84), pp. 205-210. BibRef

Lee, D.T., Preparata, F.P.,
Computational Geometry -- A Survey,
T-COMP(33), 1984, pp. 1072-1101. BibRef

Chapter on Rosenfeld Bibliography for 1984 continues in
H.4. Intersection, packing, layout, etc. .

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