Crawl through neighbors: a simple curve reconstruction algorithm

摘要: Given a planar point set sampled from an object boundary, the process of approximating original shape is called curve reconstruction. In this paper, novel non-parametric reconstruction algorithm based on Delaunay triangulation has been proposed and it theoretically proved that method reconstructs under e-sampling. Starting initial seed edge, proceeds by finding appropriate neighbouring adding edge between them. Experimental results show capable reconstructing curves with different features like sharp corners, outliers, multiple objects, objects holes, etc. The also works for open curves. Based study few users, paper discusses application hand drawn skip stroke sketches, which will be useful in various sketch interfaces.