Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

Welcome to the new platform of Programmer's Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use its exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.

Fast multidimensional indexing

KiuhnmKiuhnm Posts: 1Member
I devised an algorithm that, given a set of points in a multidimensional space, can find all the points in an arbitrary box very efficiently.
My algorithm needs space O(n log^(d-1)n) and answers a query, in the worst case, in time O(log^(d-1)n), where d is the dimension of the space.
For instance, if the space is two-dimensional, it requires space O(nlogn) and answers a query, in the worst case, in time O(logn). As you can see, it's *very* fast, but requires some space.
I think it's an important result from a theoretic point of view and not only.
You can find my paper here:
[link=http://wcemdi.blogspot.com/]http://wcemdi.blogspot.com/[/link]

Technical papers, as always, make algorithms look *much* more complex than they really are. If you want to discuss a part of the paper, you find an error, or there is a point particularly unclear, don't hesitate to ask.
Sign In or Register to comment.