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 ...
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 ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
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...
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 ...
– 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 ...