Algorithms for Point-Polygon Collision Oetection in 20
Abstract
ln this article, several algorithms for the collision detection between a point and a polygon on a plane are presented. Coverings by triangles and barycentric coordinates are used. Temporal and geometric coherence are usedfor reducing their performance times. A study of times has been carried out; it shows that these simple and robust algorithms are efficient. Also, these algorithms can be used for non convex figures and they have the advantage of being easily extended to JD.
BibTeX
@inproceedings {10.2312:pt.20021418,
booktitle = {SIACG2002 - 1st lbero-American Symposium in Computer Graphics},
editor = {Xavier Pueyo and Manuel Próspero dos Santos and Luiz Velho},
title = {{Algorithms for Point-Polygon Collision Oetection in 20}},
author = {Delgado, Juan J. Jiménez and Sánchez, Rafael J. Segura and Higueruela, Francisco R. Feito},
year = {2022},
publisher = {The Eurographics Association},
ISBN = {978-3-03868-194-6},
DOI = {10.2312/pt.20021418}
}
booktitle = {SIACG2002 - 1st lbero-American Symposium in Computer Graphics},
editor = {Xavier Pueyo and Manuel Próspero dos Santos and Luiz Velho},
title = {{Algorithms for Point-Polygon Collision Oetection in 20}},
author = {Delgado, Juan J. Jiménez and Sánchez, Rafael J. Segura and Higueruela, Francisco R. Feito},
year = {2022},
publisher = {The Eurographics Association},
ISBN = {978-3-03868-194-6},
DOI = {10.2312/pt.20021418}
}
Collections
Except where otherwise noted, this item's license is described as Attribution 4.0 International License