Skip to main content
SpringerLink
Log in

Construction of non-intersecting colored flows through a planar cellular figure

  • Algorithms and Data Structures V
  • Conference paper
  • First Online:
Book cover STACS 98 (STACS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1373))

Included in the following conference series:

  • 175 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Chaboud: Pavages et Graphes de Cayley, Ph. D. Thesis, Ecole Normale Supérieure de Lyon (1995).

    Google Scholar 

  2. J. H. Conway, J. C. Lagarias: Tiling with Polyominoes and Combinatorial Group Theory, Journal of Combinatorial Theory A 53 (1990) 183–208.

    MathSciNet  Google Scholar 

  3. R. Hassim: maximum flows in (s, t) planar network, Information Processing Letters 13 (1981) p 107.

    Article  MathSciNet  Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. C. Kenyon, R. Kenyon: Tiling a polygon with rectangles, Proceedings of 33rd FOCS (1992) 610–619.

    Google Scholar 

  6. J. Kondev, Ch. L. Henley: Kac-Moody symmetries of critical ground states, Nuclear Physics B 464 [FS] (1996) 540–575.

    MathSciNet  Google Scholar 

  7. 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.

    Google Scholar 

  8. W. P. Thurston: Conway's tiling group, American Mathematical Monthly (1990) 757–773.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Grima, IUT Roanne, Université J. Monnet, 20 avenue de Paris, 42334, Roanne cedex, France

    Marius Dorkenoo, Marie-Christine Eglin-Leclerc & Eric Rémila

  2. LIP, ENS-Lyon, CNRS ura 1398 46 allée d'Italie, 69364, Lyon cedex 07, France

    Eric Rémila

Authors
  1. Marius Dorkenoo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marie-Christine Eglin-Leclerc
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Eric Rémila
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints 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

Publish with us

Policies and ethics

Search

Navigation