In this paper, we consider a special type of triangular range search for a planar point set S in the I/O-model. Here, two sides of the query triangle are parallel to the coordinat...
We show how any BSP tree TP for the endpoints of a set of n disjoint segments in the plane can be used to obtain a BSP tree of size O(n · depth(TP )) for the segments themselves, ...
A large volume of geospatial data is available on the web through various forms of applications. However, access to these data is limited by certain types of queries due to restric...
Wan D. Bae, Shayma Alkobaisi, Seon Ho Kim, Sada Na...
: When a tactical aircraft sets out on a mission in dense airborne and surface RF (radio frequency) emitter environment, the pilot desires to minimize the use of the onboard fire c...
In this paper we develop a new technique for proving lower bounds on the update time and query time of dynamic data structures in the cell probe model. With this technique, we pro...