tuned ray-triangle intersection, now there are three algorithms to choose from:
Plucker, Barycentric and Barycentric with preprocessing (Wald)
methods in Vector and Shape (and derivates) made const
* kd-tree:
- optimize structures
- optimize construction: do not use bounding boxes of shapes, instead implement box-shape intersection
- save/load
* update Python binding, Camera, new classes
* more complex demos
* check/update triangle routines
* namespace
New Classes?
============
container.h -- Container
kdtree.h -- KdTree
shapes.h -- Triangle, Sphere
scene.h -- Ray, Light, Camera, Scene
material.h -- Material, Texture
matrix.h -- Matrix
vector.h -- Vector3
reader.h -- Reader, WavefrontReader
KdTree top
wf = new WavefrontReader()
wf.setContainer(top)
wf.setTransform(monkey_pos_matrix)
wf.read("monkey.obj")
// more transform&reads
destroy wf
top.optimize() -- i.e. build tree
Scene scene -- container with shapes, a camera and lights
scene = new Scene()
scene.setTop(top) -- top object in hierarchy
scene.setCamera(new Camera(eye, u, v, p))
scene.addLight(new PointLight(pos, color))
rt.setScene(scene)
rt.render(w,h)
constructors have zero or one parameter by default -- the object to copy data from
more parameters -- the data (ray origin and direction)