Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
type: Item
instance of: scholarly article
zbMATH Open document ID: 1433.68484
author: Timothy M. Chan
publication date: 2018-08-13T00:00:00Z
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6917046
zbMATH Keywords: computational geometry
zbMATH Keywords: data structures
zbMATH Keywords: range searching
zbMATH Keywords: nearest neighbor searching
MaRDI profile type: Publication
full work available at URL: LIPIcs.SoCG.2017.27
OpenAlex ID: W2724706363
title: Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back
DOI: 10.4230/LIPICS.SOCG.2017.27
Recommended article: Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back
Recommended article: The \(n\)-dimensional \(k\)-vector and its application to orthogonal range searching
Recommended article: Compact and succinct data structures for multidimensional orthogonal range searching
Recommended article: Orthogonal range searching in linear and almost-linear space
Recommended article: Orthogonal Range Searching in Linear and Almost-Linear Space
Recommended article: On the average performance of orthogonal range search in multidimensional data structures
Recommended article: Q4737184
Recommended article: Algorithms for graphs of bounded treewidth via orthogonal range searching
Recommended article: Efficient Top-k Queries for Orthogonal Ranges
Recommended article: Faster Linear-space Orthogonal Range Searching in Arbitrary Dimensions
description: scientific article; zbMATH DE number 6917046