The image foresting transform (IFT) reduces optimal image partition problems based on seed pixels to a shortest-path forest problem in a graph, whose solution can be obtained in linear time. Such a strategy has allowed a unified and efficient approach to the design of image processing operators, such as edge tracking, region growing, watershed transforms, distance transforms, and connected filters. This paper presents a fast and simple method based on the IFT to compute multiscale skeletons and shape reconstructions without border shifting. The method also generates one-pixel-wide connected skeletons and the skeleton by influence zones, simultaneously, for objects of arbitrary topologies. The results of the work are illustrated with respect to skeleton quality, execution time, and its application to neuromorphometry. (C) 2002 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.35715711582