We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal (nlogn) time and occupy only constant extra space in addition to the space needed for representing the input.
Algorithm Theory – Swat 2006: 10th Scandinavian Workshop on Algorithm Theory, Riga, Latvia, July 6-8, 2006. Proceedings, 2006, p. 363-374
Main Research Area:
Lecture Notes in Computer Science
10th Scandinavian Workshop on Algorithm Theory. SWAT 2006