Raytrace

Basic Ray Tracing
CMSC 435/634
Projections
orthographic
axis-aligned
orthographic
perspective oblique
2
Computing Viewing Rays
w v
e u
w e
u
Parallel projection Perspective projection

same direction, different origins same origin, different directions
Ray-Triangle Intersection
boolean raytri (ray r, vector p0, p1, p2, interval [t0,t1] )
{
compute t
if (( t < t0 ) or (t > t1))
return ( false )
compute γ
if ((γ < 0 ) or (γ > 1))
return ( false )
compute β
if ((β < 0 ) or (β+γ > 1))
return ( false )
return true
}
Point in Polygon?
• Is P in polygon?
• Cast ray from P to
infinity
– 1 crossing = inside
– 0, 2 crossings = outside
Point in Polygon?
• Is P in concave
polygon?
• Cast ray from P to
infinity
– Odd crossings = inside
– Even crossings =
outside
What Happens?
Raytracing Characteristics
• Good
– Simple to implement
– Minimal memory required
– Easy to extend
• Bad
– Aliasing
– Computationally intensive
• Intersections expensive (75-90% of rendering time)
• Lots of rays
Basic Illumination Concepts
• Terms
– Illumination: calculating light intensity at a point (object
space; equation) based loosely on physical laws
– Shading: algorithm for calculating intensities at pixels
(image space; algorithm)
• Objects
– Light sources: light-emitting
– Other objects: light-reflecting
• Light sources
– Point (special case: at infinity)
– Area
A Simple Model
• Approximate BRDF as sum of
– A diffuse component
– A specular component
– A “ambient” term
+ + =
10
Diffuse Component
• Lambert’s Law
– Intensity of reflected light proportional to
cosine of angle between surface and incoming
light direction
– Applies to “diffuse,” “Lambertian,” or “matte”
surfaces
– Independent of viewing angle
• Use as a component of non-Lambertian surfaces
11
Diffuse Component
kd I(l̂ · n̂)
max(kd I(l̂ · n̂), 0)
12
Diffuse Component
• Plot light leaving in a given direction:
• Plot light leaving from each point on surface
13
Specular Component
• Specular component is a mirror-like reflection
• Phong Illumination Model
– A reasonable approximation for some surfaces
– Fairly cheap to compute
• Depends on view direction
14
Specular Component
ksI(r̂ · v̂) p N
L V
p R
ksI max(r̂ · v̂, 0)
15
Specular Component
• Computing the reflected direction
r̂ = l̂ + 2(l̂ · n̂)n̂ n
l r
θ n cos θ
n cos θ
l̂ + v̂
-l
ĥ =
||l̂ + v̂||
n h
l
ω
e
16
Specular Component
• Plot light leaving in a given direction:
• Plot light leaving from each point on surface

Specular Component
• Specular exponent sometimes called “roughness”
n=1 n=2 n=4
n=8 n=16 n=32
n=64 n=128 n=256

18
Ambient Term
• Really, its a cheap hack
• Accounts for “ambient, omnidirectional light”
• Without it everything looks like it’s in space
19
Summing the Parts
R = kaI + kd I max(l̂ · n̂, 0) + ksI max(r̂ · v̂, 0) p
+ + =
• Recall that the k? are by wavelength

– RGB in practice
• Sum over all lights
20
Shadows
• What if there is an object between the surface
and light?
21
Ray Traced Shadows
• Trace a ray
– Start = point on surface
– End = light source
– t=0 at Surface, t=1 at Light
– “Bias” to avoid surface acne
• Test
– Bias ≤ t ≤ 1 = shadow
– t < Bias or t > 1 = use this light
Mirror Reflection
23
The Dark Side of the Trees - Gilles Tran,
Spheres - Martin K. B.
Ray Tracing Reflection
• Viewer looking in direction d sees whatever the
viewer “below” the surface sees looking in
direction r
• In the real world
– Energy loss on the bounce
– Loss different for different colors
• New ray
– Start on surface, in reflection direction
24
Ray Traced Reflection
• Avoid looping forever
– Stop after n bounces
– Stop when contribution to pixel gets too small
Specular vs. Mirror Reflection
Combined Specular & Mirror
• Many surfaces have both
Refraction
Top
Front
Refraction and Alpha
• Refraction = what direction
• α = how much
– Often approximate as a constant
– Better: Use Fresnel
– Schlick approximation
Full Ray-Tracing
• For each pixel
– Compute ray direction
– Find closest surface
– For each light
• Shoot shadow ray
• If not shadowed, add direct illumination
– Shoot ray in reflection direction
– Shoot ray in refraction direction
Dielectric
if (p is on a dielectric) then
r = reflect (d, n)
if (d.n < 0) then
refract (d, n , n, t)
c = -d.n
kr = kg = kb = 1
else
kr = exp(-alphar * t)
kg = exp(-alphag * t)
kb = exp(-alphab * t)
if (refract(d, -n, 1/n t) then
c = t.n
else
return k * color(p+t*r)
R0 = (n-1)^2 / (n+1)^2
R = R0 + (1-R0)(1 - c)^5
return k(R color(p + t*r) + (1-R)color(p+t*t)
Distribution Ray Tracing
35
Distribution Ray Tracing
• Anti-aliasing
• Soft Shadows
• Depth of Field
• Glossy Reflection
• Motion Blur
• Turns Aliasing into Noise
36
Sampling
37
Soft Shadows
38
Depth of Field
Soler et al., Fourier Depth of Field, ACM TOG v28n2, April 2009
Pinhole Lens
Lens Model
Real Lens
Focal Plane
Lens Model
Focal Plane
Ray Traced DOF
• Move image plane out to focal plane
• Jitter start position within lens aperture
– Smaller aperture = closer to pinhole
– Larger aperture = more DOF blur
Glossy Reflection
45
Motion Blur
• Things move while the shutter is open
Ray Traced Motion Blur
• Include information on object motion
• Spread multiple rays per pixel across time

Raytrace

Uploaded by

Copyright:

Available Formats

Raytrace

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Raytrace

Uploaded by

Copyright:

Available Formats

Basic Ray Tracing

Parallel projection Perspective projection

• Plot light leaving from each point on surface

• Plot light leaving from each point on surface

n=1 n=2 n=4

n=8 n=16 n=32

n=64 n=128 n=256

• Recall that the k? are by wavelength

• Turns Aliasing into Noise

You might also like