Sawing of Logs in Virtual Trees Using 3D Intersection Algorithms - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2003

Sawing of Logs in Virtual Trees Using 3D Intersection Algorithms

Abstract

This work is issued from researches developed in the Programme of Plant Modelling Programme (AMAP) at Cirad: modelling, simulation and visualisation of trees. The goal is to extract and to visualise sawed boards from virtual trees, which are produced by the software AMAP. The initial geometric description of the trees have to be adapted to the sawing: the branches are not correctly connected to the trunk. So, in collaboration with the laboratory LMC, two approaches have been developed. The first one uses 2D-image techniques while in the second one, a new description of the surfaces is developed with some 3-D intersections algorithms to solve the problem of connections. It uses Bézier surfaces and geometrical connection techniques.
Fichier principal
Vignette du fichier
A03-R-248.pdf (208.94 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00107688 , version 1 (19-10-2006)

Identifiers

  • HAL Id : inria-00107688 , version 1

Cite

Nicolas Szafran, Stéphane Despréaux, Luc Biard, Frédéric Blaise. Sawing of Logs in Virtual Trees Using 3D Intersection Algorithms. International Symposium on Plant growth Modeling, simulation, visualization and their Applications 2003 -PMA'03, 2003, Beijing, China. pp.372-383. ⟨inria-00107688⟩
128 View
30 Download

Share

Gmail Facebook Twitter LinkedIn More