Linear space adaptive data structures for planar range reporting

DOI10.1016/J.IPL.2016.01.001MaRDI QIDQ5964824zbMATH OpenOpenAlexFDO

Authors Ananda Swarup Das, Prosenjit Gupta

Publication date 1 March 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2016.01.001

zbMATH Keywords

analysis of algorithmscomputational geometrylinear space data structuresrange minima querieslayers of maximarange aggregate queries

Mathematics Subject Classification ID

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

Recommendations

• A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
• A linear space data structure for range LCP queries
• Space efficient dynamic orthogonal range reporting
• Space efficient dynamic orthogonal range reporting
• Linear space data structures for two types of range search
• Linear-space data structures for range mode query in arrays
• Linear-space data structures for range mode query in arrays
• Space Efficient Multi-dimensional Range Reporting
• Low space data structures for geometric range mode query
• A data structure for multi-dimensional range reporting

Cites work

• scientific article; zbMATH DE number 1947398 (Why is no real title available?)
• scientific article; zbMATH DE number 1445373 (Why is no real title available?)
• A LINEAR SPACE DATA STRUCTURE FOR ORTHOGONAL RANGE REPORTING AND EMPTINESS QUERIES
• In-place algorithms for computing (Layers of) maxima
• Orthogonal range searching on the RAM, revisited
• Sorted range reporting
• Untangled monotonic chains and adaptive range search

Cited in

(1)

• Four-dimensional dominance range reporting in linear space

This page was built for publication: Linear space adaptive data structures for planar range reporting

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