Author pages are created from data sourced from our academic publisher partnerships and public sources.

- Publications
- Influence

Algorithms for range-skyline queries

- S. Rahul, R. Janardan
- Computer Science
- SIGSPATIAL/GIS
- 6 November 2012

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 points… Expand

Range-Aggregate Queries Involving Geometric Aggregation Operations

- S. Rahul, A. Das, K. Rajan, K. Srinathan
- Computer Science
- WALCOM
- 18 February 2011

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 the… Expand

Efficient Top-k Queries for Orthogonal Ranges

- Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan
- Computer Science
- WALCOM
- 18 February 2011

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 overload… Expand

A Bottleneck Matching Problem with Edge-Crossing Constraints

- John Gunnar Carlsson, Benjamin Armbruster, Saladi Rahul, Haritha Bellam
- Mathematics, Computer Science
- Int. J. Comput. Geom. Appl.
- 1 December 2015

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 to… Expand

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 orthogonal… Expand

On Top-k Range Reporting in 2D Space

- Saladi Rahul, Yufei Tao
- Mathematics, Computer Science
- PODS '15
- 20 May 2015

<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

Range aggregate structures for colored geometric objects

- S. Rahul, H. Bellam, Prosenjit Gupta, K. Rajan
- Mathematics, Computer Science
- CCCG
- 2010

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 colored… Expand

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 range… Expand

Data Structures for Range Aggregation by Categories

- S. Rahul, Prosenjit Gupta, K. Rajan
- Computer Science
- CCCG
- 2009

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 such… Expand

New bounds for range closest-pair problems

- Jie Xue, Y. Li, S. Rahul, R. Janardan
- Computer Science, Mathematics
- Symposium on Computational Geometry
- 28 December 2017

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 in… Expand