We present an algorithm that produces a skeleton for an outline character. The algorithm precisely finds the strokes in the skeleton by using the centers of the curves in the character, and by scanning the character in prescribed scanline directions. Gaps (which are caused by only scanning at angles) are then filled and unwanted curves/strokes are then deleted. This scanning process leaves holes at points where a topological change occurs. The filling of these holes is done by a heuristic method: First, short curves at the ends of strokes are ignored; then, the strokes are lengthened by smoothly adding straight lines, and the lines opposite each other are connected.