A kd-tree would be a good fit for this problem. You'd want to keep a child count in each node.
On Aug 25, 8:59 am, Raj N <rajn...@gmail.com> wrote: > Given location of huge number of points (you decide the data structure > to represent them). Write a function that returns the number of points > that are with distance D of a given point P. > Write function, complete with what data structures, function signature > etc. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@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.
