Cargando…
Finding Pairwise Intersections Inside a Query Range
We study the following problem: preprocess a set [Formula: see text] of objects into a data structure that allows us to efficiently report all pairs of objects from [Formula: see text] that intersect inside an axis-aligned query range [Formula: see text] . We present data structures of size [Formula...
| Autores principales: | , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2017
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC6428404/ https://www.ncbi.nlm.nih.gov/pubmed/30956379 http://dx.doi.org/10.1007/s00453-017-0384-3 |