Publications

(2011). Two linear-time algorithms for computing the minimum length polygon of a digital contour. Discrete Applied Mathematics, 159(18): 2229-2250, 2011.
(2011). Regularization of Discrete Contour by Willmore Energy. Journal of Mathematical Imaging and Vision, 40(2): 214-229, 2011.
(2011). Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects. Proc. Int. Workshop Combinatorial Image Analysis (IWCIA2011), volume 6636 of Lecture Notes in Computer Science, pp 132-143, Springer.
(2011). Fully deformable 3D digital partition model with topological control. Pattern Recognition Letters, 32(9): 1374-1383, 2011.
(2011). Dynamic Minimum Length Polygon. Proc. Int. Workshop Combinatorial Image Analysis (IWCIA2011), volume 6636 of Lecture Notes in Computer Science, pp 208-221, 2011. Springer.
(2011). Combining Topological Maps, Multi-Label Simple Points, and Minimum-Length Polygons for Efficient Digital Partition Model. Proc. Int. Workshop Combinatorial Image Analysis (IWCIA2011), volume 6636 of Lecture Notes in Computer Science, pp 55-69, 2011. Springer.
(2011). Accurate Curvature Estimation along Digital Contours with Maximal Digital Circular Arcs. Proc. Int. Workshop Combinatorial Image Analysis (IWCIA2011), volume 6636 of Lecture Notes in Computer Science, pp 43-55, 2011. Springer.
(2010). Unsupervised, Fast and Precise Recognition of Digital Arcs in Noisy Images. Proc. International Conference Computer Vision and Graphics (ICCVG2010), volume 6374 of Lecture Notes in Computer Science (part I), 59-68, 2010. Springer.
(2010). Multiscale Analysis of Digital Segments by Intersection of 2D Digital Lines. Proc. 20th International Conference on Pattern Recognition (ICPR2010), pp 4097-4100, 2010. IEEE.
(2010). Digital shape analysis with maximal segments. Proc. Workshop Advances in Digital Geometry and Mathematical Morphology (WADGMM-ICPR2010), satellite workshop of ICPR2010, Istanbul, Turkey.