Information Processing Letters
The ultimate planar convex hull algorithm
SIAM Journal on Computing
An O(n log2h) time algorithm for the three-dimensional convex hull problem
SIAM Journal on Computing
An optimal convex hull algorithm and new results on cuttings (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
A Combinatorial Bound for Linear Programming and Related Problems
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
Efficient block-based parameterized timing analysis covering all potentially critical paths
Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design
Maxima-finding algorithms for multidimensional samples: A two-phase approach
Computational Geometry: Theory and Applications
Competing output-sensitive frame algorithms
Computational Geometry: Theory and Applications
Point sets and frame algorithms in management
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
| Hi-index | 0.00 |
We consider the problem of enumerating all extreme points of a given set P of n points in d dimensions. We present a simple and practical algorithm which uses O(n) space and O(nm) time, where m is the number of extreme points of P. Our algorithm is designed to work even for highly degenerate input.We also present an algorithm to compute the depth of each point of the given set of n points in d-dimensions. This algorithm has time complexity O(n2) which significantly improves the O(n3) complexity of the naive algorithm.