This paper proposes a method for stroke segmentation to decompose Chinese characters to become individual strokes. The method first obtains the medial axes of any given Chinese cha...
We prove that the pathwidth of Halin graphs can be 3-approximated in linear time. Our approximation algorithms is based on a combinatorial result about respectful edge orderings o...
This paper describes an improved thinning algorithm for binary images. We improve thinning algorithm from the fundamental properties such as connectivity, onepixel width, robust t...
This paper presents an algorithm for generating the Medial Axis Transform(MAT) of 3D objects with free-form boundaries. The algorithm proposed uses the exact representation of the...
The iterative closest point (ICP) algorithm [2] is a popular method for modeling 3D objects from range data. The classical ICP algorithm rests on a rigid surface assumption. Build...