We give a simple O(n log n) algorithm to compute the convex hull of the (possibly Θ(n2 )) intersection points in an arrangement of n line segments in the plane. We also show an a...
Esther M. Arkin, Joseph S. B. Mitchell, Jack Snoey...
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...
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
A new approach is presented for partitioning an image database by classifying and indexing the convex hull shapes and the number of region concavities. The result is a significant...
Determiningthe convex hull ofa point set isa basic operation for many applications of pattern recognition, image processing, statistics, and data mining. Although the corresponding...