Reconstructing collections of arbitrary curves

DOI10.1145/1064092.1064149MaRDI QIDQ5370633zbMATH OpenOpenAlexFDO

Authors Tobias Lenz

Publication date 20 October 2017

Published in Proceedings of the twenty-first annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1064092.1064149

zbMATH Keywords

greedyintersectioncurve reconstruction

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Reconstructing a collection of curves with corners and endpoints
• FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS
• Curve reconstruction from noisy samples
• Curve reconstruction: Connecting dots with good reason
• scientific article; zbMATH DE number 727970

Cited in

(10)

• scientific article; zbMATH DE number 1445366 (Why is no real title available?)
• Intelligent Solutions for Curve Reconstruction Problem
• On a problem of restoration of curves
• Reconstructing curves without Delaunay computation
• Recovering of curves with involution by extended Prym data
• Reconstructing a collection of curves with corners and endpoints
• Curve reconstruction from noisy samples
• scientific article; zbMATH DE number 727970 (Why is no real title available?)
• scientific article; zbMATH DE number 1979489 (Why is no real title available?)
• FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS

This page was built for publication: Reconstructing collections of arbitrary curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5370633)