Sciweavers

329 search results - page 4 / 66
» On Range Searching with Semialgebraic Sets
Sort
View
CCCG
2010
13 years 9 months ago
I/O-efficient triangular range search and its application
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...
Gautam K. Das, Bradford G. Nickerson
FSTTCS
2004
Springer
14 years 25 days ago
Approximate Range Searching Using Binary Space Partitions
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, ...
Mark de Berg, Micha Streppel
WEBDB
2007
Springer
128views Database» more  WEBDB 2007»
14 years 1 months ago
Supporting Range Queries on Web Data Using k-Nearest Neighbor Search
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...
GI
2009
Springer
13 years 5 months ago
Combined Optimization of Aircraft Maneuvers and RF Measurements for Passive Air-Air Ranging
: 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...
Ronald Matthew Yannone, Melvin Carroll
STOC
2012
ACM
272views Algorithms» more  STOC 2012»
11 years 10 months ago
The cell probe complexity of dynamic range counting
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...
Kasper Green Larsen