| |
Shadow
Account closed
Registered: Apr 2002
Posts: 355 |
Creating angle/radius tables
Is there a size-optimized way of getting a angle and radius table? It's easy enough to just precalc like this (pseudocode):
for(int x=0;x<w;x++)
{
for(int y=0;y<h;y++)
{
radius[tab]=sqrt((x-w/2)*(x-w/2)+(y-h/2)*(y-h/2));
angle[tab]=atan2(y-h/2,x-w/2)/PI);
tab++;
}
}
But what if you don't want to have the whole table precalced due to size concerns? Can you save space with some smart mirrortricks, etc.? |
|
... 20 posts hidden. Click here to view all posts....
|
| |
tlr
Registered: Sep 2003
Posts: 1724 |
Reusing knowledge/looking at other peoples solutions before not doing it the same way yourself is the mother of all invention IMO.
Who wants to start understanding how to make paper so they have something to write down their self thought up version of calculus for instance?
I find avoiding looking at other people's code, but still using other people's math a bit inconsistent.
Progress is iterative...
|
| |
Shadow
Account closed
Registered: Apr 2002
Posts: 355 |
Slammer : Thanks, there is that octant mirroring I was going on about. The only drawback is that get a somewhat more complex mirroring since you are not dealing with square blocks anymore.
To chime in on the looking-at-other-peoples-source-debate:
When I started in the eighties, it was just about the only way to find out how stuff was done (atleast for me a fourteen year old kid not smart enough to come up with the VIC-timing stuff by myself :)). It was considered a bit "lame" though as I recall it, but I think almost all coders did it. |
| |
Style
Registered: Jun 2004
Posts: 498 |
Ur 411 t3h l4m3!!
1 2u1+ t3h 5c3N3!!!!!!
:) |
| Previous - 1 | 2 | 3 - Next |
