On 12 Jul 2001 21:35:58 -0400, Jim Snow wrote:
>If someone wants to integrate it correctly into Pov-RAY, Megapov, or
>whatever, be my guest.  You can get my code at
>"http://cs.georgefox.edu/~jsnow/ashlar.c".  Anyone interested?

It's very interesting.  Have you done any calculations to determine what
the maximum search will have to be before you're guaranteed not to be on
a mortar line?  Have you considered using the Noise function instead of
a random array to determine the positions of the seed points?  That would
allow your "array" to be essentially infinite, if you could make it fit
into your algorithm, and it would constrain the positions of the seed 
points to an extent that you might be able to better predict what the 
maximum required search is.  

With those two changes, I think it would be a very useful pattern to 
have.  Also, I think you could get away with having just a single ratio
to determine the number of points horizontally vs. the number vertically,
since you can then scale the bricks to fit your space.

-- 
#macro R(L P)sphere{L F}cylinder{L P F}#end#macro P(V)merge{R(z+a z)R(-z a-z)R(a
-z-z-z a+z)torus{1F clipped_by{plane{a 0}}}translate V}#end#macro Z(a F T)merge{
P(z+a)P(z-a)R(-z-z-x a)pigment{rgbt 1}hollow interior{media{emission T}}finish{
reflection.1}}#end Z(-x-x.2y)Z(-x-x.4x)camera{location z*-10rotate x*90}

Post a reply to this message