Thinning on binary images is an iterative layer by layer erosion until only the “skeletons” of the objects are left. This paper presents an efficient parallel 3D surface–thinning algorithm. A three–subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions.

Thinning is an iterative layer by layer erosion for extracting skeletons. This paper presents an efficient 3D parallel thinning algorithm which produces medial surfaces. A 3-subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of 3 according to the three deletion directions. 2002 Elsevier Science B.V. All rights reserved.

3D thinning algorithms are generally faster than any other connectivity-preservation skeletonization methods. However, most 3D thinning algorithms cannot guarantee to generate unit-width skeleton. This document describes an algorithm to generate unit-width skeleton based on 3D thinning and shortest path finding.

Thinning is an iterative layer by layer erosion for extracting skeleton. This paper presents an efficient parallel 3D thinning algorithm which produces medial surfaces. A three–subiteration strategy is proposed: the thinning operation is changed from iteration to iteration with a period of three according to the three deletion directions.

The thinning of loblolly pine plantations has a great potential to influence the fluxes and storage of carbon within managed stands. This study looked at the effects of thinning on aboveground carbon and mineral soil carbon storage, 14-years after the thinning of an 8-year-old loblolly pine plantation on the piedmont of Virginia. The study also examined soil respiration for one year following t...

The availability of large 3D datasets has made volume thinning essential for compact representation of shapes. The density of the skeletal structure resulting from the thinning process depends on the application. Current thinning techniques do not allow control over the density and can therefore address only specific applications. In this paper, we describe an algorithm which uses a thinness pa...

In this paper, we propose a new concept, thinning-out, for reducing the number of trials in skill discovery. Thinning-out means to skip over such trials that are unlikely to improve discovering results, in the same way as “pruning” in a search tree. We show that our thinningout technique significantly reduces the number of trials. In addition, we apply thinning-out to the discovery of good phys...