Last active
December 23, 2015 16:09
-
-
Save jsimmons/6660282 to your computer and use it in GitHub Desktop.
A nasty little rasteriser that does nothing interesting!
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<stdio.h> // ./rast > test.ppm | |
#include<stdlib.h> // fgiesen.wordpress.com/2013/02/17/optimizing-sw-occlusion-culling-index/ | |
#include<string.h> | |
#define W 800 | |
#define H 600 | |
#define X(a,b) (a)>(b)?(a):(b) | |
#define X3(a,b,c) X(X(a,b),(c)) | |
#define N(a,b) (a)<(b)?(a):(b) | |
#define N3(a,b,c) N(N(a,b),(c)) | |
typedef float f;typedef int i;char b[W*H]={};struct F{f x,y,z;};struct I | |
{i x,y,z;I&operator+=(I&o){x+=o.x;y+=o.y;z+=o.z;return*this;}};i o(I&a,I | |
&b,I&c){return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);}i main(){I t[]={ | |
{10,10,0},{115,10,128},{10,115,0},{10,120,0},{125,15,255},{125,125,0}}; | |
for(i j=0;j<sizeof(t)/sizeof(t[0]);j+=3){I v0=t[j],v1=t[j+1],v2=t[j+2];I | |
n={X(N3(v0.x,v1.x,v2.x),0),X(N3(v0.y,v1.y,v2.y),0)},x={N(X3(v0.x,v1.x, | |
v2.x),W-1),N(X3(v0.y,v1.y,v2.y),H-1)},A={v1.y-v2.y,v2.y-v0.y,v0.y-v1.y}, | |
B={v2.x-v1.x,v0.x-v2.x,v1.x-v0.x},p=n,r={o(v1,v2,p),o(v2,v0,p),o(v0,v1,p | |
)};f a=1.0f/(r.x+r.y+r.z);F Z={v0.z,(v1.z-v0.z)*a,(v2.z-v0.z)*a};for(; | |
p.y<=x.y;p.y++){I w=r;for(p.x=n.x;p.x<=x.x;p.x++){i z=Z.x*w.x+Z.y*w.y+ | |
Z.z*w.z;if((w.x|w.y|w.z)>=0) b[p.y*W+p.x]=z;w+=A;}r+=B;}}printf("P5 %d " | |
"%d 255 ",W,H);for(i y=H;y--;)for(i x=W;x--;)printf("%c",b[y*W+x]);} |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// The less horrible version that I can actually change. | |
#include<stdio.h> | |
#include<stdlib.h> | |
#include<string.h> | |
#define W 800 | |
#define H 600 | |
#define X(a,b) (a)>(b)?(a):(b) | |
#define X3(a,b,c) X(X(a,b),(c)) | |
#define N(a,b) (a)<(b)?(a):(b) | |
#define N3(a,b,c) N(N(a,b),(c)) | |
typedef float f;typedef int i;char b[W*H]={};struct F{f x,y,z;}; | |
struct I{i x,y,z;I&operator+=(I&o){x+=o.x;y+=o.y;z+=o.z;return*this;}}; | |
i o(I&a,I&b,I&c){return (b.x-a.x)*(c.y-a.y)-(b.y-a.y)*(c.x-a.x);} | |
i main(){ | |
I t[]={{10,10,0},{115,10,128},{10,115,0},{10,120,0},{125,15,255},{125,125,0}}; | |
for(i j=0;j<sizeof(t)/sizeof(t[0]);j+=3){ | |
I v0=t[j],v1=t[j+1],v2=t[j+2]; | |
I n={X(N3(v0.x,v1.x,v2.x),0),X(N3(v0.y,v1.y,v2.y),0)}, | |
x={N(X3(v0.x,v1.x,v2.x),W-1),N(X3(v0.y,v1.y,v2.y),H-1)}, | |
A={v1.y-v2.y,v2.y-v0.y,v0.y-v1.y},B={v2.x-v1.x,v0.x-v2.x,v1.x-v0.x}, | |
p=n,r={o(v1,v2,p),o(v2,v0,p),o(v0,v1,p)}; | |
f a=1.0f/(r.x+r.y+r.z); | |
F Z={v0.z,(v1.z-v0.z)*a,(v2.z-v0.z)*a}; | |
for(;p.y<=x.y;p.y++){ | |
I w=r; | |
for(p.x=n.x;p.x<=x.x;p.x++){ | |
i z=Z.x*w.x+Z.y*w.y+Z.z*w.z; | |
if((w.x|w.y|w.z)>=0) b[p.y*W+p.x]=z; | |
w+=A; | |
} | |
r+=B; | |
} | |
} | |
printf("P5 %d %d 255 ",W,H);for(i y=H;y--;)for(i x=W;x--;)printf("%c",b[y*W+x]); | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment