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

.

##
###
Two-Dimensional Range Diameter Queries
[chapter]

2012
*
Lecture Notes in Computer Science
*

Given a set of n points in the plane, range diameter queries ask for the furthest pair of points in a given axis-parallel rectangular range. We provide evidence for the hardness of designing space-efficient data structures that support range diameter queries by giving a reduction from the set intersection problem. The difficulty of the latter problem is widely acknowledged and is conjectured to require nearly quadratic space in order to obtain constant query time, which is matched by known data

doi:10.1007/978-3-642-29344-3_19
fatcat:cib7ffpsrjejnfhn4pdge75scm