This papers presents a novel representation of classifier conditions based on convex hulls. A classifier condition is represented by a sets of points in the problem space. These p...
This paper describes a new algorithm of computing the convex hull of a 3-dimensional object. The convex hull generated by this algorithm stract polyhedron being described by a new ...
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...