Ray tracer language comparison
[
Home
]
[ Index:
by date

by threads
]
[ Message by date: previous  next ] [ Message in thread: previous  next ] [ Thread: previous  next ]
[ Message by date: previous  next ] [ Message in thread: previous  next ] [ Thread: previous  next ]
Date:  20051009 (15:02) 
From:  Jon Harrop <jon@f...> 
Subject:  Re: [Camllist] Ray tracer language comparison 
On Sunday 09 October 2005 06:26, you wrote: > http://www.cip.physik.unimuenchen.de/~tf/raytracer/ I reformatted your code with tuareg indentation and 80char columns to conform with the other implementations for fair comparison, corrected the bug in a call to printf and removed the superfluous parentheses. Your code is then 1 line shorter and 8x slower than the previous implementation on my site. I then rewrote it to be both shorter and faster. For anyone who is interested, the main performance degradation introduced by Thomas came from the use of polymorphic HOFs (particularly Array.init) to perform vector arithmetic that appears in the inner loops of the ray tracer. Here is my implementation that is both 17% shorter in LOC (and shorter in both words and bytes) and 4.7x faster than Thomas': let ( * ) s (x, y, z) = s *. x, s *. y, s *. z let ( + ) (x1, y1, z1) (x2, y2, z2) = x1 +. x2, y1 +. y2, z1 +. z2 let (  ) (x1, y1, z1) (x2, y2, z2) = x1 . x2, y1 . y2, z1 . z2 let dot (x1, y1, z1) (x2, y2, z2) = x1 *. x2 +. y1 *. y2 +. z1 *. z2 let unitise r = (1. /. sqrt (dot r r)) * r let ray_sphere orig dir center radius = let v = center  orig in let b = dot v dir in let disc = sqrt(b *. b . dot v v +. radius *. radius) in if disc <> disc  b +. disc < 0. then infinity else if b . disc > 0. then b . disc else b +. disc let rec intersect orig dir ((lambda, _) as hit) (center, radius, children) = let lambda' = ray_sphere orig dir center radius in if lambda' >= lambda then hit else match children with  `List [] > lambda', unitise (orig + lambda' * dir  center)  `List children > List.fold_left (intersect orig dir) hit children let intersect orig dir = intersect orig dir (infinity, (0., 0., 0.)) let neg_light = unitise (1., 3., 2.) and ss = 4 let rec ray_trace orig dir scene = let lambda, normal = intersect orig dir scene in if lambda = infinity then 0. else let g = max 0. (dot normal neg_light) in let p = orig + lambda * dir + sqrt epsilon_float * normal in if g = 0.  fst (intersect p neg_light scene) < infinity then 0. else g let rec create level c r = let obj = c, r, `List [] and a = 3. *. r /. sqrt 12. in if level = 1 then obj else let f x' z' = create (level1) (c + (x', a, z')) (0.5 *. r) in c, 3. *. r, `List [obj; f (.a) (.a); f a (.a); f (.a) a; f a a] let n, scene = match Sys.argv with [ _; l; n] > int_of_string n, create (int_of_string l) (0., 1., 4.) 1.  _ > 512, create 9 (0., 1., 4.) 1.;; Printf.printf "P5\n%d %d\n255\n" n n;; for y = n  1 downto 0 do for x = 0 to n  1 do let g = ref 0. in for dx = 0 to ss  1 do for dy = 0 to ss  1 do let aux x d = float x . float n /. 2. +. float d /. float ss in let dir = unitise (aux x dx, aux y dy, float n) in g := !g +. ray_trace (0., 0., 0.) dir scene done done; let g = 0.5 +. 255. *. !g /. float (ss*ss) in Printf.printf "%c" (char_of_int (int_of_float g)) done done The main source of performance degradation in this implementation is probably the use of tuples to represent vectors rather than records. With ocamlopt, the floats in records of floats are unboxed but the floats in tuples of floats are not. Thus, this implementations places extra burden on the allocator and GC.  Dr Jon D Harrop, Flying Frog Consultancy Ltd. Objective CAML for Scientists http://www.ffconsultancy.com/products/ocaml_for_scientists