.:: Bots United ::. - improving obstacle detection with trigonometry

Page 2 of 2

Show 40 post(s) from this thread on one page

.:: Bots United ::. (http://forums.bots-united.com/index.php)

- General Bot Coding (http://forums.bots-united.com/forumdisplay.php?f=24)

- - improving obstacle detection with trigonometry (http://forums.bots-united.com/showthread.php?t=568)

Pierre-Marie Baty

03-02-2004 10:33

Re: improving obstacle detection with trigonometry

Heck, how does he manage to find all this stuff...

if I understand you right,

Code:

                           n  (2n+1)

                   (-1) .x

sin (x) ~= -------------

                          (2n+1)!

but what is n ?

@$3.1415rin

03-02-2004 13:59

Re: improving obstacle detection with trigonometry

almost ... you take each n from 0 to infinity and sum up all those terms. so sin x is not what you said, but the sum of all those terms. now you can take only the first parts of the sum if you only need convergence around 0

but using a table would be the best solution in your case I guess

All times are GMT +2. The time now is 07:09.

Page 2 of 2

Show 40 post(s) from this thread on one page