O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles

DOI10.1007/978-3-642-37067-0_21zbMath1382.68303OpenAlexW1558311838MaRDI QIDQ4924475

Rita Zrour, Gaëlle Largeteau-Skapin, 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

outliersdigital circleinliersshape fittingconsensus set0-flake digital circle4-connected digital circle

Mathematics Subject Classification ID

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

Related Items (4)

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 ⋮ Optimal consensus set for digital flake hyperspheres in \(n\)D

This page was built for publication: O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles