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...
Na minha lista:
| Principais autores: | , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
Carleton University
2025-03-01
|
| Colecção: | Journal of Computational Geometry |
| Acesso em linha: | https://jocg.org/index.php/jocg/article/view/4023 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|