A Fast Algorithm for Three-Dimensional Layers of Maxima Problem

From MaRDI portal



Abstract: We show that the three-dimensional layers-of-maxima problem can be solved in o(nlogn) time in the word RAM model. Our algorithm runs in O(n(loglogn)3) deterministic time or O(n(loglogn)2) expected time and uses O(n) space. We also describe an algorithm that uses optimal O(n) space and solves the three-dimensional layers-of-maxima problem in O(nlogn) time in the pointer machine model.











This page was built for publication: A Fast Algorithm for Three-Dimensional Layers of Maxima Problem

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