Seeing Around Corners: Fast Orthogonal Connector Routing

  • Kim Marriott
  • Peter J. Stuckey
  • Michael Wybrow
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8578)

Abstract

Orthogonal connectors are used in drawings of many types of network diagrams, especially those representing electrical circuits. One approach for routing such connectors has been to compute an orthogonal visibility graph formed by intersecting vertical and horizontal lines projected from the corners of all obstacles and then use an A* search over this graph. However the search can be slow since many routes are in some sense topologically equivalent. We introduce obstacle-hugging routes which we conjecture provide a canonical representative for a set of topologically equivalent routes. We also introduce a new 1-bend visibility graph that supports computation of these canonical routes. Essentially this contains a node for each obstacle corner and connector endpoint in the diagram and an edge between two nodes iff they can be connected using an orthogonal connector with one bend. We show that the use of a 1-bend visibility graph significantly improves the speed of orthogonal connector routing.

Keywords

orthogonal routing visibility graphs circuit diagrams 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 153–164. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  2. 2.
    Dwyer, T., Marriott, K., Stuckey, P.J.: Fast node overlap removal—correction. In: Kaufmann, M., Wagner, D. (eds.) GD 2006. LNCS, vol. 4372, pp. 446–447. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  3. 3.
    Lee, D., Yang, C., Wong, C.: Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics 70(3), 185–216 (1996)CrossRefMATHMathSciNetGoogle Scholar
  4. 4.
    Lengauer, T.: Combinatorial Algorithms for Integrated Circuit Layout. John Wiley & Sons, Inc., New York (1990)MATHGoogle Scholar
  5. 5.
    Miriyala, K., Hornick, S.W., Tamassia, R.: An incremental approach to aesthetic graph layout. In: Computer-Aided Software Engineering, pp. 297–308. IEEE (1993)Google Scholar
  6. 6.
    Wybrow, M., Marriott, K., Stuckey, P.J.: Incremental connector routing. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol. 3843, pp. 446–457. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Wybrow, M., Marriott, K., Stuckey, P.J.: Orthogonal connector routing. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 219–231. Springer, Heidelberg (2010)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Kim Marriott
    • 1
  • Peter J. Stuckey
    • 2
  • Michael Wybrow
    • 1
  1. 1.Caulfield School of Information TechnologyMonash UniversityCaulfieldAustralia
  2. 2.Department of Computing and Information SystemsUniversity of MelbourneAustralia

Personalised recommendations