• Publications
  • Influence
Algorithms for range-skyline queries
Let S be a set of n points in Rd where each point has t ≥ 1 real-valued attributes called features. A range-skyline query on S takes as input a query box q ε Rd and returns the skyline of the pointsExpand
  • 11
  • 3
Range-Aggregate Queries Involving Geometric Aggregation Operations
In this paper we consider range-aggregate query problems wherein we wish to preprocess a set S of geometric objects such that given a query orthogonal range q, a certain aggregation function on theExpand
  • 8
  • 2
Efficient Top-k Queries for Orthogonal Ranges
Advances in sensing and data gathering technologies have resulted in an explosion in the volume of data that is being generated, processed, and archived. In particular, this information overloadExpand
  • 16
  • 1
A Bottleneck Matching Problem with Edge-Crossing Constraints
Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Specifically, given n red points and n blue points in the plane, we want toExpand
  • 17
  • 1
Improved Bounds for Orthogonal Point Enclosure Query and Point Location in Orthogonal Subdivisions in ℝ3
  • S. Rahul
  • Computer Science, Mathematics
  • SODA
  • 4 January 2015
In this paper, new results for two fundamental problems in the field of computational geometry are presented: orthogonal point enclosure query (OPEQ) in R3 and point location in orthogonalExpand
  • 12
  • 1
On Top-k Range Reporting in 2D Space
<i>Orthogonal range reporting</i> (ORR) is a classic problem in computational geometry and databases, where the objective is to preprocess a set <i>P</i> of points in <b>R</b><sup>2</sup> such that,Expand
  • 10
  • 1
Range aggregate structures for colored geometric objects
A set of n colored objects (points/hyperboxes) lie in IR d and given a query orthogonal range q, we need to report the distinct colors of the objects in S \ q. In a scenarto where these coloredExpand
  • 5
  • 1
Approximate Range Counting Revisited
  • Saladi Rahul
  • Computer Science, Mathematics
  • Symposium on Computational Geometry
  • 1 December 2015
This work presents new results on approximate range counting. If the actual count is $k$, then the data structures in this paper output a value, $\tau$, lying in the rangeExpand
  • 7
  • 1
Data Structures for Range Aggregation by Categories
We solve instances of a general class of problems defined as follows: Preprocess a set S of possibly weighted colored geometric objects (e.g. points/orthogonal segments/rectangles) in R, d ≥ 1 suchExpand
  • 3
  • 1
New bounds for range closest-pair problems
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair inExpand
  • 8