Premium
Crawl through Neighbors: A Simple Curve Reconstruction Algorithm
Author(s) -
Parakkat Amal Dev,
Muthuganapathy Ramanathan
Publication year - 2016
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/cgf.12974
Subject(s) - delaunay triangulation , bowyer–watson algorithm , parametric equation , computer science , constrained delaunay triangulation , algorithm , outlier , boundary (topology) , point (geometry) , parametric statistics , pitteway triangulation , enhanced data rates for gsm evolution , artificial intelligence , computer graphics , computer vision , mathematics , geometry , mathematical analysis , statistics
Given 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 ε‐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.