TY - GEN
T1 - Scalable parallel algorithms for interactive visualization of curved surfaces
AU - Kumar, Subodh
AU - Chang, Chun Fa
AU - Manocha, Dinesh
N1 - Publisher Copyright:
© 1996 IEEE.
PY - 1996
Y1 - 1996
N2 - We present efficient parallel algorithms for interactive display of higher order surfaces on current graphics systems. At each frame, these algorithms approximate the surface by polygons and rasterize them over the graphics pipeline. The time for polygon generation for each surface primitive varies between successive frames and we address issues in distributing the load across processors for different environments. This includes algorithms to statically distribute the primitives to reduce dynamic load im balance as well a distributed wait-free algorithm for machines on which re-distribution is efficient, e.g. shared memory machine. These algorithms have been implemented on different graphics systems and applied to interactive display of trimmed spline models. In practice, we are able to obtain almost linear speed-ups (as a function of number of processors). Moreover, the distributed wait-free algorithm is faster by 25 — 30% as compared to static and dynamic schemes.
AB - We present efficient parallel algorithms for interactive display of higher order surfaces on current graphics systems. At each frame, these algorithms approximate the surface by polygons and rasterize them over the graphics pipeline. The time for polygon generation for each surface primitive varies between successive frames and we address issues in distributing the load across processors for different environments. This includes algorithms to statically distribute the primitives to reduce dynamic load im balance as well a distributed wait-free algorithm for machines on which re-distribution is efficient, e.g. shared memory machine. These algorithms have been implemented on different graphics systems and applied to interactive display of trimmed spline models. In practice, we are able to obtain almost linear speed-ups (as a function of number of processors). Moreover, the distributed wait-free algorithm is faster by 25 — 30% as compared to static and dynamic schemes.
KW - Load balancing
KW - Real-time rendering
KW - Simulation-based Design
KW - Splines
KW - Surface tessellation
UR - http://www.scopus.com/inward/record.url?scp=85117313959&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85117313959&partnerID=8YFLogxK
U2 - 10.1109/SUPERC.1996.183515
DO - 10.1109/SUPERC.1996.183515
M3 - Conference contribution
AN - SCOPUS:85117313959
T3 - Proceedings of the International Conference on Supercomputing
BT - Proceedings of the 1996 ACM/IEEE Conference on Supercomputing, SC 1996
PB - Association for Computing Machinery
T2 - 1996 ACM/IEEE Conference on Supercomputing, SC 1996
Y2 - 17 November 1996 through 22 November 1996
ER -