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.
Supported by DFG, SFB 124, TP B2.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
6. References
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.
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.
F. M. Maley, ”Single-Layer Wire Routing”, Ph. D. Thesis, Massachusetts Institute of Technology, August 1987.
H. Seifert and W. Threlfall, ”Lehrbuch der Topologie”, Chelsea Publishing Company, 1947.
M. Tompa, ”An Optimal Solution to a Wire-Routing Problem”, Journal of Computer and System Sciences 23, pp. 127–150.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gao, S., Jerrum, M., Kaufmann, M., Mehlhorn, K., Rülling, W., Storb, C. (1988). On continuous homotopic one layer routing. In: Noltemeier, H. (eds) Computational Geometry and its Applications. CG 1988. Lecture Notes in Computer Science, vol 333. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50335-8_24
Download citation
DOI: https://doi.org/10.1007/3-540-50335-8_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50335-4
Online ISBN: 978-3-540-45975-0
eBook Packages: Springer Book Archive