| Issue |
RAIRO-Theor. Inf. Appl.
Volume 38, Number 3, July-September 2004
|
|
|---|---|---|
| Page(s) | 229 - 243 | |
| DOI | https://doi.org/10.1051/ita:2004011 | |
| Published online | 15 June 2004 | |
Algebraic tools for the construction of colored flows with boundary constraints
1
Groupe de Recherche en Informatique et
Mathématiques Appliquées, IUT Roanne (Université Jean Monnet
Saint-Etienne), 20 avenue de Paris,
42334 Roanne Cedex,
France; dorkenoo@univ-st-etienne.fr.; leclermc@univ-st-etienne.fr.
2
Laboratoire de l'Informatique du Parallélisme, UMR 5668
CNRS-INRIA-Univ. Lyon 1-ENS Lyon, 46 allée d'Italie,
69364 Lyon Cedex 07, France;
Eric.Remila@ens-lyon.fr.
Received:
26
November
2003
Accepted:
2
March
2004
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 tilings. It appears as an extension of the notion of potential of a flow in a planar graph.
Mathematics Subject Classification: 05C25 / 05C85
Key words: Height function / planar flows
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.