Path planning among polygonal obstacles is a well-known problem in robotics. In this paper, we consider the problem of planning a collision-free path for a robot in a polygonal domain from a given source point to a given ...

Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a segment connecting two points of s and t without intersecting edges...