On continuous Homotopic one layer routing

Authors:
S. Gao;M. Jerrum;M. Kaufman;K. Mehlhorn;W. Rülling
Affiliations:
FB 10, Universität des Saarlandes, 6600 Saarbrücken, West Germany;Dep. of Comp. Science, University of Edinburgh, Edinburgh EH9 3JZ, Scotland;FB 10, Universität des Saarlandes, 6600 Saarbrücken, West Germany;FB 10, Universität des Saarlandes, 6600 Saarbrücken, West Germany;FB 10, Universität des Saarlandes, 6600 Saarbrücken, West Germany
Venue:
SCG '88 Proceedings of the fourth annual symposium on Computational geometry
Year:
1988

Citing 1
Cited 12

Algorithms for routing and testing routability of planar VLSI layouts

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing

Advances in homotopic layout compaction

SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A two-dimensional topological compactor with octagonal geometry

DAC '91 Proceedings of the 28th ACM/IEEE Design Automation Conference
Two Steiner tree packing problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Growing fat graphs

Proceedings of the eighteenth annual symposium on Computational geometry
Computing homotopic shortest paths in the plane

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computing Homotopic Shortest Paths Efficiently

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Computing homotopic shortest paths in the plane

Journal of Algorithms
Computing homotopic shortest paths efficiently

Computational Geometry: Theory and Applications
Thick non-crossing paths and minimum-cost flows in polygonal domains

SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Computing homotopic shortest paths efficiently

Computational Geometry: Theory and Applications
Homotopic rectilinear routing with few links and thick edges

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Homotopic C -oriented routing

GD'12 Proceedings of the 20th international conference on Graph Drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an &Ogr;(n3·log n) time and &Ogr;(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.