An Efficient point-in-convex 3D polyhedron test using a projective algorithm with sub-linear expected complexity
Crossref DOI link: https://doi.org/10.1007/s00138-025-01743-3
Published Online: 2025-10-12
Published Print: 2025-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Skala, Vaclav
Text and Data Mining valid from 2025-10-12
Version of Record valid from 2025-10-12
Article History
Received: 11 February 2025
Revised: 5 June 2025
Accepted: 28 August 2025
First Online: 12 October 2025
Declarations
:
: The author declares no Conflict of interest.