2D Points Curve Reconstruction Survey and Benchmark
Stefan Ohrhallinger, Jiju Peethambaran, Amal D. Parakkat and, Tamal K. Dey, Ramanathan Muthuganapathy

TL;DR
This paper surveys 2D curve reconstruction techniques from unstructured points, introduces an open-source benchmark for evaluation, and provides insights to guide algorithm selection for various applications.
Contribution
It offers the first comprehensive survey combined with an open-source benchmark framework for 2D curve reconstruction algorithms.
Findings
Quantitative and qualitative analysis of selected algorithms
Benchmark framework available online for reproducibility
Guidance for choosing algorithms based on problem specifics
Abstract
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 on 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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
