Timeline for Finding "entrance" points in a set of d-dimensional points. Can I do better than O(N^2)?
Current License: CC BY-SA 4.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 29, 2021 at 10:31 | vote | accept | Turn Right | ||
| Jan 28, 2021 at 18:58 | answer | added | Inuyasha Yagami | timeline score: 2 | |
| Jan 28, 2021 at 18:58 | comment | added | D.W.♦ | It sounds like you're looking for the Pareto frontier (sometimes also known as a skyline query). Searching for those terms should help you find some algorithms, both here and elsewhere. There are good algorithms for the case of $d=2$ dimensions but as the number of dimensions grows they become less effective. | |
| Jan 28, 2021 at 18:37 | review | First posts | |||
| Jan 30, 2021 at 10:22 | |||||
| Jan 28, 2021 at 18:29 | history | asked | Turn Right | CC BY-SA 4.0 |