Abstract
In this paper we present a 3-step algorithm for reconstructing curves from unorganized points: data clustering to filter out the noise, data confining to get the boundary, and region thinning to find the skeleton curve. The method is effective in removing far-from-the-shape noise and in handling a shape of changing density. The algorithm takes O(nlog n) time and O(n) space for a set of n points.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
