Algorithm for computing the digital convex fuzzy hull
Nebojša Ralević, Vladimir Ćurić, Marko B. Janev · 2006
The problem of finding the digital convex fuzzy hull of a digital fuzzy set, whose support is made of some digital points (centroids) in Z, is considered here. A region is DL−convex if, for any two pixels belonging to it, there exists a digital straight line between them, all of whose pixels belong to the region. An algorithm how to compute the DL−convex hull of a digital region is described. Also we describe algorithm for computing digital convex fuzzy hull of digital fuzzy set, which support is in Z, and is DL-convex. The proof that digital convex fuzzy hull is obtained by this algorithm, is also given.