#include using namespace std; //this code makes a point that travels in 3d //space forever (or until you hit the largest //int possible). This code doesn't store past //or future points because the present is //what truely matters. struct Point{ int x; int y; int z; //make a new point Point(int X, int Y, int Z){ x = X; y = Y; z = Z; } Point(){ x = 0; y = 0; z = 0; } }; struct Ray{ //these are point objects because its //easier to type/read time.x rather than //time_X, I hope you guys understand. Point slope; //slope of ray Point time; //time since ray was fired Point dir; //direction of travel, this should be 1, 0, or -1 Point point; //current location of ray //make a new ray Ray(Point p, Point s, Point d){ point = p; slope = s; dir = d; time = Point(0, 0, 0); } Ray(){ point = Point(0, 0, 0); slope = Point(0, 0, 0); dir = Point(0, 0, 0); time = Point(0, 0, 0); } void update(){ //if dir.x == 0 then time = 0 //else if dir.x < 0 the subtract 1 from time.x //if dir.x > 0 then add 1 to time.x //new x location for point = the slope of x //multiplied by the time since the ray was //fired (ya I know time cant be negative just deal with it). This is the same process for y and z. dir.x == 0 ? time.x = 0 : dir.x < 0 ? time.x-- : time.x++; point.x = slope.x * time.x; dir.y == 0 ? time.y = 0 : dir.y < 0 ? time.y-- : time.y++; point.y = slope.y * time.y; dir.z == 0 ? time.z = 0 : dir.z < 0 ? time.z-- : time.z++; point.z = slope.z * time.z; return; } }; int main(){ Ray ray(Point(2, 2, 2), Point(2, 2, 2), Point(1, 0, -1)); for(int i = 0; i < 7; i++){ ray.update(); cout<<'('<