Abstract. We present the first adaptive data structure for two-dimensional orthogonal range search. Our data structure is adaptive in the sense that it gives improved search perfo...
Diego Arroyuelo, Francisco Claude, Reza Dorrigiv, ...
Abstract. We study the following one-dimensional range reporting problem: On an array A of n elements, support queries that given two indices i ≤ j and an integer k report the k ...
: - In this paper we present several novel efficient techniques and multidimensional data structures which can improve the decision making process in many domains. We consider onli...
We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile ho...
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...