736 search results - page 7 / 148 » A dynamic data structure for approximate range searching |
IJRR
2006
13 years 9 months ago
2006
Future space applications will require robotic systems to assemble, inspect, and maintain large space structures in orbit. For effective planning and control, robots will need to ...
WADS
2009
Springer
14 years 3 months ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
FOCS
1992
IEEE
14 years 1 months ago
1992
IEEE
We describe dynamic data structures for half-space range reporting and for maintaining the minima of a decomposable function. Using these data structures, we obtain efficient dyna...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
ICRA
2005
IEEE
14 years 2 months ago
2005
IEEE
– Future space missions are expected to use robotic systems to assemble, inspect, and maintain large space structures in orbit. To carry out these tasks, robots need to know the ...