This thesis examines algorithmic problems involving k-crossing visibility. Given two points p and q and a set of polygonal obstacles in the plane, where p and q are in general position relative to the vertices of the ...