Algorithms for Point-Polygon Collision Oetection in 20

Simple item page
dc.contributor.authorDelgado, Juan J. Jiménezen_US
dc.contributor.authorSánchez, Rafael J. Seguraen_US
dc.contributor.authorHigueruela, Francisco R. Feitoen_US
dc.contributor.editorXavier Pueyoen_US
dc.contributor.editorManuel Próspero dos Santosen_US
dc.contributor.editorLuiz Velhoen_US
dc.date.accessioned2023-01-24T14:15:56Z
dc.date.available2023-01-24T14:15:56Z
dc.date.issued2022
dc.description.abstractln 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.en_US
dc.description.sectionheadersAlgorithms and Data Structures
dc.description.seriesinformationSIACG2002 - 1st lbero-American Symposium in Computer Graphics
dc.identifier.doi10.2312/pt.20021418
dc.identifier.isbn978-3-03868-194-6
dc.identifier.pages253-261
dc.identifier.pages9 pages
dc.identifier.urihttps://doi.org/10.2312/pt.20021418
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/pt20021418
dc.publisherThe Eurographics Associationen_US
dc.rightsAttribution 4.0 International License
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.subjectCollision detection, inclusion test, animation, simulation, coherence
dc.subjectCollision detection
dc.subjectinclusion test
dc.subjectanimation
dc.subjectsimulation
dc.subjectcoherence
dc.titleAlgorithms for Point-Polygon Collision Oetection in 20en_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
253-261.pdf
Size:
3.3 MB
Format:
Adobe Portable Document Format
Download
Collections
Portuguese Meeting on Computer Graphics 2002