A SIMPLE AND FAST HARDWARE-ACCELERATED POINT-IN-POLYGON TEST

F. Martínez, A. J. Rueda, F. R. Feito

2007

Abstract

The new generations of GPUs bring us a set of new basic operations or tools that allow us to design new solutions to traditional problems in Computer Graphics. In this paper we present two approaches for the point- in-polygon problem based on the occlusion query extensions supported by modern GPUs. Both approaches are fast and their execution times do not depend on the number of edges of the polygon. Besides, one of the tests allows multiple point-in-polygon queries to be done in parallel with CPU computations.

Paper Citation

in Harvard Style

Martínez F., J. Rueda A. and R. Feito F. (2007). A SIMPLE AND FAST HARDWARE-ACCELERATED POINT-IN-POLYGON TEST . In Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP, ISBN 978-972-8865-71-9, pages 161-165. DOI: 10.5220/0002072501610165

in Bibtex Style

@conference{grapp07,
author={F. Martínez and A. J. Rueda and F. R. Feito},
title={A SIMPLE AND FAST HARDWARE-ACCELERATED POINT-IN-POLYGON TEST},
booktitle={Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,},
year={2007},
pages={161-165},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002072501610165},
isbn={978-972-8865-71-9},
}

in EndNote Style

TY - CONF
JO - Proceedings of the Second International Conference on Computer Graphics Theory and Applications - Volume 1: GRAPP,
TI - A SIMPLE AND FAST HARDWARE-ACCELERATED POINT-IN-POLYGON TEST
SN - 978-972-8865-71-9
AU - Martínez F.
AU - J. Rueda A.
AU - R. Feito F.
PY - 2007
SP - 161
EP - 165
DO - 10.5220/0002072501610165