Abstract: The paper defines gallery as a bounded connected region which is formed from a sequence of convex quadrangles on a plane. An algorithm for finding the shortest path is presented, and its correctness as well as optimality in the worst case is analyzed.