Sciweavers

JPDC
2010
109views more  JPDC 2010»
13 years 6 months ago
An efficient parallel algorithm for building the separating tree
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CR...
Yijie Han, Sanjeev Saxena, Xiaojun Shen
IPPS
1998
IEEE
14 years 3 months ago
An Improved Output-Size Sensitive Parallel Algorithm for Hidden-Surface Removal for Terrains
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in Olog4 n steps on the CREW PRAM model with a work bound of On + kpolyl...
Neelima Gupta, Sandeep Sen