POV-Ray : Newsgroups : povray.programming : Alternative Box Intersection Algorithm : Re: Alternative Box Intersection Algorithm Server Time
30 Jun 2024 12:54:54 EDT (-0400)
  Re: Alternative Box Intersection Algorithm  
From: Warp
Date: 14 Sep 2004 16:03:07
Message: <41474e7b@news.povray.org>
Ryan Lamansky <Spa### [at] kardaxcom> wrote:
> Theoretically, it should be faster because it's so much simpler.

  Code simplicity is in no way a measurement of speed. (For example,
insertion sort is much simpler than quicksort, yet it's also much
slower.)

  I'm not saying your code is not faster, I'm just saying that you
should be careful on what you claim. :)

-- 
#macro M(A,N,D,L)plane{-z,-9pigment{mandel L*9translate N color_map{[0rgb x]
[1rgb 9]}scale<D,D*3D>*1e3}rotate y*A*8}#end M(-3<1.206434.28623>70,7)M(
-1<.7438.1795>1,20)M(1<.77595.13699>30,20)M(3<.75923.07145>80,99)// - Warp -


Post a reply to this message

Copyright 2003-2023 Persistence of Vision Raytracer Pty. Ltd.