 | 2011 |
|---|
| 8 |       | Rajasekhar Inkulu,
Sanjiv Kapoor:
ANN queries: covering Voronoi diagram with hyperboxes
CoRR abs/1111.5893: (2011) |
| 2010 |
|---|
| 7 | | Rajasekhar Inkulu,
Sanjiv Kapoor,
S. N. Maheshwari:
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
CoRR abs/1011.6481: (2010) |
| 6 | | Rajasekhar Inkulu,
Sanjiv Kapoor:
Approximate Shortest Path through a Weighted Planar Subdivision
CoRR abs/1011.6498: (2010) |
| 2009 |
|---|
| 5 | | Milind Kulkarni,
Martin Burtscher,
Rajasekhar Inkulu,
Keshav Pingali,
Calin Cascaval:
How much parallelism is there in irregular applications?
PPOPP 2009: 3-14 |
| 4 | | Rajasekhar Inkulu,
Sanjiv Kapoor:
Visibility queries in a polygonal region.
Comput. Geom. 42(9): 852-864 (2009) |
| 3 | | Rajasekhar Inkulu,
Sanjiv Kapoor:
Planar rectilinear shortest path computation using corridors.
Comput. Geom. 42(9): 873-884 (2009) |
| 2007 |
|---|
| 2 | | Rajasekhar Inkulu,
Sanjiv Kapoor:
Finding a Rectilinear Shortest Path in R2 Using Corridor Based Staircase Structures.
FSTTCS 2007: 412-423 |
| 2001 |
|---|
| 1 | | Karen Daniels,
Rajasekhar Inkulu:
Translational polygon covering using intersection graphs.
CCCG 2001: 61-64 |
Data released under the ODC-BY 1.0 license — See also our legal information page