4 papers
Two-point Approximate Shortest Path Queries among Convex Polygonal Obstacles in the Plane
Siddharth Gaur, R. Inkulu
Given a polygonal domain consisting pairwise disjoint convex polygonal obstacles together defined with vertices and a positive real number in , this…
A Recursive Algorithm for Routing amid Convex Polygonal Obstacles
Siddharth Gaur, R. Inkulu
Given a polygonal domain comprising pairwise disjoint convex polygonal obstacles in the plane, together defined with vertices, this paper presents an algorithm to…
Local Routing on a Convex Polytope in R^3
Sreehari Chandran, R. Inkulu
Given a convex polytope P defined with n vertices in \mathbb{R}^3 and a parameter ε\in (0, 1), this paper presents an algorithm to preprocess P to compute routing tables at every…
Constant Workspace Algorithms for Computing Relative Hulls in the Plane
Himanshu Chhabra, R. Inkulu
Constant workspace algorithms use a constant number of words in addition to the read-only input to the algorithm. In this paper, we devise algorithms to efficiently compute relativ…