Abstract
we give a linear time algorithm which, given a simply connected figure of the plane divided into cells, whose boundary is crossed by some colored inputs and outputs, produces non-intersecting directed flow lines which match inputs and outputs according to the colors, in such a way that each edge of any cell is crossed by at most one line. The main tool is the notion of height function, previously introduced for the tilings. This notion appears as the extension of the notion of potential of a flow in a planar graph.
Preview
Unable to display preview. Download preview PDF.
References
T. Chaboud: Pavages et Graphes de Cayley, Ph. D. Thesis, Ecole Normale Supérieure de Lyon (1995).
J. H. Conway, J. C. Lagarias: Tiling with Polyominoes and Combinatorial Group Theory, Journal of Combinatorial Theory A 53 (1990) 183–208.
R. Hassim: maximum flows in (s, t) planar network, Information Processing Letters 13 (1981) p 107.
R. Hassim, D. B. Johnson: An O(n log2 n) algorithm for maximum flow in undirected planar networks, SIAM journal of Computing, 14, (1985) 612–624.
C. Kenyon, R. Kenyon: Tiling a polygon with rectangles, Proceedings of 33rd FOCS (1992) 610–619.
J. Kondev, Ch. L. Henley: Kac-Moody symmetries of critical ground states, Nuclear Physics B 464 [FS] (1996) 540–575.
E. Rémila: Tiling a figure using a height in a tree, Proceedings of the 7th annual ACM-SIAM Symposium On Discrete Algorithms (SODA), SIAM eds, Philadelphia (1996) 168–174.
W. P. Thurston: Conway's tiling group, American Mathematical Monthly (1990) 757–773.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag
About this paper
Cite this paper
Dorkenoo, M., Eglin-Leclerc, MC., Rémila, E. (1998). Construction of non-intersecting colored flows through a planar cellular figure. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028593
Download citation
DOI: https://doi.org/10.1007/BFb0028593
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64230-5
Online ISBN: 978-3-540-69705-3
eBook Packages: Springer Book Archive