![](/i/fill.gif) |
![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
Is it like an image map? What is it really on the inside of UVPOVs little
brain? Is it 3D, is it 2D? Where does it come from? What is a photon map
exactly? (Don't worry about speaking some C, I can read it.)
Thanks in advance for your replies.
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
TonyB skrev i meldingen <380b0b0f@news.povray.org>...
>Is it like an image map? What is it really on the inside of UVPOVs little
>brain? Is it 3D, is it 2D? Where does it come from? What is a photon map
>exactly? (Don't worry about speaking some C, I can read it.)
>
>Thanks in advance for your replies.
>
>
I don't know if this really belongs here, but anyway. Short Answer: You can
read the documentation of uvpov, a file called photons.htm.
Longer:
A photon map is created by shooting imaginary photons from the light source
and see how they interact with objects in the scene. Usually, povray uses
*backward* raytracing, following photons the wrong way. But them you cannot
simulate caustics or light reflecting around corners et.c. Therefore, photon
mapping shoots rays the other way, thus making an approximation of what it
might look like in the real world. Forward ray-tracing is a very
time-consuming process, and photon mapping requires a lot of memory.
Summary: Photon mapping is a hybrid of backwards and forwards raytracing,
simulating some of the light cast in the "correct" direction.
Anyone?
Simen.
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
The photon map is 3D. That's about all I remember about it.
-Mike
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
TonyB wrote:
> Is it like an image map? What is it really on the inside of UVPOVs little
> brain? Is it 3D, is it 2D? Where does it come from? What is a photon map
> exactly? (Don't worry about speaking some C, I can read it.)
>
> Thanks in advance for your replies.
http://www.gk.dtu.dk/home/hwj/
earl
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
TonyB <ben### [at] panama phoenix net> wrote...
> Is it like an image map? What is it really on the inside of UVPOVs little
> brain? Is it 3D, is it 2D? Where does it come from? What is a photon map
> exactly? (Don't worry about speaking some C, I can read it.)
>
> Thanks in advance for your replies.
Definately take a look at the link that Earl provided (or have a glance at
my paper).
Anyway, a photon map 3d. The data is stored in a data structure called a
kd-tree (in this case, a 3d-tree). The kd-tree is similar to a binary tree,
but each split could occur on any one of the three dimensions. Each
forwards-ray-trace intersection is stored in the tree with intensity and
directional data. This allows quick access to the data.
During the final rendering step, the tree is searched to find data points
that are near the current point.
-Nathan
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
Nathan Kopp wrote:
> Anyway, a photon map 3d. The data is stored in a data structure called a
> kd-tree (in this case, a 3d-tree). The kd-tree is similar to a binary tree,
> but each split could occur on any one of the three dimensions. Each
> forwards-ray-trace intersection is stored in the tree with intensity and
> directional data. This allows quick access to the data.
>
> During the final rendering step, the tree is searched to find data points
> that are near the current point.
>
> -Nathan
I've been trying to search the web on information regarding this kd-tree
specifically. Can you suggest a website that I may go to so that I can read
more.
earl
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
Earl Ehrig wrote:
> I've been trying to search the web on information regarding this kd-tree
> specifically. Can you suggest a website that I may go to so that I can read
> more.
>
> earl
I have seen articles on using this approach in the RTNews by Eric Haines.
Try a search of his site for related material.
http://www.acm.org/tog/resources/RTNews/html/
--
Ken Tyler - 1100+ Povray, Graphics, 3D Rendering, and Raytracing Links:
http://home.pacbell.net/tylereng/index.html http://www.povray.org/links/
Post a reply to this message
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |
| ![](/i/fill.gif) |
|
![](/i/fill.gif) |
|
![](/i/fill.gif) |
| ![](/i/fill.gif) |