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

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

zbMATH Keywords

range searchingapproximate countinggeometric data structurescolorsrectangle stabbing

Mathematics Subject Classification ID

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

Cited In (12)

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

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)