Abstract
Binary trees are usually defined so that left and right branches are determined by scaled rotations. However, when arbitrary affine transformations are allowed, a wide variety of trees may be produced. By varying parameters in the transformations, it is possible to produce trees with interesting geometrical properties. This paper explores the inverse problem: if it desired that a tree is to possess a specific geometrical property, find out which pairs of left/right branching transformations produce trees with this property.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Espigulé B (2013) Generalized self-contacting symmetric fractal trees. Symmetry Cult Sci 21:333–351
Mandelbrot B, Frame M (1999) The canopy and shortest path in a self-contacting fractal tree. Math Intell 21:18–27
O’Hanlon A, Howard A, Brown D (2004) Path length and height in asymmetric binary branching trees. Missouri J Math Sci 16:88–103
Taylor TD (2007) Golden fractal trees. In: Sarhangi R, Barrallo J (eds) Bridges Donostia: mathematics, music, art, architecture, culture. Tarquin Publications, London, pp 181–188
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this entry
Cite this entry
Matsko, V.J. (2021). Designing Binary Trees. In: Sriraman, B. (eds) Handbook of the Mathematics of the Arts and Sciences. Springer, Cham. https://doi.org/10.1007/978-3-319-57072-3_131
Download citation
DOI: https://doi.org/10.1007/978-3-319-57072-3_131
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57071-6
Online ISBN: 978-3-319-57072-3
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering