3 search results - page 1 / 1 » Robust decomposition of a digital curve into convex and conc... |
ICPR
2008
IEEE
14 years 7 months ago
2008
IEEE
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 d...
IWCIA
2009
Springer
13 years 10 months ago
2009
Springer
Abstract. The paper studies local convexity properties of parts of digital boundaries. An online and linear-time algorithm is introduced for the decomposition of a digital boundary...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
This paper describes a computational model for deriving a decomposition of objects from laser rangefinder data. The process aims to produce a set of parts defined by compactness a...