|
|
|
|
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Been goofing around with some ideas for the decay round. In the process I
came up with a macro that parses a mesh file and replaces it with cubes. It
works recursively, so you can specify the level of recursion to get more or
less detail. Anyway, here are two test images. The first one is done
without recursion, and the second one is with one level of recursion. For
each level of recursion, it subdivides each cube into a 3x3x3 cube (27
sub-cubes), then samples those points to see if they are inside the mesh or
not.
--
Doug Eichenberg
www.getinfo.net/douge
dou### [at] nlsnet
Post a reply to this message
Attachments:
Download 'bd_test0.jpg' (97 KB)
Download 'bd_test1.jpg' (98 KB)
Preview of image 'bd_test0.jpg'
Preview of image 'bd_test1.jpg'
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Me like! The first is brilliant.
You could have used it the last round too ;)
What kind of meshes? .OBJ?
/Stefan
"Doug Eichenberg" <dou### [at] nlsnet> wrote in message
news:3f636357@news.povray.org...
> Been goofing around with some ideas for the decay round. In the process I
> came up with a macro that parses a mesh file and replaces it with cubes.
It
> works recursively, so you can specify the level of recursion to get more
or
> less detail. Anyway, here are two test images. The first one is done
> without recursion, and the second one is with one level of recursion. For
> each level of recursion, it subdivides each cube into a 3x3x3 cube (27
> sub-cubes), then samples those points to see if they are inside the mesh
or
> not.
>
>
> --
> Doug Eichenberg
> www.getinfo.net/douge
> dou### [at] nlsnet
>
>
>
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
mesh or mesh2 format.
--
Doug Eichenberg
www.getinfo.net/douge
dou### [at] nlsnet
Stefan Persson <azy### [at] teliacom> wrote in message
news:3f637092$1@news.povray.org...
> Me like! The first is brilliant.
> You could have used it the last round too ;)
>
> What kind of meshes? .OBJ?
>
> /Stefan
>
>
> "Doug Eichenberg" <dou### [at] nlsnet> wrote in message
> news:3f636357@news.povray.org...
> > Been goofing around with some ideas for the decay round. In the process
I
> > came up with a macro that parses a mesh file and replaces it with cubes.
> It
> > works recursively, so you can specify the level of recursion to get more
> or
> > less detail. Anyway, here are two test images. The first one is done
> > without recursion, and the second one is with one level of recursion.
For
> > each level of recursion, it subdivides each cube into a 3x3x3 cube (27
> > sub-cubes), then samples those points to see if they are inside the mesh
> or
> > not.
> >
> >
> > --
> > Doug Eichenberg
> > www.getinfo.net/douge
> > dou### [at] nlsnet
> >
> >
> >
>
>
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
This is awesome :)
On Sat, 13 Sep 2003 14:39:07 -0700, Doug Eichenberg <dou### [at] nlsnet> wrote:
> Been goofing around with some ideas for the decay round. In the process
> I
> came up with a macro that parses a mesh file and replaces it with cubes.
> It
> works recursively, so you can specify the level of recursion to get more
> or
> less detail. Anyway, here are two test images. The first one is done
> without recursion, and the second one is with one level of recursion.
> For
> each level of recursion, it subdivides each cube into a 3x3x3 cube (27
> sub-cubes), then samples those points to see if they are inside the mesh
> or
> not.
>
>
> --
> Doug Eichenberg
> www.getinfo.net/douge
> dou### [at] nlsnet
>
>
>
>
>
--
Using M2, Opera's revolutionary e-mail client: http://www.opera.com/m2/
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Doug Eichenberg <dou### [at] nlsnet> wrote in message
news:3f636357@news.povray.org...
> Been goofing around with some ideas for the decay round. In the process I
> came up with a macro that parses a mesh file and replaces it with cubes.
It
> works recursively, so you can specify the level of recursion to get more
or
> less detail. Anyway, here are two test images. The first one is done
> without recursion, and the second one is with one level of recursion. For
> each level of recursion, it subdivides each cube into a 3x3x3 cube (27
> sub-cubes), then samples those points to see if they are inside the mesh
or
> not.
Nice! Would have made a good surreal entry...
How long does it take to parse & render?
RG
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |
| |
|
|
Took about 3 minutes with no recursion, and about 10-12 with 1 level of
recursion.
--
Doug Eichenberg
www.getinfo.net/douge
dou### [at] nlsnet
gonzo <rgo### [at] lansetcom> wrote in message news:3f640e5e@news.povray.org...
> Doug Eichenberg <dou### [at] nlsnet> wrote in message
> news:3f636357@news.povray.org...
> > Been goofing around with some ideas for the decay round. In the process
I
> > came up with a macro that parses a mesh file and replaces it with cubes.
> It
> > works recursively, so you can specify the level of recursion to get more
> or
> > less detail. Anyway, here are two test images. The first one is done
> > without recursion, and the second one is with one level of recursion.
For
> > each level of recursion, it subdivides each cube into a 3x3x3 cube (27
> > sub-cubes), then samples those points to see if they are inside the mesh
> or
> > not.
>
>
> Nice! Would have made a good surreal entry...
>
> How long does it take to parse & render?
>
> RG
>
>
Post a reply to this message
|
|
| |
| |
|
|
|
|
| |