Conference Proceedings

Ou continuous homotopic one layer routing

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988 (1988) 392-402
DOI: 10.1145/73393.73433
28Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Gao, S., Jerrum, M., Kaufmann, M., Mehlhorn, K., Rülling, W., & Storb, C. (1988). Ou continuous homotopic one layer routing. In Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988 (pp. 392–402). Association for Computing Machinery, Inc. https://doi.org/10.1145/73393.73433

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free