In-Place Algorithms for Computing (Layers of) Maxima

We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and occupy only constant extra space in addition to the space needed for representing the input.

• Type: Journal
• Year: 2010
• Where: ALGORITHMICA
• Authors: Henrik Blunck, Jan Vahrenhold
• Keywords: ALGORITHMICA 2010, Constant Extra Space, Problems, Space-efficient Algorithms