[algogeeks] minimum bound rectangle problem

I have Some rectangles of fixed size,and i have to arrange them such that there in no overlap between them And area of Rectangle containing all of smaller rectangle in minimum. Please suggest me some algorithm http://en.wikipedia.org/wiki/Minimum_bounding_rectangle --~--~-~--~--

[algogeeks] Re: urgent

Consider a rectangle of M & N .Inside that there are many small overlapping rectangles.Now i have to minimize overlapping area such that the "% increase in size (M & N) -> 0 ". means readjust smaller rectangles such that they do't overlap. Please suggest some algo

[algogeeks] random number generator

i worked in *visual studio 8*,and there is a function *rand()* to generate random numbers. But now i have to work on *visual studio 6*, is there any such function? --~--~-~--~~~---~--~~ You received this message because you are subscribed to the Google Groups "Al