Robust decomposition of a digital curve into convex and concave parts

Tristan Roussillon, Laure Tougne, Isabelle Sivignon · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · 2008

We propose a linear in time and easy-to-implement algorithm that robustly decomposes a digital curve into convex and concave parts. This algorithm is based on classical tools in discrete and computational geometry: convex hull computation and Pickpsilas formula.

Read the paper · More papers on PaperTik