Geometry of plane trees
โ Scribed by Yu. Yu. Kochetkov
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 168 KB
- Volume
- 158
- Category
- Article
- ISSN
- 1573-8795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## Abstract Harary and Robinson showed that the number __a__~__n__~ of achiral planted plane trees with __n__ points coincides with the number __p__~__n__~ of achiral plane trees with __n__ points, for __n__ โฉพ 2. They posed the problem of finding a natural structural correspondence which explains t
In this paper we obtain, for a class of plane curves, extensions of the well-known relation of inflection points, double points and bitangencies established by Fabricius-Bjerre for closed curves.
A rooted plane tree is a rooted tree with a left-to-right ordering specified for the children of each vertex. In this paper we give a simple algorithm to generate all rooted plane trees with at most n vertices. The algorithm uses O(n) space and generates such trees in O(1) time per tree without dupl