Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Algorithms and Computation

ISAAC 1994: Algorithms and Computation pp 487–495Cite as

Parallel h-v drawings of binary trees

  • Conference paper
  • First Online:

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

Abstract

In this paper we present a method to obtain optimal h-v and inclusion drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in O(log2 n) parallel time by using a polynomial number of EREW processors. The method can be extended to compute optimal inclusion layouts in the case where each leaf l of the tree is represented by rectangle l x×l y. Our method also yields an NC algorithm for the slicing floorplanning problem. Whether this problem was in NC was an open question [2].

The work of the second author is partially supported by the EEC ESPRIT Basic Research Action No. 7141 (ALCOM II) and by the NSF grant No. CDA-9211155.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abrahamson, K., Dadoun, N., Kirkpatrick, D. and Przytycka, T. A Simple Parallel Tree Contraction Algorithm. J. of Algorithms, 10(1989), pp. 287–302.

    Article  Google Scholar 

  2. Chen, C-H and Tollis, I. Parallel Algorithms for Slicing Floorplan Designs. In Proc. of SPDP '90, Dec. 1990, pp. 279–282.

    Google Scholar 

  3. Crescenzi, P., Di Battista, G. and Piperno, A. A Note on Optimal Area Algorithms for Upward Drawings of Binary Trees. Computational Geometry: Theory and Applications, Vol. 2, pp. 187–200, 1992.

    MathSciNet  Google Scholar 

  4. Di Battista, G. and Tamassia, R. Algorithms for Plane Representation of Acyclic Digraphs. Theoretical Computer Science, Vol. 61, pp. 175–198, 1988.

    Article  Google Scholar 

  5. Di Battista, G., Eades, P., Tamassia, R. and Tollis, I.G. Algorithms for Drawing Graphs: an Annotated Bibliography. Tech. Report, Brown Univ., June 1993.

    Google Scholar 

  6. Eades, P., Lin, T., and Lin, X. Two Tree Drawing Conventions. TR 174, Key Centre for Software Technology, Dept. of Computer Science, The University of Queensland, 1990. (To appear in Computational Geometry and Applications)

    Google Scholar 

  7. Eades, P., Lin, T., and Lin, X. Minimum Size h-v Drawings, Advanced Visual Interfaces (Proceedings of AVI 92), World Series in Computer Science Vol. 36, pp. 386–394, 1992.

    Google Scholar 

  8. Garg, A., Goodrich, M.T., and Tamassia, R. Area-Efficient Upward Tree Drawings, 9th Annual Symposium on Computational Geometry, pp. 359–368, 1992.

    Google Scholar 

  9. Metaxas, P., Pantziou, G., Symvonis A. Parallel h-v Drawings of Binary Trees. Technical Report 480, Basser Dept. of Computer Science, Uninversity of Sydney, March 1994.

    Google Scholar 

  10. Stockmeyer, L. Optimal Orientations of Cells in Slicing Floorplan Designs. Information and Control 57, pp. 91–101, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Wellesley College, 02181, Wellesley, MA, USA

    Panagiotis T. Metaxas

  2. Department of Mathematics and Computer Science, Dartmouth College, Canada

    Grammati E. Pantziou

  3. Computer Technology Institute, P.O. Box 1122, 26110, Patras, Greece

    Grammati E. Pantziou

  4. Department of Computer Science, University of Sydney, 2006, N.S.W., Australia

    Antonis Symvonis

Authors
  1. Panagiotis T. Metaxas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Grammati E. Pantziou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Antonis Symvonis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Ding-Zhu Du Xiang-Sun Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Metaxas, P.T., Pantziou, G.E., Symvonis, A. (1994). Parallel h-v drawings of binary trees. In: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_215

Download citation

  • DOI: https://doi.org/10.1007/3-540-58325-4_215

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58325-7

  • Online ISBN: 978-3-540-48653-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation