Abstract
Orthogonal connectors are used in drawings of many network diagrams, especially those representing electrical circuits. Such diagrams frequently include hyperedges—single edges that connect more than two endpoints. While many interactive diagram editors provide some form of automatic connector routing we are unaware of any that provide automatic routing for orthogonal hyperedge connectors. We give three algorithms for hyperedge routing in an interactive diagramming editor. The first supports semi-automatic routing in which a route given by the user is improved by local transformations while the other two support fully-automatic routing and are heuristics based on an algorithm used for connector routing in circuit layout.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ajwani, G., Chu, C., Mak, W.K.: FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 30(2), 194–204 (2011)
Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1990)
Holten, D.: Hierarchical edge bundles: Visualization of adjacency relations in hierarchical data. IEEE Transactions on Visualization and Computer Graphics 12, 741–748 (2006)
Holten, D., van Wijk, J.J.: Force-directed edge bundling for graph visualization. Comput. Graph. Forum 28(3), 983–990 (2009)
Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. Annals of Discrete Mathematics (1992)
Lin, C.W., Chen, S.Y., Li, C.F., Chang, Y.W., Yang, C.L.: Efficient obstacle-avoiding rectilinear steiner tree construction. In: Proc. of the 2007 Int. Symp. on Physical Design, ISPD 2007, pp. 127–134. ACM, New York (2007)
Long, J., Zhou, H., Memik, S.O.: EBOARST: An efficient edge-based obstacle-avoiding rectilinear steiner tree construction algorithm. IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems 27(12), 2169–2182 (2008)
Pupyrev, S., Nachmanson, L., Kaufmann, M.: Improving Layered Graph Layouts with Edge Bundling. In: Brandes, U., Cornelsen, S. (eds.) GD 2010. LNCS, vol. 6502, pp. 329–340. Springer, Heidelberg (2011)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wybrow, M., Marriott, K., Stuckey, P.J. (2012). Orthogonal Hyperedge Routing. In: Cox, P., Plimmer, B., Rodgers, P. (eds) Diagrammatic Representation and Inference. Diagrams 2012. Lecture Notes in Computer Science(), vol 7352. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31223-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-31223-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31222-9
Online ISBN: 978-3-642-31223-6
eBook Packages: Computer ScienceComputer Science (R0)