Approximate range searching
type: Item
instance of: scholarly article
title: Approximate range searching
zbMATH Open document ID: 0968.68167
DOI: 10.1016/S0925-7721(00)00022-5
author: Sunil Arya
author: David M. Mount
published in: Computational Geometry
publication date: 2001-09-13T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1563818
zbMATH Keywords: range searching problem
MaRDI profile type: Publication
cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions
cites work: Approximate closest-point queries in high dimensions
cites work: How hard is half-space range searching?
cites work: A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
cites work: Lower Bounds on the Complexity of Polytope Range Searching
cites work: Quasi-optimal range searching in spaces of finite VC-dimension
cites work: Balanced aspect ratio trees: Combining the advantages of \(k\)-\(d\) trees and octrees
cites work: Rate-distortion performance of DPCM schemes for autoregressive sources
cites work: Range searching with efficient hierarchical cuttings
cites work: Point location in fat subdivisions
cites work: Q3992847
cites work: An O(n log n) algorithm for the all-nearest-neighbors problem
cites work: Polygon Retrieval
description: scientific article; zbMATH DE number 1563818