For this year’s js1k I wanted to build a simple ray-tracer to see both how much could I fit in 1k and the performance of js.

I started by adding a very simple (trivial) camera implementation and adding a sphere primitive:

Results where not mind blowing but, hey, that was a start. Code was pretty simple:

//w = canvas width //h = canvas height //F = pixels skipped. At F=1 we would compute the real value each pixel, at 2, we would compute at every 2 pixels, and so on.. // where the camera is and where the camera is looking origin=[0,0,-1000] dst =[0,0,1000] fov = 90 ... // compute direction vector and horizontal & vertical vectors (hv & vv respectively) cd=[dst[0]-origin[0], dst[1]-origin[1], dst[2]-origin[2]] u(cd) alpha = Math.PI*fov/360.0 focaldist = w * Math.cos(alpha)/(2*Math.sin(alpha)) cv=[origin[0]+cd[0]*focaldist, origin[1]+cd[1]*focaldist, origin[2]+cd[2]*focaldist] hv=[-cd[2],0,cd[0]] vv=x(hv, cd) // compute the view vector v=[cv[0]-vv[0]*h2-hv[0]*w2-origin[0], cv[1]-vv[1]*h2-hv[1]*w2-origin[1], cv[2]-vv[2]*h2-hv[2]*w2-origin[2]] for(i=0;i<h;i+=F) { vl=[v[0], v[1], v[2]]; for(j=0;j<w;j+=F) { d = [vl[0],vl[1],vl[2]] u(d) os = it(origin, d) if(os[0] != -1) { c.fillStyle='#fff' } else { c.fillStyle='#28A' } c.fillRect(j, i, F, F) // we add the computed camera horizontal vector for each column vl[0] += hv[0] * F vl[1] += hv[1] * F vl[2] += hv[2] * F } // we add the computed camera vertical vector for each row v[0] += vv[0] * F v[1] += vv[1] * F v[2] += vv[2] * F }

Functions u & x are two small utilities to calculate the unit vector and cross product:

function u(v) { m = Math.sqrt(v[0] * v[0] + v[1] * v[1] + v[2] * v[2]) v[0]/=m v[1]/=m v[2]/=m } function x(u,v) { k=[] k[0]=u[1]*v[2] - u[2]*v[1] k[1]=-(u[0]*v[2] - u[2]*v[0]) k[2]=u[0]*v[1] - u[1]*v[0] return k }

and the intersection code was straightforward:

function it(o, d) { os = -1 maxt = 100000000.0 for(k=0;k0) { t=tca-Math.sqrt(thc); } } if(t<maxt) { maxt = t; os = k } } return [os, maxt] }

Shading was trivial as well (if we can even call it shading):

os = it(origin, d) if(os[0] != -1) { c.fillStyle='#fff' } else { c.fillStyle='#28A' }

Draw it white if there is an intersection or background-blueish if it isn’t.

Now that we get the basics in place, let’s add more spheres, colors and some shading:

os = it(origin, d) if(os[0] != -1) { // point of intersection: origin + direction ray * t ol=[origin[0] + d[0] * os[1], origin[1] + d[1] * os[1], origin[2] + d[2] * os[1]] // intersection point normal (point - sphere center) ir=sphereList[os[0]*S + 5] n=[(ol[0] - sphereList[os[0]*S]) * ir, (ol[1] - sphereList[os[0]*S+1]) * ir, (ol[2] - sphereList[os[0]*S+2]) * ir, ] u(n) // light position ll=[0,-1000,0] // intersection point -> light direction vector rl=[ll[0] - ol[0], ll[1] - ol[1], ll[2] - ol[2]] u(rl) // sphere color r=sphereList[os[0]*S + 5] g=sphereList[os[0]*S + 6] b=sphereList[os[0]*S + 7] // color factor = dot product of normal and light direction vector al=n[0]*rl[0] + n[1]*rl[1] + n[2]*rl[2] if(al>0.0){ r*=al g*=al b*=al } else { r=0 g=0 b=0 } r=(r*16)|0 g=(g*16)|0 b=(b*16)|0 c.fillStyle='#'+hexmap[r]+hexmap[g]+hexmap[b]; } else { c.fillStyle='#28A' }

Results are quite ‘gouradish’:

So, let’s add a specular component to the light:

// compute the reflection of the ray al=2*(n[0]*d[0]+n[1]*d[1]+n[2]*d[2]) rx=[d[0] - al * n[0], d[1] - al * n[1], d[2] - al * n[2] ] // and the dot product with the light vector ls=rx[0]*rl[0]+ rx[1]*rl[1]+ rx[2]*rl[2] // the higher the exponent, more focused will be the specular: ls=ls0.0){ r=r*al+ls g=g*al+ls b=b*al+ls }

And here the result:

We can also play with the specular exponent. Below the differences between 20, 8 and 2:

So far, things are quite simple, but what would be a raytracer without shadows? Let’s also add some shadows!

As we have one single light, it is quite straightforward, before shading each pixel, trace a ray from the intersection point to the light position. If there is any positive intersection of an object it means that point is occluded and shouldn’t be shadowed. As we already have the function to calculate intersections written, it also very simple:

// compute the 't' value of the equation. This will be used as the maximum value for the 't'. Any object further than that will not occlude the light tl=(ll[2] - ol[2])/rl[2] sh=it(ol, rl, tl, os[0]) // if not intersection, let's shade the pixel normally if(sh[0]==-1){ ... // shading algorithm ... } else { // pixel is shadowed, apply only ambient color }

Result starts to look pretty decent:

I’ve also added another primitive: a horizontal plane:

if(sl[k*S+7] == 0) { ... // sphere intersection ... } else { vd=sl[k * S + 0] * d[0] + sl[k * S + 1] * d[1] + sl[k * S + 2] * d[2]; vo=-sl[k * S + 0] * o[0] + sl[k * S + 1] * o[1] + sl[k * S + 2] * o[2] + sl[k * S + 3]; t=vo/vd }

Just had to add another entry to the object definition array:

sl = [1000, 500, 2000, 250000, 0.8, 0.2, 0.3, 0, -1000, 500, 2000, 250000, 0.3, 0.2, 0.8, 0, 0, 500, 3000, 250000, 0.3, 0.8, 0.2, 0, 0, 1, 0, 1000, 0.6, 0.6, 0.6, 1 ]

Entries in this array have the following meaning:

// x // y // z // squared radius (radius * radius) or displacement if primitive is a plane // red // green // blue // object type (0 - sphere, 1 - horizontal plane)

Normal has to be computed in a different way depending on the primitive type. In the case of the plane I was planning to do a checkerboard, but to save some space I ended up creating stripes:

r=sl[os[0]*S + 4] g=sl[os[0]*S + 5] b=sl[os[0]*S + 6] // normal reset to vertical vector n=[0,-1,0] if(sl[os[0]*S+7]==0) { // if we intersect a sphere, let's recalculate the normal n=[(ol[0] - sl[os[0]*S]), (ol[1] - sl[os[0]*S+1]), (ol[2] - sl[os[0]*S+2]) ] u(n) } else { //tweak color depending on distance - the 1000 was chosen in the most scientific way possible - keep playing with the value until it feels right cl=(ol[2]/1000|0)%2 r=1 b=0 if(cl==0) { g=1 } else { g=0 } }

Result was the following:

We’re still missing one key feature of raytracers, reflections! In order to add reflections, we need to create a function that calculates the intersection & computes the resulting color. We’ll call it recursively:

// if reflection index is smaller than 3, compute a reflected ray color & merge it with current color (70% + 30%) // we limit the amount of reflections to 3 levels if(rc < 3) { rxc = cil(ol, rx, rc+1) r=r*0.7+rxc[0]*0.3 g=g*0.7+rxc[1]*0.3 b=b*0.7+rxc[2]*0.3 }

By adding reflections, looks slightly better:

Also, as you could see in this last screenshot, there was an small intent of CSG (Constructive Solid Geometry). I added a sphere that was ‘substracting’ from other primitives.

At the end, I managed to fix the CSG intersection code. In order to make it work we’ve to calculate both the minimum and the maximum ‘t’ of the ray intersection and work out all the different options:

---- direction ray * intersection of original object # intersection of the subtracting object trivial case, normal intersection 1)---------*----*----#---#------- trivial case, normal intersection 2)---------#----#----*---*------- trivial case, normal intersection 3)---------*----#----#---*------- trivial case, normal intersection 4)---------*----#----*---#------- trivial case, no intersection (subtracting object is wrapping the whole object) 5)---------#----*----*---#------- intersection would be the exit point of subtracting object (second #) 6)---------#----*----#---*-------

And the updated intersection code. Used a ‘magic’ code -2 to detect we’re checking the CSG intersection: (Kids don’t do that at home!)

var csi=0 if(z!=-2 &&t!=t2){ var csg=it(o,d,maxt,-2) if(csg[0]==5) { if(csg[1] < t && csg[2] > t && csg[2] < t2) { t=csg[2] csi = 1 } else if(csg[1] < t && csg[2] > t2) { t = maxt } } }

In addition, I also added another primitive: a vertical cylinder.

if(sl[k*S+7] == 0) { // sphere intersection } else if(sl[k*S+7] == 1) { // plane intersection } else { // cylinder var rd2=1.0-d[1]*d[1] var b=sl[k*S + 3]*rd2 var b2=d[0]*(o[2]-sl[k*S + 2]) - d[2]*(o[0]-sl[k*S + 0]) b-=b2*b2 if(b>0) { b2 = Math.sqrt(b) b=d[0]*(o[0]-sl[k*S + 0]) + d[2]*(o[2]-sl[k*S + 2]) t=-(b+b2)/rd2 t2=-(b-b2)/rd2 } }

And here is the result:

Unfortunately, after using Uglify (https://github.com/mishoo/UglifyJS) and RegPack (http://siorki.github.io/regPack.html) the resulting size was over 1600 bytes so I had to start a heavy optimization to get it under 1024. I removed the CSG intersection code :(, simplified the RGB filling color to:

r=(col[0]*255)|0 g=(col[1]*255)|0 b=(col[2]*255)|0 c.fillStyle='rgba('+r+','+g+','+b+',1)' c.fillRect(j, i, F, F)

instead of using the hexmap and 16 different shades per component – I kind of liked it the pixelated/oldschool effect, but it was slightly shorter & definitely faster.

After some time optimizing and doing some sacrifices I managed to get it under 1024. It was a pity I couldn’t spend any more time on it as I would really tried to squeeze the CSG code in! ๐

Here is the final source code:

w=window.innerWidth K=500 J=K*K E=1000 D=1500 G=0 l=n=[] O = [0, K, 0, J*2, 1, 0, 0, 0, 0, K, 0, J, 0, 0, 1, 0, 0, K, 0, J, 0, 1, 0, 0, 0, E, E*2, J, 1, 1, 1, 2, 0, 1, 0, E, 1, 0, 0, 1] // dot product dp = (u,v) => u[0]*v[0]+u[1]*v[1]+u[2]*v[2] // unit vector u = v => { m = Math.sqrt(dp(v,v)) v[0]/=m v[1]/=m v[2]/=m } it = (o, d, T) => { u(d) s = -1 t = T for(z=0;z<40;z+=8){ t=(-O[z] * o[0] + O[z + 1] * o[1] + O[z + 2] * o[2] + O[z + 3])/(O[z] * d[0] + O[z + 1] * d[1] + O[z + 2] * d[2]) if(O[z+7] == 0) { e=[O[z] - o[0], O[z + 1] - o[1], O[z + 2] - o[2]] p=dp(e,d) t=p-Math.sqrt(O[z+3]-dp(e,e)+p*p) } if(O[z+7] == 2) { p=1-d[1]*d[1] q=d[0]*(o[2]-O[z + 2]) - d[2]*(o[0]-O[z]) t=-(d[0]*(o[0]-O[z]) + d[2]*(o[2]-O[z + 2])+Math.sqrt(O[z + 3]*p-q*q))/p } if(t>.1&&t<T) { T = t s = z } } return [s, T] } cil = (o,d) => { var r=[.4,.4,.5] I = it(o, d, E*E) if(I[0]>=0) { y=I[0] for(k=0;k<3;k++) { o[k]=o[k] + d[k] * I[1] n[k]=o[k] - O[y+k] l[k]=O[2-k]-o[k]-D*k } if(O[y+7]==1) { n=[0,-1,0] O[y + 5]=(o[2]/E|0)%2 } if(O[y+7]==2) n[1] = 0 u(n) H=it(o, l, E*E) A=2*dp(n,d) rx=[d[0] - A * n[0], d[1] - A * n[1], d[2] - A * n[2]] A=L=0 if(H[0]<0) { L=dp(rx,l) L=L<0?0:Math.pow(L,9) A=dp(n,l) } for(k=0;k<3;k++) r[k]=O[y+4+k]*A+L R = cil(o, rx) for(k=0;k<3;k++) r[k]=(r[k] + R[k])/2 } return r } setInterval(() => { //animation for(i=2;i>=0;i--) { O[i*8] = l[2] = D*Math.sin(G + i*2) O[i*8 + 2] = l[0] = D*Math.cos(G + i*2) + D; } //render for(;i<window.innerHeight;i+=6) { for(j=0;j<w;j+=6) { x=cil([0,0,-D*2], [w/2-j, i-w/6, D-w/6]) c.fillStyle='rgb('+[x[0]*255|0,x[1]*255|0,x[2]*255|0]+')' c.fillRect(j, i, 6, 6) } } G+=.02 }, 10)

and the result can be checked here: https://js1k.com/2018-coins/demo/3101