A new fully projective O(log N) point-in-convex polygon algorithm: a new strategy

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F25%3A43976559" target="_blank" >RIV/49777513:23520/25:43976559 - isvavai.cz</a>
Result on the web
<a href="https://link.springer.com/article/10.1007/s00371-024-03693-9" target="_blank" >https://link.springer.com/article/10.1007/s00371-024-03693-9</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00371-024-03693-9" target="_blank" >10.1007/s00371-024-03693-9</a>

Result language
angličtina
Original language name
A new fully projective O(log N) point-in-convex polygon algorithm: a new strategy
Original language description
A novel and fully projective algorithm for a point-in-convex polygon test with computational complexity of O(log N) in 2D isdescribed in this contribution. The polygon vertices and tested points can be given in projective space without conversion toEuclidean space. The proposed algorithm is simple, robust, easy to implement, and invariant to the convex polygon orientation.It can be easily modified for use in Euclidean space and CPU implementation. Vector–vector operations are used, makingit suitable for implementation using SSE, AVX, and FMA instructions.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2025
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)