2D Points Curve Reconstruction Survey and Benchmark
| Autor: | Tamal K. Dey, Stefan Ohrhallinger, Jiju Peethambaran, Amal Dev Parakkat, Ramanathan Muthuganapathy |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
FOS: Computer and information sciences
Plane (geometry) Computer science Picture/Image Generation 020207 software engineering 02 engineering and technology Extension (predicate logic) computer.software_genre Computer Graphics and Computer-Aided Design Field (computer science) Graphics (cs.GR) Set (abstract data type) Computer Science - Graphics Picture/Image Generation - Line and curve generation Quantitative analysis (finance) 0202 electrical engineering electronic engineering information engineering Benchmark (computing) Curve reconstruction 020201 artificial intelligence & image processing Line and curve generation Data mining computer Surface reconstruction |
| DOI: | 10.48550/arxiv.2103.09583 |
| Popis: | 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. Tutorials Stefan Ohrhallinger, Jiju Peethambaran, Amal Dev Parakkat, Tamal K. Dey, and R. Muthuganapathy |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|