Algorithms for three-dimensional dominance searching in linear space.

DOI10.1016/S0020-0190(98)00075-1zbMath1078.68805OpenAlexW2070104759MaRDI QIDQ2583568

Athanasios K. Tsakalidis, Christos Makris

Publication date: 17 January 2006

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00075-1

zbMATH Keywords

Computational geometryPersistenceDominance searching

Mathematics Subject Classification ID

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

Related Items (10)

Monte-Carlo Valuation of American Options: Facts and New Algorithms to Improve Existing Methods ⋮ Point enclosure problem for homothetic polygons ⋮ On Dominance Reporting in 3D ⋮ FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING ⋮ Cache-oblivious range reporting with optimal queries requires superlinear space ⋮ A new framework for addressing temporal range queries and some preliminary results ⋮ Dominance made simple ⋮ On finding fundamental cut sets ⋮ A general approach for cache-oblivious range reporting and approximate range counting ⋮ Some Results for Elementary Operations

Cites Work

• Linear space data structures for two types of range search
• Bounded ordered dictionaries in O(log log N) time and O(n) space
• Fractional cascading. II: Applications
• A log log n data structure for three-sided range queries
• Making data structures persistent
• On the equivalence of some rectangle problems
• Log-logarithmic worst-case range queries are possible in space theta(N)
• Filtering Search: A New Approach to Query-Answering
• Two-Dimensional and Three-Dimensional Point Location in Rectangular Subdivisions

This page was built for publication: Algorithms for three-dimensional dominance searching in linear space.