40 citations · 60 across the 9 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CG2010
Approximate Shortest Path through a Weighted Planar Subdivision
Rajasekhar Inkulu, Sanjiv Kapoor
This paper presents an approximation algorithm for finding a shortest path between two points and in a weighted planar subdivision $\PS$. Each face of $\PS$ is associat…
cs.CG2010★ 15 cited
A near optimal algorithm for finding Euclidean shortest path in polygonal domain
Rajasekhar Inkulu, Sanjiv Kapoor, S. N. Maheshwari
We present an algorithm to find an {\it Euclidean Shortest Path} from a source vertex to a sink vertex in the presence of obstacles in . Our algorithm takes $O(T+m(\…