Share Your Experience: Take the 2024 Developer Survey

# Tag Info

## New answers tagged searching

### Efficient data structure for multidimensional lookup

IF the set of GOOD tuples is fixed and you only need to know if the new point would be classified as GOOD or BAD, then you could train a binary classifier(like a decision tree) to reach the binary ...

### Efficient data structure for multidimensional lookup

If I understand your problem correctly, this problem is also known as Skyline query. Well, almost, I think in Skyline queries a point is GOOD if it is strictly smaller, but I think all traditional ...
• 764

### Chess Knight minimum moves to destination on an infinite board

It seems there is an article from 1988 that solves this exact problem named "Knight's distance in digital geometry" Basically, the algorithm is as follows: ...
1 vote

### Efficient data structure for multidimensional lookup

It seems that your problem could be expressed as "orthogonal range searching". This wiki page has a section with links to some algorithms, maybe one of them could work for you. https://en....

### Efficient data structure for multidimensional lookup

I depends on what you mean by efficient and what your general dataset looks like. A while ago it did a comparison of multiple multidimensional indexes, one scenario was datastructure with 1'000'000 ...
• 764
Here is an idea: Let us first define that a tuple $A$ dominates another tuple $B$ if, $\forall i$, $A_i \le B_i$. Now consider a DAG-like data structure where the tuples are represented as nodes, and ...