A lower bound to finding convex hulls
A lower bound to finding convex hulls
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A Bibliography on Digital and Computational Convexity (1961-1988)
IEEE Transactions on Pattern Analysis and Machine Intelligence
In-place techniques for parallel convex hull algorithms (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
New lower bounds for convex hull problems in odd dimensions
Proceedings of the twelfth annual symposium on Computational geometry
Convex Decomposition of Simple Polygons
ACM Transactions on Graphics (TOG)
Parallelizability of Some P-Complete Problems
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Randomized Complexity of Linear Arrangements and Polyhedra
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Distribution-sensitive algorithms
Nordic Journal of Computing
A 3D Convex Hull algorithm for modelling medical data in a virtual environment
International Journal of Intelligent Systems Technologies and Applications
A Quick 3D-to-2D Points Matching Based on the Perspective Projection
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing
The complexity of RP selection in multicast channelization
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
Beating the spread: time-optimal point meshing
Proceedings of the twenty-seventh annual symposium on Computational geometry
On the ultimate convex hull algorithm in practice
Pattern Recognition Letters
Hi-index | 0.00 |