Delgado, Juan J. JiménezSánchez, Rafael J. SeguraHigueruela, Francisco R. FeitoXavier PueyoManuel Próspero dos SantosLuiz Velho2023-01-242023-01-242022978-3-03868-194-6https://doi.org/10.2312/pt.20021418https://diglib.eg.org:443/handle/10.2312/pt20021418ln 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.Attribution 4.0 International LicenseCollision detection, inclusion test, animation, simulation, coherenceCollision detectioninclusion testanimationsimulationcoherence10.2312/pt.20021418253-2619 pages