2 papers
cs.CG2026
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…
cs.CG2026
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…