Abstract
This paper considers the problem for reconstructing closed curves from unorganized sample points, where the curve to be reconstructed consists of a finite number of pairwise disjoint components of simple closed curves. This paper formulates this problem as a linear integer programming problem, and proposes an algorithm, called ZERO-ONE, based on it. In addition, two other heuristic algorithms called PASTE and SCISSORS are proposed for reducing computational time. Experimental results show that these algorithms yield exact polygonal reconstruction if the density of the sample points is high enough. In addition, it is shown that SCISSORS can be modified for the reconstruction problem of curves with boundaries.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
