Algorithms for three-dimensional dominance searching in linear space.

DOI10.1016/S0020-0190(98)00075-1MaRDI QIDQ2583568zbMATH OpenOpenAlexFDO

Authors 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 geometryDominance searchingPersistence

Mathematics Subject Classification ID

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

Recommendations

• Dynamic search in three-dimensional convex domains
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Alphabet-independent optimal parallel search for three-dimensional patterns
• Extending the Stansfield Algorithm to Three Dimensions: Algorithms and Implementations
• The Simplex Algorithm in Dimension Three
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• A Fast Algorithm for Three-Dimensional Layers of Maxima Problem
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting

Cites work

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

Cited in

(17)

• A new framework for addressing temporal range queries and some preliminary results
• Monte-Carlo valuation of American options: facts and new algorithms to improve existing methods
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• On Dominance Reporting in 3D
• Some Results for Elementary Operations
• An improved algorithm for static 3D dominance reporting in the pointer machine
• Cache-oblivious range reporting with optimal queries requires superlinear space
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Linear space data structures for two types of range search
• Point enclosure problem for homothetic polygons
• Dominance for enclosure problems
• Path and ancestor queries over trees with multidimensional weight vectors
• Dominance for enclosure problems
• Point enclosure problem for homothetic polygons
• Dominance made simple
• On finding fundamental cut sets
• A general approach for cache-oblivious range reporting and approximate range counting

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

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