Abstract
A monotone path system (MPS) is a finite set of pairwise disjoint paths (polygonal areas) in thexy-plane such that every horizontal line intersects each of the paths in at most one point. A MPS naturally determines a “pairing” of its top points with its bottom points. We consider a simple polygon Δ in thexy-plane wich bounds the simple polygonal (closed) regionD. LetT andB be two finite, disjoint, equicardinal sets of points ofD. We give a good characterization for the existence of a MPS inD which pairsT withB, and a good algorithm for finding such a MPS, and we solve the problem of finding all MPSs inD which pairT withB. We also give sufficient conditions for any such pairing to be the same.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
