A Fast Algorithm for Three-Dimensional Layers of Maxima Problem

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

We show that the three-dimensional layers-of-maxima problem can be solved in $o(n\log n)$ time in the word RAM model. Our algorithm runs in $O(n(\log \log n)^3)$ deterministic time or $O(n(\log\log n)^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(n\log n)$ time in the pointer machine model.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

A Fast Algorithm for Three-Dimensional Layers of Maxima Problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Fast Algorithm for Three-Dimensional Layers of Maxima Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Fast Algorithm for Three-Dimensional Layers of Maxima Problem will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-645309

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.