An improved algorithm for static 3D dominance reporting in the pointer machine

DOI10.1007/978-3-642-35261-4_59MaRDI QIDQ4909573zbMATHOpenAlexFDO

Authors Christos Makris, Konstantinos Tsakalidis

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_59

zbMATH Keywords

computational geometrypointer machinepersistent data structuresdominance reporting

Mathematics Subject Classification ID

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

Recommendations

• On Dominance Reporting in 3D
• Algorithms for three-dimensional dominance searching in linear space.
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Dominance made simple

Cited in

(5)

• An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ³
• Simplex range reporting on a pointer machine
• FAST ALGORITHMS FOR 3-D DOMINANCE REPORTING AND COUNTING
• On Dominance Reporting in 3D
• Optimal deterministic shallow cuttings for 3-d dominance ranges

This page was built for publication: An improved algorithm for static 3D dominance reporting in the pointer machine

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