A tight upper bound for the number of intersections between two rectangular paths

The problem of finding the number of intersections between two geometric figures in the plane has been studied extensively in literature. In this paper, the geometric figure comprising a continuous rectilinear path (called rectangular path) is considered, and a tight (least) upper bound on I(P, Q), the number of intersections between two rectangular paths P and Q, is given.