Chromatic k-nearest neighbor queries
Let $P$ be a set of $n$ colored points in $\mathbb{R}^d$. We develop efficient data structures that store $P$ and can answer chromatic $k$-nearest neighbor ($k$-NN) queries. Such a query consists of a query point $q$ and a number $k$, and asks for the color that appears most frequently among the $k...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Inglês |
| Опубліковано: |
Carleton University
2025-03-01
|
| Серія: | Journal of Computational Geometry |
| Онлайн доступ: | https://jocg.org/index.php/jocg/article/view/4023 |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|