Crawl through Neighbors: A Simple Curve Reconstruction Algorithm

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 t...

Full description

Bibliographic Details

Published in:	Computer graphics forum Vol. 35; no. 5; pp. 177 - 186
Main Authors:	Parakkat, Amal Dev, Muthuganapathy, Ramanathan
Format:	Journal Article
Language:	English
Published:	Oxford Blackwell Publishing Ltd 01.08.2016
Subjects:	Algorithms Analysis Approximation Boundaries Categories and Subject Descriptors (according to ACM CCS) Computer graphics Corners Delaunay triangulation I.3.3 [Computer Graphics]: Picture/Image Generation-Line and curve generation Image processing systems Reconstruction Sketches Skips Studies Topological manifolds
ISSN:	0167-7055, 1467-8659
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!