Basic topological algorithms are the subject of this new book. It presents their underlying theory and discusses their applications.

Due to the wide variety of topics treated in the seven chapters, no attempt has been made to standardize the notation and terminology used by the authors. Each chapter, however, is self-contained and can be read independently of the others.

Some of the basic terminology and fundamental concepts of digital topology are reviewed in the appendix which also describes important areas of the field. A bibliography of over 360 references is also provided.

The notations and terminologies used in this book will serve to introduce readers to the even wider variety that exists in the voluminous literature dealing with topological algorithms.

Table of Contents

Preface. Connected component labeling and adjency graph construction (L.G. Shapiro). Shrinking binary images (R.W. Hall, T.Y. Kong, A. Rosenfeld). Skeletons of planar patterns (C. Arcelli, G. Sanniti di Baja). Parallel connectivity-preserving thinning algorithms (R.W. Hall). On the soundness of surface voxelizations (D. Cohen-Or, A.E. Kaufman, T.Y. Kong). Connected, oriented, closed boundaries in digital spaces: theory and algorithms (J.K. Udupa). Boundaries in digital spaces: basic theory (G.T. Herman). Appendix: digital topology - a brief introduction and bibliography (T.Y. Kong, A. Rosenfeld).


No. of pages:
© 1996
North Holland
Electronic ISBN:
Print ISBN:

About the editors