In-Place Planar Convex Hull Algorithms
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Space-efficient planar convex hull algorithms
Theoretical Computer Science - Latin American theorotical informatics
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time
Computational Geometry: Theory and Applications
Hi-index | 0.01 |