[algogeeks] Re: fatest algorithm to find suqre root of a big number of 1000 didgits
Correcting the link: http://acm.uva.es/p/v100/10023.html 2007/8/12, kuper [EMAIL PROTECTED]: there is the same problem on the on-line judge (http://online- judge.uva.es/p/v100/10023.html) --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Re: DANGEROUS SITUATION
I don't understand your messages. It's not related to the group meaning. Why anybody ban this user? 2007/6/17, Sophia Jayann [EMAIL PROTECTED]: This mother is very courageous. Watch it at http://www.amusingclip.com/?vID=1181899263 --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
[algogeeks] Re: geometry problem
I know how to do a easier variation of this problem, is not a simple problem, I think I can help you only with a start point... :) 1) Do you perceive that I can firstly calculate the shortest distance between 2 points based on lines and the rectangle edges, ok? You take all the paths with all arests that not are secant to the obstacles to point A to the desired point, and take the shortest. (If the problem was only this, was still not so simple) look first figure path_direct, You trace the shortest distance to 1 point to all others. 2) You substitute each vector in figure 1 by the X and Y components Figure 2: path_components 3) Line matching for minimal number of rects This part is on your own way :) I helped anything? This is not complete, or optimized, only a idea, but repair if you want to calculate only the total length of the lines, my representation is almost correct, you only need rearrange the segments :) I did included a .svg if it could help you to express your ideas. 2007/6/14, monu [EMAIL PROTECTED]: Please anyone help me.. On 6/14/07, Monu Rathour [EMAIL PROTECTED] wrote: There are some rectangles and some pin-vertices's in a two dimensional plane. I have to join pin-vertices's such that lines are rectilinear and line should not cross over the rectangles. How to write a mathematical formula for calculating path length ? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~--- inline: path_direct.pnginline: path_components.pnginline: geometry distance direct.svginline: geometry distance components.svg
[algogeeks] Re: Testing if 3 points form a triangle
Feng, how can form a triangle in four dimensions??? 2007/5/29, BiGYaN [EMAIL PROTECTED]: Just test whether they are collinear or not i.e. get the slopes, m1 from 1st and 2nd point m2 from 2nd and 3rd point if m1==m2 then they do not form a triangle else they do Computing the area of the triangle and testing for 0 might also work but I feel that the computation will be bigger -- Victor Carvalho Computação - UFC GELSoL - Grupo de Estudos de Linux e Software Livre E-Jr Empresa Júnior de Computação --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups Algorithm Geeks group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~--~~~~--~~--~--~---
