Curve reconstruction: Connecting dots with good reason

DOI10.1016/S0925-7721(99)00051-6zbMath0955.68113OpenAlexW2200955931WikidataQ126537565 ScholiaQ126537565MaRDI QIDQ1975963

Kurt Mehlhorn, Edgar A. Ramos, Tamal Krishna Dey

Publication date: 27 July 2000

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0925-7721(99)00051-6

zbMATH Keywords

curve reconstruction algorithms

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (15)

A SIMPLE ALGORITHM FOR HOMEOMORPHIC SURFACE RECONSTRUCTION ⋮ FAST RECONSTRUCTION OF CURVES WITH SHARP CORNERS ⋮ Spectral edge detection in two dimensions using wavefronts ⋮ An input-independent single pass algorithm for reconstruction from dot patterns and boundary samples ⋮ Detecting and approximating decision boundaries in low-dimensional spaces ⋮ Point ordering with natural distance based on Brownian motion ⋮ Reconstructing curves with sharp corners ⋮ The power crust, unions of balls, and the medial axis transform ⋮ Curve reconstruction from noisy samples ⋮ A sampling type discernment approach towards reconstruction of a point set in \(\mathbb{R}^2\) ⋮ Intelligent Solutions for Curve Reconstruction Problem ⋮ Is the World Linear? ⋮ Combinatorial curve reconstruction in Hilbert spaces: A new sampling theory and an old result revisited ⋮ Smooth surface reconstruction via natural neighbour interpolation of distance functions ⋮ Gromov-Hausdorff approximation of filamentary structures using Reeb-type graphs

This page was built for publication: Curve reconstruction: Connecting dots with good reason