FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING

DOI10.1142/S0129054104002686MaRDI QIDQ3022028zbMATH OpenOpenAlexFDO

Authors Qingmin Shi, Joseph 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

dominance queryRAM modelrange countingrange reporting

Mathematics Subject Classification ID

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

Recommendations

• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• On Dominance Reporting in 3D
• Algorithms for three-dimensional dominance searching in linear space.
• An improved algorithm for static 3D dominance reporting in the pointer machine
• Dominance made simple

Cites work

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

Cited in

(11)

• Color-spanning localized query
• Algorithms for three-dimensional dominance searching in linear space.
• On Dominance Reporting in 3D
• An improved algorithm for static 3D dominance reporting in the pointer machine
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Point enclosure problem for homothetic polygons
• Dominance for enclosure problems
• Dominance for enclosure problems
• Point enclosure problem for homothetic polygons
• Dominance made simple
• On finding fundamental cut sets

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

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