Features of solving the range searching problems for d-dimensional case

MaRDI QIDQ2850360zbMATH OpenFDO

Authors V. N. Tereshchenko, A. L. Fisunenko

Publication date 26 September 2013

Published in Visnyk. Seriya: Fizyko-Matematychni Nauky. Kyïvs'kyĭ Universytet Imeni Tarasa Shevchenka (Search for Journal in Brave)

zbMATH Keywords

treerange searchingconvex surfaced-dimensional space

Mathematics Subject Classification ID

Search theory (90B40)

Recommendations

• Quasi-optimal range searching in spaces of finite VC-dimension
• Linear space data structures for two types of range search
• scientific article; zbMATH DE number 403950
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• scientific article; zbMATH DE number 1241835

Cited in

(4)

• A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem
• General methods for adding range restrictions to decomposable searching problems
• Range searching in multidimensional databases using navigation metadata
• Simplex Range Searching and Its Variants: A Review

This page was built for publication: Features of solving the range searching problems for d-dimensional case

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2850360)