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

Celý popis

Podrobná bibliografie

Vydáno v:	Computer graphics forum Ročník 35; číslo 5; s. 177 - 186
Hlavní autoři:	Parakkat, Amal Dev, Muthuganapathy, Ramanathan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Blackwell Publishing Ltd 01.08.2016
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!