Planar Point Location for Large Data Sets: To Seek or Not to Seek

We present an algorithm for external memory planar point location that is both effective and easy to implement. The base algorithm is an external memory variant of the bucket method by Edahiro, Kokubo and Asano that is combined with Lee and Yang's batched internal memory algorithm for planar point location. Although our algorithm is not optimal in terms of its worst-case behavior, we show its efficiency for both batched and single-shot queries by experiments with real-world data. The experiments show that the algorithm benefits from its mainly sequential disk access pattern and significantly outperforms the fastest algorithm for internal memory.

• Type: Conference
• Year: 2000
• Where: WAE
• Authors: Jan Vahrenhold, Klaus Hinrichs
• Keywords: Algorithm, Internal Memory Algorithm, Planar Point Location, WAE 2000, WAE 2001