scientific article; zbMATH DE number 7760157

DOI10.4230/LIPICS.SOCG.2020.28MaRDI QIDQ6059976zbMATH OpenFDO

Authors Timothy M. Chan, Qizheng He, Yakov Nekrich

Publication date 2 November 2023

Full work available at URL https://arxiv.org/abs/2003.11604

zbMATH Keywords

geometric data structuresrandom samplingrandomized incremental constructionrange searchingword RAM

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Colored Range Searching in Linear Space
• Dynamic Colored Orthogonal Range Searching.
• Colored range queries and document retrieval
• Algorithms and Computation
• Efficient Colored Orthogonal Range Counting
• Approximate colored range and point enclosure queries
• Improved range searching lower bounds
• Colored range closest-pair problem under general distance functions

Cited in

(5)

• Data structures for categorical path counting queries
• Colored Range Searching in Linear Space
• Adaptive data structures for 2D dominance colored range counting
• On approximate colored path counting
• Chromatic k-nearest neighbor queries

This page was built for publication:

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