Skip to main content
SpringerLink
Log in

Generation of Valid Labeled Binary Trees

  • Conference paper
  • First Online:
Computational Science and Its Applications — ICCSA 2003 (ICCSA 2003)

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

Included in the following conference series:

  • 763 Accesses

Abstract

Generating binary trees is a well-known problem. In this paper, we add some constraints to leaves of these trees. Such trees are used in the morphing of polygons, where a polygon P is represented by a binary tree T and each angle of P is a weight on a leaf of T. In the following, we give two algorithms to generate all binary trees, without repetitions, having the same weight distribution to their leaves and representing all parallel polygons to P.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. T. Beyer, S.M. Hedetniemi: Constant time generation of rooted trees. SIAM Journal on Computing 9(4) (1980) 706–712.

    Article  MATH  MathSciNet  Google Scholar 

  2. L. Guibas, J. Hershberger and S. Suri: Morphing Simple Polygons. Discrete and Computational Geometry 24 (2000) 1–34.

    MATH  MathSciNet  Google Scholar 

  3. J.F. Korsh, P. LaFollette: Loopless generation of Gray codes for k-ary trees. Information Processing Letters 70 (1999) 7–11.

    Article  MATH  MathSciNet  Google Scholar 

  4. A.V. Kozina: Coding and generation of nonisomorphic trees. Cybernetics 15 (1979) 645–651.

    Article  MATH  Google Scholar 

  5. Z. Li, S. Nakano: Efficient Generation of Plane Triangulations without Repetitions. International Colloquium on Automata, Languages and Programming 2001, 433–443.

    Google Scholar 

  6. S. Nakano: Efficient generation of plane trees. Information Processing Letters 84 (2002) 167–172.

    Article  MATH  MathSciNet  Google Scholar 

  7. J. M. Pallo: Enumerating, Ranking and Unranking Binary Trees. The Computer Journal 29(2) (1986) 171–175.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. M. Pallo: An efficient upper bound of the rotation distance of binary trees. Information Processing Letters 73 (2000) 87–92.

    Article  MATH  MathSciNet  Google Scholar 

  9. M.V.S. Ramanath, T.R. Walsh: Enumeration and Generation of a Class of Regular Digraphs. Journal of Graph Theory 11(4) (1987) 471–479.

    Article  MATH  MathSciNet  Google Scholar 

  10. G. Tinhofer, H. Schreck: Linear Time Tree Codes. Computing 33 (1984) 211–225.

    Article  MATH  MathSciNet  Google Scholar 

  11. V. Vajnovszki: On the loopless generation of binary tree sequences. Information Processing Letters 68 (1998) 113–117.

    Article  MathSciNet  Google Scholar 

  12. R. A. Wright, B. Richmond, A. Odlyzko and B. D. McKay: Constant time generation of free trees. SIAM Journal on Computing 15(2) (1986) 540–548.

    Article  MATH  MathSciNet  Google Scholar 

  13. L. Xiang, K. Ushijima, C. Tang: Efficient loopless generation of Gray codes for k-ary trees. Information Processing Letters 76 (2000) 169–174.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LE2I FRE-CNRS 2309, Université de Bourgogne, B.P. 47870, 21078, Dijon Cedex, France

    Brice Effantin

Authors
  1. Brice Effantin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Army High Performance Computing Research Center, USA

    Vipin Kumar

  2. Department of Computer Science, University of Calgary, Calgary, AB, T2N1N4, Canada

    Marina L. Gavrilova

  3. Heuchera Technologies Inc., 122 9251-8 Yonge Street, Richmond Hill, ON, Canada, L4C 9T3

    Chih Jeng Kenneth Tan

  4. Département d’informatique et de recherche opérationelle, Université de Montréal, Montréal, Québec, H3C 3J7, Canada

    Pierre L’Ecuyer

  5. Department of Computer Science and Engineering, University of Minessota, MN, 55455, USA

    Vipin Kumar

  6. The Queen’s University of Belfast, School of Computer Science, Belfast BT7 1NN, Northern Ireland, UK

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Effantin, B. (2003). Generation of Valid Labeled Binary Trees. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2667. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44839-X_27

Download citation

  • DOI: https://doi.org/10.1007/3-540-44839-X_27

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40155-1

  • Online ISBN: 978-3-540-44839-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation