Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

ICPR
2008
IEEE

favoriteEmaildiscussreport

107views Computer Vision» more ICPR 2008»

Robust decomposition of a digital curve into convex and concave parts

14 years 5 months ago

Robust decomposition of a digital curve into convex and concave parts

Download liris.cnrs.fr

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.

Tristan Roussillon, Isabelle Sivignon, Laure Tougn

Real-time Traffic

Computer Vision | Convex Hull Computation | Easy-to-implement Algorithm | ICPR 2008 |

claim paper

Related Content

» What Does Digital Straightness Tell about Digital Convexity

» Decomposition of range images using markov random fields

Post Info
More Details (n/a)

Added	05 Nov 2009
Updated	05 Nov 2009
Type	Conference
Year	2008
Where	ICPR
Authors	Tristan Roussillon, Isabelle Sivignon, Laure Tougne

Comments (0)