Skip to main content

On Three-Dimensional Graph Drawing and Embedding

  • Conference paper
  • 525 Accesses

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 7157)

Abstract

This survey talk reviews results and open problems on the theme of drawing graphs and representing graphs in three dimensional space. The talk will also touch on related problems in linkage reconfiguration and graph representation in three dimensions, as well as on applications in micro-manufacturing and modelling protein folding.

Keywords

  • graph drawing
  • graph layout
  • graph embedding
  • computational geometry
  • linkage reconfiguration
  • three dimensions
  • 3d

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   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.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

References

  1. Battista, G.D., Liotta, G., Kim, E., Lubiw, A., Whitesides, S.: The shape of orthogonal cycles in three dimensions. Discrete and Computational Geometry (in press)

    Google Scholar 

  2. Battista, G.D., Liotta, G., Lubiw, A., Whitesides, S.: Embedding problems for paths with direction constrained edges. Theoretical Computer Science 289(2), 897–917 (2002)

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. Dujmović, V., Whitesides, S.: Three-dimensional drawings. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization. CRA Press, Taylor and Francis Group, Boca Raton (to appear, 2012)

    Google Scholar 

  4. Kitching, M., Whitesides, S.: The Three Dimensional Logic Engine. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 329–339. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

  5. Lesh, N., Mitzenmacher, M., Whitesides, S.: A complete and effective move set for simplified protein folding. In: RECOMB 2003, pp. 188–195. ACM, New York (2003)

    Google Scholar 

  6. Whitesides, S.: Chain Reconfiguration The Ins and Outs, Ups and Downs of Moving Polygons and Polygonal Linkages. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 1–13. Springer, Heidelberg (2001)

    CrossRef  Google Scholar 

  7. Wu, H., Brittain, S., Anderson, J., Grzybowski, B., Whitesides, S., Whitesides, G.M.: Fabrication of topologically complex three-dimensional microstructrues: Metallic microknots. Journal of the American Chemical Society 122, 12691–12699 (2000)

    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

Whitesides, S. (2012). On Three-Dimensional Graph Drawing and Embedding. In: Rahman, M.S., Nakano, Si. (eds) WALCOM: Algorithms and Computation. WALCOM 2012. Lecture Notes in Computer Science, vol 7157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28076-4_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28076-4_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28075-7

  • Online ISBN: 978-3-642-28076-4

  • eBook Packages: Computer ScienceComputer Science (R0)