Two Inherently Parallel Problems in Computational Geometry

S.G. Akl (Canada)


Parallel computation, superlinear speedup, computational geometry, geometric transformation, triangulation, convex decomposition.


A new computational paradigm is described which offers the possibility of superlinear (and sometimes unbounded) speedup, when parallel computation is used. The computa tions involved are subject only to given mathematical con straints and hence do not depend on external circumstances to achieve superlinear performance.

Important Links:

Go Back