Results 1 
4 of
4
Inplace algorithms for computing (layers of) maxima
 In: Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT ’06
, 2006
"... Abstract. We describe spaceefficient 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. 1 ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Abstract. We describe spaceefficient 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. 1
Maximafinding algorithms for multidimensional samples: A twophase approach
"... Simple, twopahse algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are easily coded and modified for practical needs. The expected complexity of some measures related to the performance o ..."
Abstract
 Add to MetaCart
Simple, twopahse algorithms are devised for finding the maxima of multidimensional point samples, one of the very first problems studied in computational geometry. The algorithms are easily coded and modified for practical needs. The expected complexity of some measures related to the performance of the algorithms is analyzed. We also compare the efficiency of the algorithms with a few major ones used in practice, and apply our algorithms to find the maximal layers and the longest common subsequences of multiple sequences.
On the Rectilinear Convex Layers of a Planar Set
"... In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n 2 log n) time and O(n 2) space. 1 ..."
Abstract
 Add to MetaCart
In this paper we give an optimal O(n log n) time and O(n) space algorithm to compute the rectilinear convex layers of a set S of n points on the plane. We also compute the rotation of S that minimizes the number of rectilinear convex layers in O(n 2 log n) time and O(n 2) space. 1