Skip to main content

Aesthetic Layout of Wiring Diagrams

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNAI,volume 7352)

Abstract

A wiring diagram plays an important role in electrical machine design. The layout of a wiring diagram must facilitate a designer’s understanding of the schematic as well as the real electrical machine. Even though wiring diagrams are undirected graphs, standard algorithms and libraries for graph drawing are not sufficient to achieve adequate diagrams that preserve the structure and further characteristics of the real machine. We argue that specialized algorithms are required to achieve adequate and aesthetic diagrams without compromising the characteristics of an electrical machine. In this paper, we describe a new algorithm for positioning diagram elements and a customized algorithm for connector routing for aesthetic wiring diagrams.

Keywords

  • Graph layout
  • connector routing
  • wiring diagram

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry 4(5), 235–282 (1994)

    CrossRef  MathSciNet  MATH  Google Scholar 

  2. Bennett, C., Ryall, J., Spalteholz, L., Gooch, A.: The Aesthetics of Graph Visualization. In: Computational Aesthetics 2007: Eurographics Workshop on Computational Aesthetics in Graphics, Visualization and Imaging, pp. 57–64 (2007)

    Google Scholar 

  3. Brandes, U., Eiglsperger, M., Kaufmann, M., Wagner, D.: Sketch-Driven Orthogonal Graph Drawing. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol. 2528, pp. 131–148. Springer, Heidelberg (2002)

    CrossRef  Google Scholar 

  4. Czech, G., Ernstbrunner, C., Pichler, J.: A .NET Architecture for Model-Based Domain Expert Programming. In: Fox, R., Golubski, W. (eds.) IASTED International Conference on Software Engineering, IASTED, pp. 25–32. ACTA Press (2010)

    Google Scholar 

  5. Dwyer, T., Marriott, K., Wybrow, M.: Topology Preserving Constrained Graph Layout. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 230–241. Springer, Heidelberg (2009)

    CrossRef  Google Scholar 

  6. Hart, P., Nilsson, N., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)

    CrossRef  Google Scholar 

  7. He, W., Marriot, K.: Constraint Graph Layout. Constraints 3, 289–314 (1998)

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. Hopcroft, J., Tarjan, R.: Algorithm 447: Efficient Algorithms for Graph Manipulation. Communication ACM 16(6), 372–378 (1973)

    CrossRef  Google Scholar 

  9. Lee, T.D., McNamee, L.P.: Aesthetic Routing for Transistor Schematics. In: IEEE/ACM International Conference on Computer-Aided Design, pp. 35–38. IEEE Computer Society Press (1992)

    Google Scholar 

  10. Pfeiffer, M., Pichler, J.: Trade: A Language and its Tool Support for Programming in Electrical Engineering. In: Fox, R., Golubski, W. (eds.) IASTED International Conference on Software Engineering, IASTED, pp. 33–40. ACTA Press (2010)

    Google Scholar 

  11. Purchase, H.C., Carrington, D., Allder, J.: Empirical Evaluation of Aesthetics-base Graph Layout. In: Empirical Software Engineering, vol. 7, pp. 233–255. Kluwer Academic Publishers (2002)

    Google Scholar 

  12. Spönemann, M., Fuhrmann, H., von Hanxleden, R., Mutzel, P.: Port Constraints In Hierarchical Layout of Data Flow Diagrams. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 135–146. Springer, Heidelberg (2010)

    CrossRef  Google Scholar 

  13. Sugiyama, K., Tagawa, S., Toda, M.: Methods for Visual Understanding of Hierarchical System Structures. IEEE Transactions on Systems, Man, and Cybernetics 11(2), 109–125 (1981)

    CrossRef  MathSciNet  Google Scholar 

  14. Tamassia, R., Battista, G.D., Batini, C.: Automatic Graph Drawing and Readability of Diagrams. IEEE Transactions on Systems, Man, and Cybernetics, 61–79 (1988)

    Google Scholar 

  15. 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)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ernstbrunner, C., Pichler, J. (2012). Aesthetic Layout of Wiring Diagrams. 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_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31223-6_12

  • 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)