scientific article; zbMATH DE number 7204981

DOI10.4230/LIPIcs.ESA.2017.3zbMath1442.68035MaRDI QIDQ5111686

Peyman Afshani, Zhewei Wei

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

data structuresrandom samplingrange searchingrange sampling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A general approach for cache-oblivious range reporting and approximate range counting
• The power of geometric duality
• Reporting points in halfspaces
• Efficient partition trees
• Time-space trade-offs for predecessor search
• Random Sampling, Halfspace Range Reporting, and Construction of \lowercase$(\le k)$-Levels in Three Dimensions
• Orthogonal range searching on the RAM, revisited
• On approximate range counting and depth

This page was built for publication: