#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2008

2017

- This year (1)
- Last 5 years (6)
- Last 10 years (13)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Thanh-Tung Cao, Ke Tang, Anis Mohamed, Tiow Seng Tan
- SI3D
- 2010

We propose a Parallel Banding Algorithm (PBA) on the GPU to compute the exact Euclidean Distance Transform (EDT) for a binary image in 2D and higher dimensions. Partitioning the image into smallâ€¦ (More)

- Meng Qi, Thanh-Tung Cao, Tiow Seng Tan
- IEEE Transactions on Visualization and Computerâ€¦
- 2012

We propose the first GPU solution to compute the 2D constrained Delaunay triangulation (CDT) of a planar straight line graph (PSLG) consisting of points and edges. There are many CPU algorithmsâ€¦ (More)

The proliferation of data in graph form calls for the development of scalable graph algorithms that exploit parallel processing environments. One such problem is the computation of a graph's minimumâ€¦ (More)

- Mingcen Gao, Thanh-Tung Cao, Ashwin Nanjappa, Tiow Seng Tan, Zhiyong Huang
- ACM Trans. Math. Softw.
- 2013

A novel algorithm is presented to compute the convex hull of a point set in ℝ<sup>3</sup> using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagramâ€¦ (More)

- Mingcen Gao, Thanh-Tung Cao, Tiow Seng Tan, Zhiyong Huang
- I3D
- 2013

Flipping is a local and efficient operation to construct the convex hull in an incremental fashion. However, it is known that the traditional flip algorithm is not able to compute the convex hullâ€¦ (More)

We propose the first algorithm to compute the 3D Delaunay triangulation (DT) on the GPU. Our algorithm uses massively parallel point insertion followed by bilateral flipping, a powerful localâ€¦ (More)

- Mingcen Gao, Thanh-Tung Cao, Tiow Seng Tan, Zhiyong Huang
- SI3D
- 2011

We present a novel approach, termed gHull, to compute the convex hull for a 3D point set using the GPU. We exploit the fast computation of the digital Voronoi diagram and its relationship with theâ€¦ (More)

- Guodong Rong, Tiow Seng Tan, Thanh-Tung Cao, Stephanus
- SI3D
- 2008

This paper presents a novel approach to compute, for a given point set S in R<sup>2</sup>, its Delaunay triangulation <i>T (S)</i>. Though prior work mentions the possibility of using the graphicsâ€¦ (More)

We present a novel algorithm to compute the convex hull of a point set in R using the graphics processing unit (GPU). By exploiting the relationship between the Voronoi diagram and the convex hull,â€¦ (More)

- Meng Qi, Thanh-Tung Cao
- 2011

This paper presents a novel approach, termed GPU-CDT, to compute the constrained Delaunay triangulation (CDT) for a planar straight line graph (PSLG), consisting of points and edges, using theâ€¦ (More)