use line sweep method On 7/20/11, Dumanshu <duman...@gmail.com> wrote: > Describe an algorithm that takes an unsorted array of axis‐ > aligned rectangles and returns any pair of rectangles that > overlaps, if there is such a pair. Axis‐aligned means that > all the rectangle sides are either parallel or perpendicular > to the x and y‐axis. You can assume that each rectangle > object has two variables in it : the x‐y coordinates of the > upper‐left corner and the bottom‐right corner. > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > >
-- Somnath Singh -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
