Authors :

#

Raoul Sallé de Chou(1,2), Mohamed Ali Srir(1) , Laurent Najman(3) , Nicolas Passat(4) , Hugues Talbot (5,3) , Irène Vignon-Clementel(1)

1. SIMBIOTX - SimbiotX,INRIA
2. CentraleSupélec
3. LIGM - Laboratoire d’Informatique Gaspard-Monge
4. CRESTIC - Centre de Recherche en Sciences et Technologies de l’Information et de la Communication - EA 3804
5. OPIS - OPtimisation Imagerie et Santé, INRIA, Centrale Supélec

Abstract

#

Optimizing transport networks is a well-known class of problems that have been extensively studied, with application in many domains. Here we are interested in a generalization of the Steiner problem, which entails finding a graph minimizing a cost function associated with connecting a given set of points. In this paper, we concentrate on a specific formulation of this problem which is applied to the generation of synthetic vascular trees. More precisely, we focus on the Constrained Constructive Optimization (CCO) tree algorithm, which constructs a vascular network iteratively, optimizing a blood transport energy efficiency. We show that the classical incremental construction method often leads to sub-optimal results, and that a better global solution can be reached.

Links

#