๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Width-independent fast skeletonization algorithm for binary pictures

โœ Scribed by V. M. Kiyko; M. I. Schlesinger

Publisher
John Wiley and Sons
Year
1991
Tongue
English
Weight
450 KB
Volume
3
Category
Article
ISSN
0899-9457

No coin nor oath required. For personal study only.

โœฆ Synopsis

An effective algorithm of skeletonization for digital binary pictures based on input-time-tracing principle and sequential decomposition of input picture into simple parts is described. The proposed algorithm is fast and requires no image memory. Its computing complexity does not depend on the thickness of picture patterns and is determined not by the number of picture pixels but by the essentially small number of horizontal and vertical lines constituting the contour of the picture.

๐Ÿ“œ SIMILAR VOLUMES

Fast algorithms for computing ฮฒ-skeleton
Fast algorithms for computing ฮฒ-skeletons and their relatives
โœ S.V. Rao; Asish Mukhopadhyay ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 191 KB

In this paper we present fast algorithms for computing -skeletons (Kirkpatrick and Radke, in: Toussaint (Ed.), Computational Geometry, North-Holland, Amsterdam, 1985, pp. 217}248) and two of its relatives, namely, k -skeletons, and additively weighted -skeletons. A -skeleton is a generalization of t