POV-Ray : Newsgroups : povray.general : dla roots and rendering Server Time
31 Oct 2024 16:17:03 EDT (-0400)
  dla roots and rendering (Message 1 to 5 of 5)  
From: Paul Bourke
Subject: dla roots and rendering
Date: 14 Jun 2005 05:32:38
Message: <pdb_NOSPAM-BB3031.19323814062005@news.povray.org>
Some time ago I published some images of 3D diffiusion limited aggregation 
that included constraint surfaces. 
   http://astronomy.swin.edu.au/~pbourke/fractals/dla3d/
Since then they have also been exhibited at the Simply Complex exhibition 
in Zurich. 
   http://www.museum-gestaltung.ch/exhibitions/program.html
A few people asked for the programs that created these forms, I have put a
beta version for Mac OS-X and Linux here, you also need POVRay to render
the structures, see the bottom of this page for the downloads.
   http://astronomy.swin.edu.au/~pbourke/fractals/dla3d/
-- 
Paul Bourke
pdb_NOSPAMswin.edu.au


Post a reply to this message

From: Christoph Hormann
Subject: Re: dla roots and rendering
Date: 14 Jun 2005 06:25:01
Message: <d8mb88$51d$1@chho.imagico.de>
Paul Bourke wrote:
> Some time ago I published some images of 3D diffiusion limited aggregation 
> that included constraint surfaces. 
>    http://astronomy.swin.edu.au/~pbourke/fractals/dla3d/

Are these all grid based like common for 2D DLA algorithms?  It's not 
immediately visible from the images.  Not grid based DLA in 3d would be 
interesting but without acceleration data structures to store the 
aggregated 'tree' it would be quite inefficient.

Christoph

-- 
POV-Ray tutorials, include files, Sim-POV,
HCR-Edit and more: http://www.tu-bs.de/~y0013390/
Last updated 03 May. 2005 _____./\/^>_*_<^\/\.______


Post a reply to this message

From: Florian Brucker
Subject: Re: dla roots and rendering
Date: 14 Jun 2005 13:56:25
Message: <42af1a49$1@news.povray.org>
As always, your work is really fascinating! I'll try your beta once RL
will permit it...


Keep up the good work,
Florian
-- 
camera{look_at-y*10location<8,-3,-8>*10}#local a=0;#while(a<999)sphere{
#local _=.01*a-4.99;#local p=a*.01-5;#local c=.01*a-4.995;<sin(p*pi)*5p
*10pow(p,5)*.01>sin(c*c*c*.1)+1pigment{rgb 3}}#local a=a+1;#end
/******** http://www.torfbold.com ******** http://www.imp.org ********/


Post a reply to this message

From: Paul Bourke
Subject: Re: dla roots and rendering
Date: 16 Jun 2005 05:56:46
Message: <pdb_NOSPAM-2A1705.19564516062005@news.povray.org>
> Are these all grid based like common for 2D DLA algorithms?  It's not 
> immediately visible from the images. 

They are not grid based but continuous. A branch is added 
when the particle comes within a certain distance from the 
existing structure. The resulting structure is rendered
with a spline sphere sweep in PovRay with sphere radius
a decreasing function of distance from the initial seed.

-- 
Paul Bourke
pdb_NOSPAMswin.edu.au


Post a reply to this message

From: Christoph Hormann
Subject: Re: dla roots and rendering
Date: 16 Jun 2005 11:30:02
Message: <d8s5tg$sjb$1@chho.imagico.de>
Paul Bourke wrote:
> 
> They are not grid based but continuous. A branch is added 
> when the particle comes within a certain distance from the 
> existing structure.

Do you use brute force for calculating the distance from the
existing structure or some speedup data structure?

Christoph

-- 
POV-Ray tutorials, include files, Sim-POV,
HCR-Edit and more: http://www.tu-bs.de/~y0013390/
Last updated 03 May. 2005 _____./\/^>_*_<^\/\.______


Post a reply to this message

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.