Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

DOI10.1007/978-3-540-30551-4_49zbMath1116.68629OpenAlexW1889224378MaRDI QIDQ5712144

Qingmin Shi, Christian Worm Mortensen, Joseph F. Ja'Ja'

Publication date: 22 December 2005

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-30551-4_49

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (31)

The heaviest induced ancestors problem: better data structures and applications ⋮ Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods ⋮ The range 1 query (R1Q) problem ⋮ Efficient range searching for categorical and plain data ⋮ Space efficient data structures for dynamic orthogonal range counting ⋮ Entropy-bounded representation of point grids ⋮ Absent Subsequences in Words ⋮ Monge properties of sequence alignment ⋮ Unnamed Item ⋮ Biased range trees ⋮ Adaptive data structures for 2D dominance colored range counting ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Wavelet trees for all ⋮ Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds ⋮ On Dominance Reporting in 3D ⋮ Path queries on functions ⋮ Substring range reporting ⋮ Color-spanning localized query ⋮ Join-reachability problems in directed graphs ⋮ Linear-space data structures for range mode query in arrays ⋮ Towards optimal range medians ⋮ Semi-local longest common subsequences in subquadratic time ⋮ Counting Subgraphs in Relational Event Graphs ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Partial Enclosure Range Searching ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Data structures for categorical path counting queries ⋮ The fine-grained complexity of multi-dimensional ordering properties ⋮ Low space data structures for geometric range mode query ⋮ The Heaviest Induced Ancestors Problem Revisited

This page was built for publication: Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting