Efficient Robust Digital Annulus Fitting with Bounded Error

DOI10.1007/978-3-642-37067-0_22zbMath1382.68272OpenAlexW203532632MaRDI QIDQ4924476

Eric Andres, Sugimoto, Akihiro, Yukiko Kenmochi, Hugues Talbot, Minh Son Phan, Rita Zrour

Publication date: 31 May 2013

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-37067-0_22

zbMATH Keywords

approximationfittingannulushalfspace range searching

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Related Items (3)

On Connectivity of Discretized 2D Explicit Curve ⋮ On properties of analytical approximation for discretizing 2D curves and 3D surfaces ⋮ Fitting discrete polynomial curve and surface to noisy data

This page was built for publication: Efficient Robust Digital Annulus Fitting with Bounded Error