Hi Guys, Please give some insights on these. Thanks.
Vinodh
On May 29, 4:31 pm, Vinodh [EMAIL PROTECTED] wrote:
Hi,
For some time now I started studying Algos and Data Structures. I got
these question when I was going through Hashing. Please help me
answering them. Some questions are of
Hi Guys,
Can anyone please give me a solution for this??
On a plane if there are n points. How to find out if there are three (3)
points which are collinear in O(N**2log n) time. I got a solution which uses
extra space. But i need a solution which doesn't use any extra space.
Thanks,
Greetings!
As the subject line specifies, am trying to compute the area of
overlap between two rectangles that can have any arbitrary
orientation. I plan to go about this by finding vertices of Rectangle1
contained in Rectangle2 and vice versa. Then, I will find the points
of intersection
Some ideas:
- Divide each of the rectangles into 2 triangles, then calculate each 2
triangles intersection(from opposing rectangles).
- Use line sweep method.
- Ucse convex-polygon intersection method mentioned in almost every
computational geometry book.(or find some on the
On Jun 2, 4:59 pm, Vasant [EMAIL PROTECTED] wrote:
Greetings!
As the subject line specifies, am trying to compute the area of
overlap between two rectangles that can have any arbitrary
orientation. I plan to go about this by finding vertices of Rectangle1
contained in Rectangle2 and vice
