[algogeeks] Re: Chord Intersection

Sun, 23 Apr 2006 21:45:22 -0700

It's a radial plane sweep. However, Dhyanesh, why do we need to deal with radial sorting.  I think the simple Bentley-Ottman line-sweep should do the trick.
(Pramod) This algorithm is used to determine pairwise segment intersections in the plane in O(nlogn) time.
mayur


On 4/24/06, pramod <[EMAIL PROTECTED]> wrote:

I don't get this, can you explain it?




--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---

Reply via email to