A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Lower Bounds for Sorted Geometric Queries in the I/O Model
[chapter]

2012
*
Lecture Notes in Computer Science
*

We study sorted geometric query problems, a class of problems that, to the best of our knowledge and despite their applications, have not received much attention so far. Two of the most prominent problems in this class are angular sorting queries and sorted K-nearest neighbour queries. The former asks us to preprocess an input point set S in the plane so that, given a query point q, the clockwise ordering of the points in S around q can be computed efficiently. In the latter problem, the output

doi:10.1007/978-3-642-33090-2_6
fatcat:ojvmxpckh5c27jich47vrupneu