Building an Optimal Point-Location Structure in $$O( sort (n))$$ O ( s o r t ( n ) ) I/Os
Crossref DOI link: https://doi.org/10.1007/s00453-018-0518-2
Published Online: 2018-09-28
Published Print: 2019-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Hu, Xiaocheng
Sheng, Cheng
Tao, Yufei
Text and Data Mining valid from 2018-09-28
Article History
Received: 30 April 2016
Accepted: 10 September 2018
First Online: 28 September 2018