In the past decade, Graphics Processing Units have played an important role in the field of
high-performance computing and they still advance new fields such as IoT, autonomous …

We present a hybrid algorithm to compute the convex hull of points in three or higher
dimensional spaces. Our formulation uses a GPU-based interior point filter to cull away …

This study examines various algorithms for computing the convex hull of a set of n points in a
d-dimensional space. Convex hulls are fundamental in computational geometry and are …

This work presents an optimization technique that reduces the computational cost for
building the Convex Hull from a set of points. The proposed method pre-processes the input …

A novel algorithm is presented to compute the convex hull of a point set in ℝ3 using the
graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram …

A new approach to fuzzy clustering is proposed in this paper. It aims to relax some
constraints imposed by known algorithms using a generalized geometrical model for …

Computing the convex hull of a set of points is a fundamental operation in many research
fields, including geometric computing, computer graphics, computer vision, robotics, and so …

This paper presents an alternative GPU-accelerated convex hull algorithm and a novel S
orting-based P reprocessing A pproach (SPA) for planar point sets. The proposed convex …

The convex hull is a fundamental geometrical structure for many applications where groups
of points must be enclosed or represented by a convex polygon. Although efficient …

Many real-world applications demand the computation of a convex hull (CH) when the input
points originate from structured configurations such as two-dimensional (2D) or three …