activity
20122025
most citedJulia Language in Machine Learning: Algorithms, Applications, and Open Issues

81 citations · 256 across the 26 of their papers we have counts for

collaborators
Showing cs.CGShow all

10 papers · 1 filter

cs.CG2016★ 1 cited

A Parallel Solution to Finding Nodal Neighbors in Generic Meshes

Gang Mei, Nengxiong Xu, Hong Tian +1

In this paper we specifically present a parallel solution to finding the one-ring neighboring nodes and elements for each vertex in generic meshes. The finding of nodal neighbors i…

cs.CG2015★ 1 cited

gScan: Accelerating Graham Scan on the GPU

Gang Mei

This paper presents a fast implementation of the Graham scan on the GPU. The proposed algorithm is composed of two stages: (1) two rounds of preprocessing performed on the GPU and…

cs.CG2015★ 15 cited

CudaChain: A Practical GPU-accelerated 2D Convex Hull Algorithm

Gang Mei

This paper presents a practical GPU-accelerated convex hull algorithm and a novel Sorting-based Preprocessing Approach (SPA) for planar point sets. The proposed algorithm consists…

cs.CG2015★ 8 cited

A Novel Implementation of QuickHull Algorithm on the GPU

Jiayin Zhang, Gang Mei, Nengxiong Xu +1

We present a novel GPU-accelerated implementation of the QuickHull algorihtm for calculating convex hulls of planar point sets. We also describe a practical solution to demonstrate…

cs.CG2014

A Straightforward Preprocessing Approach for Accelerating Convex Hull Computations on the GPU

Gang Mei

An effective strategy for accelerating the calculation of convex hulls for point sets is to filter the input points by discarding interior points. In this paper, we present such a…

cs.CG2012

A Hybrid Approach for Optimizing Planar Triangular Meshes

Gang Mei, John C. Tipper, Nengxiong Xu

Modified Direct Method (MDM) is an iterative scheme based on Jacobi iterations for smoothing planar meshes [4]. The basic idea behind MDM is to make any triangular element be as cl…

cs.CG2012★ 8 cited

An Algorithm for Finding Convex Hulls of Planar Point Sets

Gang Mei, John C. Tipper, Nengxiong Xu

This paper presents an alternate choice of computing the convex hulls (CHs) for planar point sets. We firstly discard the interior points and then sort the remaining vertices by x-…

cs.CG2012★ 16 cited

Ear-clipping Based Algorithms of Generating High-quality Polygon Triangulation

Gang Mei, John C. Tipper, Nengxiong Xu

A basic and an improved ear clipping based algorithm for triangulating simple polygons and polygons with holes are presented. In the basic version, the ear with smallest interior a…

cs.CG2012

T-Base: A Triangle-Based Iterative Algorithm for Smoothing Quadrilateral Meshes

Gang Mei, John C. Tipper, Nengxiong Xu

We present a novel approach named TBase for smoothing planar and surface quadrilateral meshes. Our motivation is that the best shape of quadrilateral element (square) can be virtua…

cs.CG2012★ 5 cited

The Modified Direct Method: an Approach for Smoothing Planar and Surface Meshes

Gang Mei, John C. Tipper, Nengxiong Xu

The Modified Direct Method (MDM) is an iterative mesh smoothing method for smoothing planar and surface meshes, which is developed from the non-iterative smoothing method originate…