Advertisement

On continuous homotopic one layer routing

Extended abstract
  • Shaodi Gao
  • Mark Jerrum
  • Michael Kaufmann
  • Kurt Mehlhorn
  • Wolfgang Rülling
  • Christoph Storb
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 333)

Abstract

We give an O(n3 · log n) time and O(n3) space algorithm for the continuous homotopic one layer routing problem. The main contribution is an extension of the sweep paradigm to a universal cover space of the plane.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. [CS]
    R. Cole and A. Siegel, ”River Routing every which way, but loose,” 24th Annual Symposium on Foundations of Computer Science (November 1983), pp. 112–121.Google Scholar
  2. [LM]
    C. E. Leiserson and F. M. Maley, ”Algorithms for Routing and Testing Routability of Planar VLSI Layouts”, 17th Annual ACM Symposium on Theory of Computing (May 1985), pp. 69–78.Google Scholar
  3. [M]
    F. M. Maley, ”Single-Layer Wire Routing”, Ph. D. Thesis, Massachusetts Institute of Technology, August 1987.Google Scholar
  4. [ST]
    H. Seifert and W. Threlfall, ”Lehrbuch der Topologie”, Chelsea Publishing Company, 1947.Google Scholar
  5. [T]
    M. Tompa, ”An Optimal Solution to a Wire-Routing Problem”, Journal of Computer and System Sciences 23, pp. 127–150.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Shaodi Gao
    • 1
  • Mark Jerrum
    • 2
  • Michael Kaufmann
    • 1
  • Kurt Mehlhorn
    • 1
  • Wolfgang Rülling
    • 1
  • Christoph Storb
    • 1
  1. 1.FB 10, Universität des SaarlandesSaarbrückenWest Germany
  2. 2.Dep. of Comp. ScienceUniversity of EdinburghEdinburghScotland

Personalised recommendations