Generation of Valid Labeled Binary Trees - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2003

Generation of Valid Labeled Binary Trees

Résumé

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.
Fichier non déposé

Dates et versions

hal-00174194 , version 1 (21-09-2007)

Identifiants

  • HAL Id : hal-00174194 , version 1

Citer

Brice Effantin. Generation of Valid Labeled Binary Trees. International Conference on Computational Science and its Applications 2003, 2003, Montréal, Canada. pp.245-253. ⟨hal-00174194⟩
67 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More