Constructing higher-dimensional convex hulls at logarithmic cost per face
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A divide-and-conquer algorithm for computing 4-dimensional convex hulls
Proceedings on International Workshop on Computational Geometry on Computational Geometry and its Applications
Epsilon geometry: building robust algorithms from imprecise computations
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Discrete Applied Mathematics
An Algorithm for Convex Polytopes
Journal of the ACM (JACM)
A New Convex Hull Algorithm for Planar Sets
ACM Transactions on Mathematical Software (TOMS)
Convex hulls of finite sets of points in two and three dimensions
Communications of the ACM
Topologically Consistent Algorithms Realted to Convex Polyhedra
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Stable maintenance of point set triangulations in two dimensions
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Robust Geometric Computation Based on Topological Consistency
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Topology-Oriented Approach to Robust Geometric Computation
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Salient region detection using weighted feature maps based on the human visual attention model
PCM'04 Proceedings of the 5th Pacific Rim Conference on Advances in Multimedia Information Processing - Volume Part II
| Hi-index | 0.00 |
We present a simple new construction of a pseudorandom bit generator. It stretches a short string of truly random bits into a long string that looks random to any algorithm from a complexity class C (e.g., P, NC, PSPACE, ...) using an arbitrary function ...