Skip to main content

Layout algorithms and layout constraints

  • Chapter
  • First Online:
The Design of an Extendible Graph Editor

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 704))

  • 201 Accesses

Abstract

This chapter presents a layout constraint manager which can be used together with existing graph layout algorithms. This technique can be used, not only to take user- and application-specific layout constraints into account, but also to achieve layout stability[BP90].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Editor information

Frances Newbery Paulisch

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(1993). Layout algorithms and layout constraints. In: Newbery Paulisch, F. (eds) The Design of an Extendible Graph Editor. Lecture Notes in Computer Science, vol 704. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019375

Download citation

  • DOI: https://doi.org/10.1007/BFb0019375

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57090-5

  • Online ISBN: 978-3-540-47898-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics