37 search results - page 1 / 8 » Algorithms for the Construction of Digital Convex Fuzzy Hull... |
EUSFLAT
2007
13 years 8 months ago
2007
We consider a digital fuzzy set placed in Oxyplane, with support which is a set of digital points (centroids) in Z2 . We consider two kinds of convexity of a fuzzy set, namely qua...
ICPR
2008
IEEE
14 years 8 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 12 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...
ICCSA
2004
Springer
14 years 23 days ago
2004
Springer
Finding the fastest algorithm to solve a problem is one of the main issues in Computational Geometry. Focusing only on worst case analysis or asymptotic computations leads to the d...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Abstract. Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to re...