O(n ^3 n) time complexity for the optimal consensus set computation for 4-connected digital circles

DOI10.1007/978-3-642-37067-0_21MaRDI QIDQ4924475zbMATH OpenOpenAlexFDO

Authors Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres

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_21

zbMATH Keywords

0-flake digital circle4-connected digital circleconsensus setdigital circleinliersoutliersshape fitting

Mathematics Subject Classification ID

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

Recommendations

• Optimal consensus set for annulus fitting
• Optimal consensus set for nD fixed width annulus fitting
• Optimal consensus set for digital flake hyperspheres in \(n\)D
• Efficient robust digital annulus fitting with bounded error
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

Cited in

(6)

• Optimal consensus set for digital flake hyperspheres in \(n\)D
• On properties of analytical approximation for discretizing 2D curves and 3D surfaces
• Optimal consensus set for nD fixed width annulus fitting
• Optimal consensus set for annulus fitting
• Fitting discrete polynomial curve and surface to noisy data
• On connectivity of discretized 2D explicit curve

This page was built for publication: \(O(n ^{3} \log n)\) time complexity for the optimal consensus set computation for 4-connected digital circles

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