8.18.4 G.4. Distance, skeletons

Chapter Contents (Back)

Schwartzkopf, O.,
Parallel Computation Of Distance Transforms,
ALGORITHMICA(6), 1991, pp. 685-697. BibRef

Galvin, F., Shore, S.D.,
Distance Functions And Topologies,
AMERICAN MATHEMATICAL MONTHLY(98), 1991, pp. 620-623. BibRef

Su, T.S., Chang, R.C.,
On Constructing The Relative Neighborhood Graphs In Euclidean K-Dimensional Spaces,
COMPUTING(46), 1991, pp. 121-130. BibRef


Aurenhammer, F.,
Voronoi Diagrams-A Survey Of A Fundamental Geometric Data Structure,
COMPUTING SURVEYS(23), 1991, pp. 345-405. BibRef

Shonkwiler, R.,
Computing The Hausdorff Set Distance In Linear Time For Any L

Point Distance,
IPL(38), 1991, pp. 201-207. BibRef

Shaffer, C.A., Stout, Q.F.,
Linear Time Distance Transforms For Quadtrees,
IU(54), 1991, pp. 215-223. BibRef

Borgefors, G.,
Another Comment On ``A Note On `Distance Transformations In Digital Images''',
IU(54), 1991, pp. 301-306. BibRef

Su, T.H., Chang, R.C.,
Computing The Constrained Relative Neighborhood Graphs And Constrained Gabriel Graphs In Euclidean Plane,
PR(24), 1991, pp. 221-230. BibRef

Su, T.H., Chang, R.C.,
Computing The K-Relative Neighborhood Graphs In Euclidean Plane,
PR(24), 1991, pp. 231-239. BibRef

Tuceryan, M., Chorzempa, T.,
Relative Sensitivity Of A Family Of Closest-Point Graphs In Computer Vision Applications,
PR(24), 1991, pp. 361-373. BibRef

Atallah, M.J., Ribeiro, C.C., Lifschitz, S.,
Computing Some Distance Functions Between Polygons,
PR(24), 1991, pp. 775-781. BibRef

Das, P.P.,
Counting Minimal Paths In Digital Geometry,
PRL(12), 1991, pp. 595-603. BibRef

Verwer, B.J.H.,
Local Distances For Distance Transformations In Two And Three Dimensions,
PRL(12), 1991, pp. 671-682. BibRef

Vincent, L.,
Exact Euclidean Distance Function By Chain Propagations,
CVPR(91), pp. 520-525. BibRef

Huang, C.T., Mitchell, O.R.,
Rapid Euclidean Distance Transform Using Grayscale Morphology Decomposition,
CVPR(91), pp. 695-697. BibRef

Brandt, J.W., Jain, A.K., Algazi, V.R.,
Medial Axis Representation And Encoding Of Scanned Documents,
JVCIR(2), 1991, pp. 151-165. BibRef


Heydorn, S., Weidner, P.,
Optimization And Performance Analysis Of Thinning Algorithms On Parallel Computers,
PC(17), 1991, pp. 17-27. BibRef

Mahmoud, S.A., AbuHaiba, I., Green, R.J.,
Skeletonization Of Arabic Characters Using Clustering Based Skeletonization Algorithm (Cbsa),
PR(24), 1991, pp. 453-464. BibRef

Sirjani, A., Cross, G.R.,
On Representation Of A Shape'S Skeleton,
PRL(12), 1991, pp. 149-154. BibRef

Parui, S.K.,
A Parallel Algorithm For Decomposition Of Binary Objects Through Skeletonization,
PRL(12), 1991, pp. 235-240. BibRef

Li, X., Basu, A.,
Variable-Resolution Character Thinning,
PRL(12), 1991, pp. 241-248. BibRef

Cho, K., Dunn, S.M.,
Hierarchical Local Symmetries,
PRL(12), 1991, pp. 343-347. BibRef

Kundu, M.K., Chaudhuri, B.B., Dutta Majumder, D.,
A Parallel Greytone Thinning Algorithm,
PRL(12), 1991, pp. 491-496. BibRef

Kumar, P., Bhatnagar, D., Unapathi Rao, P.S.,
Pseudo One Pass Thinning Algorithm,
PRL(12), 1991, pp. 543-555. BibRef

Pal, S.K., Rosenfeld, A.,
A Fuzzy Medial Axis Transformation Based On Fuzzy Disks,
PRL(12), 1991, pp. 585-590. BibRef

Suzuki, S., Ueda, N.,
Robust Vectorization Using Graph-Based Thinning And Reliability-Based Line Approximation,
CVPR(91), pp. 494-500. BibRef

Brandt, J.W., Algazi, V.R.,
Computing A Stable, Connected Skeleton From Discrete Data,
CVPR(91), pp. 666-667. BibRef

Vincent, L., Soille, P.,
Watersheds In Digital Spaces: An Efficient Algorithm Based On Immersion Simulations,
T-PAMI(13), 1991, pp. 583-598. BibRef


Chapter on Rosenfeld Bibliography for 1991 continues in
G.5. Path planning .

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