Approximate range counting revisited

DOI10.4230/LIPICS.SOCG.2017.55zbMATH Open1432.68102OpenAlexW2963182221MaRDI QIDQ4580133FDOQ4580133

Authors Saladi Rahul

Publication date 13 August 2018

Full work available at URL http://dblp.uni-trier.de/db/conf/compgeom/compgeom2017.html#Rahul17

zbMATH Keywords

range searchingapproximate countinggeometric data structurescolorsrectangle stabbing

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Approximate range counting revisited
• Approximate range searching
• Colored Range Searching in Linear Space
• Data structures for approximate orthogonal range counting
• Efficient Colored Orthogonal Range Counting

Cited in

(12)

• Generalized approximate counting revisited
• I/O-optimal categorical 3-sided skyline queries
• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³
• scientific article; zbMATH DE number 7561469 (Why is no real title available?)
• On the Asaithambi-Zuhe-Moore algorithm for computing the range of values
• Approximate colored range and point enclosure queries
• Range and Roots: two common patterns for specifying and propagating counting and occurrence constraints
• Data structures for categorical path counting queries
• Efficient Colored Orthogonal Range Counting
• Algorithms and Computation
• A general approach for cache-oblivious range reporting and approximate range counting
• Approximate range counting revisited

This page was built for publication: Approximate range counting revisited

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