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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
B. Chazelle: A theorem on polygon cutting with applications,Proc. 23rd Annual IEEE Symp. Found. Comput. Sci., 1982, 67–72.
B. Chazelle, andJ. Incerpi: Triangulation and shape complexity,ACM Trans. on Graphics 3 (1984), 135–152.
J. Edmonds: Minimum partition of a matroid into independent subsets, Proceedings of the First Conference on Matroids,J. Res. Nat. Bur. Standards Sect. B 69 (1965), 67–72.
A. Fournier, andD. Y. Montuno: Triangulating simple polygons and equivalent problems,ACM Trans. on Graphics 3 (1984), 153–174.
H.-D. O. F. Gronau, W. Just, W. Schade, P. Scheffer, andJ. Wojciechowski: Path systems in acyclic directed graphs, Proceedings of the International Conference “Combinatorial Analysis and Its Applications” (Pokrzywna, Poland, Sept. 16–20, 1985),Zastosowania Matematyki 19 (4), to appear.
P. John, andH. Sachs: Calculating the number of perfect matchings and Pauling's bond orders in hexagonal systems whose inner dual is a tree, in:Graphs, Hypergraphs, and Applications, Proceedings of the Conference on Graph Theory held in Eyba, October 1984, (Teubner-Texte zur Mathematik 73), BSB B. G. Teubner Verlagsgesellschaft Leipzig, Leipzig 1985, 80–91.
P. John, andH. Sachs: Wegesysteme und Linearfaktoren in hexagonalen und quadratischen Systemen, in:Graphen in Forschung und Unterricht (Festschrift K. Wagner), Herausgeber R. Bodendiek et al., Verlag B. Franzbecker, Bad Salzdetfurth 1985, 85–101.
P. John, H. Sachs, andH. Zernits: Counting perfect matchings in polyominoes, Proceedings of the International Conference “Combinatorial Analysis and Its Applications” (Pokrzywna, Poland, Sept. 16–20, 1985),Zastosowania Matematyki 19 (4), to appear.
H. Sachs: Perfect matchings in hexagonal systems,Combinatorica 4 (1984), 89–99.
Author information
Authors and Affiliations
Additional information
The first author's research is supported by the Natural Sciences and Engineering Research Council of Canada