You all are talking about problems very well known to engineers. We use to
call this kind of operation as 'meshing an object'.
I'm looking for some papers I've read about the problem of meshing for
Computational Fluid Dinamics problems as soon as I can find them I will
publish them on my internet site and advise you all.

Massimiliano Cirri


_____________________________________________
Eng. Massimiliano Cirri
Ph.D. Student
Department of Energetics "Sergio Stecco"
e-mail: m.c### [at] ingunifiit
tel: +39 055 4796239
fax: +39 055 4796342
private fax: +39 02 700 544 824
_____________________________________________



"Ron Parker" <ron### [at] povrayorg> ha scritto nel messaggio
news:slr### [at] fwicom...
> On Wed, 10 Oct 2001 22:46:10 +0200, Nicolas Calimet wrote:
> > I guess the problem with "marching" algorithms is the fixed step
> >used to sample the space; even if you try using an adaptive method, as
> >supersampling. While Delaunay triangulation - if possibly implemented in
> >a tesselation procedure - would give triangles of different sizes
according
>
> I think you're thinking of something besides Delaunay triangulation.
That's
> a purely 2d technique and has nothing to do with meshes.
>
> --
> #local R=rgb 99;#local P=R-R;#local F=pigment{gradient
x}box{0,1pigment{gradient
> y pigment_map{[.5F pigment_map{[.3R][.3F color_map{[.15red
99][.15P]}rotate z*45
> translate x]}]#local H=pigment{gradient y color_map{[.5P][.5R]}scale
1/3}[.5F
> pigment_map{[.3R][.3H][.7H][.7R]}]}}}camera{location.5-3*z}//only my
opinions

Post a reply to this message