Optimal consensus set for annulus fitting
From MaRDI portal
Publication:3000717
DOI10.1007/978-3-642-19867-0_30zbMATH Open1272.52034OpenAlexW1596462288MaRDI QIDQ3000717FDOQ3000717
Authors: Rita Zrour, Gaëlle Largeteau-Skapin, Eric Andres 
Publication date: 19 May 2011
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-19867-0_30
Recommendations
- Optimal consensus set for \(n\)D fixed width annulus fitting
- Efficient robust digital annulus fitting with bounded error
- \(O(n ^{3} \log n)\) time complexity for the optimal consensus set computation for 4-connected digital circles
- Fitting a set of points by a circle
- The Largest Empty Annulus Problem
Computing methodologies for image processing (68U10) Computational aspects related to convexity (52B55)
Cited In (7)
- \(O(n ^{3} \log n)\) time complexity for the optimal consensus set computation for 4-connected digital circles
- Efficient robust digital annulus fitting with bounded error
- Optimal consensus set for digital flake hyperspheres in \(n\)D
- Optimal consensus set for \(n\)D fixed width annulus fitting
- On connectivity of discretized 2D explicit curve
- Fitting discrete polynomial curve and surface to noisy data
- On properties of analytical approximation for discretizing 2D curves and 3D surfaces
This page was built for publication: Optimal consensus set for annulus fitting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3000717)
