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

DOI10.1007/978-3-540-30551-4_49zbMath1116.68629MaRDI 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

68W05: Nonnumerical algorithms

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

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