On Dominance Reporting in 3D

DOI10.1007/978-3-540-87744-8_4zbMath1158.68363OpenAlexW1600658344MaRDI QIDQ3541072

Peyman Afshani

Publication date: 25 November 2008

Published in: Algorithms - ESA 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87744-8_4

Mathematics Subject Classification ID

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

Related Items

Space Efficient Multi-dimensional Range Reporting, I/O-optimal categorical 3-sided skyline queries, Ranked Document Retrieval in External Memory, An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³, Unnamed Item, Optimal deterministic shallow cuttings for 3-d dominance ranges, Cache-oblivious range reporting with optimal queries requires superlinear space, Unnamed Item, A general approach for cache-oblivious range reporting and approximate range counting, Range-Aggregate Queries Involving Geometric Aggregation Operations, Some Results for Elementary Operations, Indexes for Document Retrieval with Relevance, Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear space data structures for two types of range search
• On the equivalence of some rectangle problems
• Reporting points in halfspaces
• Efficient searching with linear constraints
• Algorithms for three-dimensional dominance searching in linear space.
• On approximate halfspace range counting and relative epsilon-approximations
• A data structure for multi-dimensional range reporting
• Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Vertical Decomposition of Shallow Levels in 3-Dimensional Arrangements and Its Applications
• I/O-Efficient Point Location in a Set of Rectangles
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting