1458 search results - page 3 / 292 » An Improved Parallel Algorithm for Delaunay Triangulation on... |
PODC
1997
ACM
13 years 9 months ago
1997
ACM
PODC
1994
ACM
13 years 9 months ago
1994
ACM
VIS
2004
IEEE
14 years 6 months ago
2004
IEEE
We describe a general algorithm to produce compatible 3D triangulations from spatial decompositions. Such triangulations match edges and faces across spatial cell boundaries, solv...
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
Consider any known sequential algorithm for matrix multiplication over an arbitrary ring with time complexity O N , where 2 3. We show that such an algorithm can be parallelize...
IPPS
2002
IEEE
13 years 10 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...