Independent range sampling, revisited

DOI10.4230/LIPICS.ESA.2017.3MaRDI QIDQ5111686zbMATHFDO

Authors Peyman Afshani, Zhewei Wei

Publication date 27 May 2020

zbMATH Keywords

data structuresrange searchingrandom samplingrange sampling

Mathematics Subject Classification ID

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

Recommendations

• Succinct sampling from discrete distributions
• Efficient sampling methods for discrete distributions
• Weighted random sampling with a reservoir

Cites work

• scientific article; zbMATH DE number 1241835 (Why is no real title available?)
• A general approach for cache-oblivious range reporting and approximate range counting
• Computational geometry. Algorithms and applications.
• Efficient partition trees
• On approximate range counting and depth
• Optimal halfspace range reporting in three dimensions
• Orthogonal range searching on the RAM, revisited
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• Reporting points in halfspaces
• The power of geometric duality
• Time-space trade-offs for predecessor search

Cited in

(2)

• On sampling by index cases
• scientific article; zbMATH DE number 7559204 (Why is no real title available?)

This page was built for publication: Independent range sampling, revisited

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