> > > Selecting a rectangle is O(log N * M) where M is the number of > datapoints in the 'band'. > Anyone know of anything better? >
i think u can come up with an proof that we can make any algorithm that has complexity less then O(log N * M)...if u have all point array sorted... one more thing...that before searching the point u actually sorting the points...that is taking complexity O((N*logN)*M) at laest.. so order of complexity is O(N*lonN) if M<<N... in this i think we can improve...and can be done in O(N) only....just by searching all elements... -- With Best Regards... ----------- Manish --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
