B.Tech and MS by research in Computer Science EngineeringAreas of Interest Algorithms and Data Structures, Computational Geometry, Moving Objects Databases Email: srahul** |

An interesting problem was to detect if a collision will occur among objects moving in a time-parameterized motion inside a given query region. A brute-force method takes O(n*n) (quadratic) query time. The objective was to come up with o(n*n) (sub-quadratic) query time solution while using linear or near-linear space. We also introduced and implemented an external memory data structure (named ETPR-tree) built upon a set of moving objects (which are subject to updates) to predict which of them would lie within a query region and a future query time-interval.

- Efficient top-k queries for orthogonal ranges. 5th Workshop on Algorithms and
Computation (WALCOM 2011).
*Saladi Rahul, Prosenjit Gupta, Ravi Janardan and K. S. Rajan*.

- Range-Aggregate Queries Involving Geometric Aggregation Operations. 5th Workshop on Algorithms and
Computation (WALCOM 2011).
*Saladi Rahul, Ananda Swarup Das, K. S. Rajan and Kannan Srinathan*.

- Range Aggregate Structures for Colored Geometric Objects. (extended version under journal review) Canadian Conference on Computational Geometry 2010.
*Saladi Rahul, Haritha Bellam, Prosenjit Gupta and K. S. Rajan*.

- Data Structures for Range Aggregation by Categories. (extended version under journal review) Canadian Conference on Computational Geometry 2009.
*Saladi Rahul, Prosenjit Gupta and K. S. Rajan*.

- One-Reporting Queries. European Workshop on Computational Geometry 2010 (EuroCG 2010).
*Saladi Rahul and K. S. Rajan*(Preliminary version).

- One-Reporting Queries. The First International Conference on Computer Science and Information Technology (COSIT-2011).
*Saladi Rahul and K. S. Rajan*(Full version).

- Main Memory Algorithms for Colored Range Searching.
*Haritha Bellam, Saladi Rahul and K. S. Rajan*.

- Minimum Bounding Polygon and Enhanced Time Parameterized R-tree - an efficient way to locate moving objects.
*Saladi Rahul and K. S. Rajan*