scientific article; zbMATH DE number 3945382
[For the entire collection see Zbl 0575.00022.] Parallel algorithms are described for three problems that are often to be solved in computational geometry, namely selection, sorting and computing convex hulls. For a problem of size n, all three algorithms use \(n^{1- e}\) processors where \(0<e<1\) and depends on the number of available processors. The cost of each of the algorithms, i.e. the number of processors multiplied by the worst-case running time, matches an existing lower bound on the number of operations required in the worst case to solve the given problem and is therefore optimal to within a constant factor.
- Fast linear expected-time algorithms for computing maxima and convex hulls
- Lower bounds for parallel algebraic decision trees, parallel complexity of convex hulls and related problems
- scientific article; zbMATH DE number 4082988 (Why is no real title available?)
- Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
- A Parallel Multivariate Interpolation Algorithm With Radial Basis Functions
- Optimal, output-sensitive algorithms for constructing upper envelope of line segments in parallel
- scientific article; zbMATH DE number 761263 (Why is no real title available?)
- New parallel algorithms for convex hull and triangulation in 3-dimensional space
- Comments on two parallel algorithms for the planar convex hull problem
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3716334)