Robust decomposition of a digital curve into convex and concave parts

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 Pick's formula.

• Type: Conference
• Year: 2008
• Where: ICPR
• Authors: Tristan Roussillon, Isabelle Sivignon, Laure Tougne
• Keywords: Computer Vision, Convex Hull Computation, Easy-to-implement Algorithm, ICPR 2008