Crossmark

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

Crossref DOI link: https://doi.org/10.1007/s00371-024-03693-9

Published Online: 2024-11-29

Published Print: 2025-05

Update policy: https://doi.org/10.1007/springer_crossmark_policy

Authors

Skala, Vaclav https://orcid.org/0000-0001-8886-4281
License Information

Text and Data Mining valid from 2024-11-29

Version of Record valid from 2024-11-29
More Information

Article History

Accepted: 14 October 2024

First Online: 29 November 2024

Declarations

:

: The author declares no conflict of interest.