Timeline for Children of internal node in a quadtree with high dimensionality
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 4, 2021 at 17:32 | comment | added | TilmannZ | If you are interested in high-dimensional quadtree-type indexes, have a look at my PH-Tree. It is a somewhat optimized quadtree that works well with 50 dimensions, it was comparable to R-Tree performance for up to 1000 dimensions. Especially for highly clustered data (I tested with 40 dimensions) it seems to have much faster k-nearest-neighbor queries than kd-trees. The original paper (see link above) also discusses the number of subnodes in a quadtree. | |
| Jul 4, 2021 at 10:12 | vote | accept | FlubberBeer | ||
| Jul 3, 2021 at 16:12 | answer | added | dirkt | timeline score: 2 | |
| Jul 2, 2021 at 12:06 | history | asked | FlubberBeer | CC BY-SA 4.0 |