GEOMETRIC ALGORITHMS ON CUDA

Antonio J. Rueda, Lidia Ortega

2008

Abstract

The recent launch of the NVIDIA CUDA technology has opened a new era in the young field of GPGPU (General Purpose computation on GPUs). This technology allows the design and implementation of parallel algorithms in a much simpler way than previous approaches based on shader programming. The present work explores the possibilities of CUDA for solving basic geometric problems on 3D meshes like the point inclusion test or the self-intersection detection. A solution to these problems can be implemented in CUDA with only a small fraction of the effort required to design and implement an equivalent solution using shader programming, and the results are impressive when compared to a CPU execution.

Paper Citation

in Harvard Style

J. Rueda A. and Ortega L. (2008). GEOMETRIC ALGORITHMS ON CUDA . In Proceedings of the Third International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2008) ISBN 978-989-8111-20-3, pages 107-112. DOI: 10.5220/0001094201070112

in Bibtex Style

@conference{grapp08,
author={Antonio J. Rueda and Lidia Ortega},
title={GEOMETRIC ALGORITHMS ON CUDA},
booktitle={Proceedings of the Third International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2008)},
year={2008},
pages={107-112},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0001094201070112},
isbn={978-989-8111-20-3},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Third International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, (VISIGRAPP 2008)
TI - GEOMETRIC ALGORITHMS ON CUDA
SN - 978-989-8111-20-3
AU - J. Rueda A.
AU - Ortega L.
PY - 2008
SP - 107
EP - 112
DO - 10.5220/0001094201070112