A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

Author： Dehne F. Deng X. Dymond P. Fabri A. Khokhar A. A.

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.30, Iss.6, 1997-12, pp. : 547-558

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

MAXIMAL ANNULI WITH PARALLEL PLANAR BOUNDARIES IN THE THREE-DIMENSIONAL LORENTZ–MINKOWSKI SPACE

Bulletin of the Australian Mathematical Society, Vol. 81, Iss. 2, 2010-04 ,pp. : 208-222

Cambridge University Press

Access to resources Recommend Favorite

A Memory-Saving Algorithm for Spectral Method of Three-Dimensional Homogeneous Isotropic Turbulence

Communications in Computational Physics, Vol. 9, Iss. 5, 2011-05 ,pp. : 1152-1164

Cambridge University Press

Access to resources Recommend Favorite

The Integer Hull of a Convex Rational Polytope

By Lasserre Jean B.

Discrete & Computational Geometry, Vol. 32, Iss. 1, 2004-05 ,pp. : 129-139

Springer Publishing Company

Access to resources Recommend Favorite

An Optimal-Time Algorithm for Shortest Paths on a Convex Polytope in Three Dimensions

By Schreiber Yevgeny Sharir Micha

Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. : 500-579

Springer Publishing Company

Access to resources Recommend Favorite

A Parallel Computational Model for Three-Dimensional, Thermo-Mechanical Stokes Flow Simulations of Glaciers and Ice Sheets

Communications in Computational Physics, Vol. 16, Iss. 4, 2014-10 ,pp. : 1056-1080

Cambridge University Press

Access to resources Recommend Favorite