Interval skeletons
Jim Piper · 2003
A skeleton method based on interval coding of a binary image is shown to preserve the homotopy of the image. With a computational complexity linear in the number of intervals, it is typically an order of magnitude faster than other fast skeleton methods. Thinness, reconstructability, and other shape-representation properties of the method are discussed.>