Crawl through Neighbors: A Simple Curve Reconstruction Algorithm

Simple item page
dc.contributor.authorParakkat, Amal Deven_US
dc.contributor.authorMuthuganapathy, Ramanathanen_US
dc.contributor.editorMaks Ovsjanikov and Daniele Panozzoen_US
dc.date.accessioned2016-06-17T14:12:00Z
dc.date.available2016-06-17T14:12:00Z
dc.date.issued2016en_US
dc.description.abstractGiven a planar point set sampled from an object boundary, the process of approximating the original shape is called curve reconstruction. In this paper, a novel non-parametric curve reconstruction algorithm based on Delaunay triangulation has been proposed and it has been theoretically proved that the proposed method reconstructs the original curve under e-sampling. Starting from an initial Delaunay seed edge, the algorithm proceeds by finding an appropriate neighbouring point and adding an edge between them. Experimental results show that the proposed algorithm is capable of reconstructing curves with different features like sharp corners, outliers, multiple objects, objects with holes, etc. The proposed method also works for open curves. Based on a study by a few users, the paper also discusses an application of the proposed algorithm for reconstructing hand drawn skip stroke sketches, which will be useful in various sketch based interfaces.en_US
dc.description.number5en_US
dc.description.sectionheadersReconstructionen_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume35en_US
dc.identifier.doi10.1111/cgf.12974en_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages177-186en_US
dc.identifier.urihttps://doi.org/10.1111/cgf.12974en_US
dc.publisherThe Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectI.3.3 [Computer Graphics]en_US
dc.subjectPicture/Image Generationen_US
dc.subjectLine and curve generationen_US
dc.titleCrawl through Neighbors: A Simple Curve Reconstruction Algorithmen_US
Files
Collections
35-Issue 5
SGP16: Eurographics Symposium on Geometry Processing (CGF 35-5)