2D Points Curve Reconstruction Survey and Benchmark

Curve reconstruction from unstructured points in a plane is a fundamental problem with many applications that has generated research interest for decades. Involved aspects like handling open, sharp, multiple and non‐manifold outlines, run‐time and provability as well as potential extension to 3D for...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 40; no. 2; pp. 611 - 632
Main Authors Ohrhallinger, S., Peethambaran, J., Parakkat, A. D., Dey, T. K., Muthuganapathy, R.
Format Journal Article
LanguageEnglish
Published Oxford Blackwell Publishing Ltd 01.05.2021
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Curve reconstruction from unstructured points in a plane is a fundamental problem with many applications that has generated research interest for decades. Involved aspects like handling open, sharp, multiple and non‐manifold outlines, run‐time and provability as well as potential extension to 3D for surface reconstruction have led to many different algorithms. We survey the literature on 2D curve reconstruction and then present an open‐sourced benchmark for the experimental study. Our unprecedented evaluation of a selected set of planar curve reconstruction algorithms aims to give an overview of both quantitative analysis and qualitative aspects for helping users to select the right algorithm for specific problems in the field. Our benchmark framework is available online to permit reproducing the results and easy integration of new algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.142659