10246

2D Triangulation of Polygons on CUDA

Shadi Alawneh, Dennis Peters
Electrical and Computer Engineering, Faculty of Engineering and Applied Science, Memorial University of Newfoundland
The 2013 International Conference on High Performance Computing & Simulation (HPCS 2013), 2013

@article{alawneh20132d,

   title={2D Triangulation of Polygons on CUDA},

   author={Alawneh, Shadi and Peters, Dennis},

   year={2013}

}

Download Download (PDF)   View View   Source Source   

1182

views

General Purpose computing on Graphics Processor Units (GPGPU) brings massively parallel computing (hundreds of compute cores) to the desktop at a reasonable cost, but requires that algorithms be carefully designed to take advantage of this power. The present work explores the possibilities of CUDA (NVIDIA Compute Unified Device Architecture) using GPGPU approach for 2D Triangulation of Polygons. We have conducted an experiment to measure the performance of the GPU with respect to the CPU. The experiment consists of implementing a serial and a parallel algorithm to triangulate 2D polygons and executing both algorithms on several different sets of polygons to compare the performance. We also present an application that uses the polygon triangulation.
VN:F [1.9.22_1171]
Rating: 0.0/5 (0 votes cast)

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: