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

Gaëlle Largeteau-Skapin, Rita Zrour, Eric Andres. O(n 3logn) Time Complexity for the Optimal Consensus Set Computation for 4-Connected Digital Circles. In Rocío González-Díaz, María José Jiménez, Belén Medrano, editors, Discrete Geometry for Computer Imagery - 17th IAPR International Conference, DGCI 2013, Seville, Spain, March 20-22, 2013. Proceedings. Volume 7749 of Lecture Notes in Computer Science, pages 241-252, Springer, 2013. [doi]

Abstract

Abstract is missing.