#### Filter Results:

- Full text PDF available (14)

#### Publication Year

2009

2018

- This year (3)
- Last 5 years (12)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Saladi Rahul, Ravi Janardan
- SIGSPATIAL/GIS
- 2012

Let <i>S</i> be a set of <i>n</i> points in <i>R</i><sup><i>d</i></sup> where each point has <i>t</i> ≥ 1 real-valued attributes called features. A range-skyline query on <i>S</i> takes as input a… (More)

- Saladi Rahul, Prosenjit Gupta, Ravi Janardan, K. S. Rajan
- WALCOM
- 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… (More)

- John Gunnar Carlsson, Benjamin Armbruster, Saladi Rahul, Haritha Bellam
- Int. J. Comput. Geometry Appl.
- 2015

Motivated by a crane assignment problem, we consider a Euclidean bipartite matching problem with edge-crossing constraints. Speci cally, given n red points and n blue points in the plane, we want to… (More)

- Saladi Rahul, Prosenjit Gupta, K. S. Rajan
- 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… (More)

- Saladi Rahul, Ananda Swarup Das, K. S. Rajan, K. Srinathan
- WALCOM
- 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… (More)

- Saladi Rahul, Haritha Bellam, Prosenjit Gupta, Krishnan Rajan
- CCCG
- 2010

A set of n colored objects (points/hyperboxes) lie in IR. Each object has a weight associated with it. Given a query orthogonal range q, for each distinct color c of the objects in S ∩ q, the tuple 〈… (More)

- Saladi Rahul
- SODA
- 2015

In this paper, new results for two fundamental problems in the field of computational geometry are presented: orthogonal point enclosure query (OPEQ) in R and point location in orthogonal… (More)

- Saladi Rahul, Yufei Tao
- PODS
- 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,… (More)

- Saladi Rahul, Ravi Janardan
- IEEE Trans. Knowl. Data Eng.
- 2014

In a top-k Geometric Intersection Query (top-k GIQ) problem, a set of n weighted, geometric objects in Rd is to be pre-processed into a compact data structure so that for any query geometric object,… (More)

- Jie Xue, Yuan Li, Saladi Rahul, Ravi Janardan
- Symposium on Computational Geometry
- 2018

Given a dataset S of points in R, 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 S ∩ X can be… (More)