FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING

DOI10.1142/S0129054104002686zbMath1067.68776OpenAlexW2004474036MaRDI QIDQ3022028

Qingmin Shi, Joseph F. Ja'Ja'

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054104002686

zbMATH Keywords

range countingrange reportingdominance queryRAM model

Mathematics Subject Classification ID

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

Related Items (4)

Point enclosure problem for homothetic polygons ⋮ Color-spanning localized query ⋮ Dominance made simple ⋮ On finding fundamental cut sets

Cites Work

• Fractional cascading. I: A data structuring technique
• Surpassing the information theoretic bound with fusion trees
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Algorithms for three-dimensional dominance searching in linear space.
• Fast Algorithms for Finding Nearest Common Ancestors
• Priority Search Trees
• Filtering Search: A New Approach to Query-Answering
• A unifying look at data structures
• Multidimensional binary search trees used for associative searching
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Examining Computational Geometry, Van Emde Boas Trees, and Hashing from the Perspective of the Fusion Tree

This page was built for publication: FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING