Scalable Algorithms For Interactive Visualization Of Curved Surfaces

[[abstract]]We present e#cient 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 primitivevaries between successive frames and we address issues in distributing the load across processors for di#erentenvironments. This includes algorithms to statically distribute the primitives to reduce dynamic load imbalance as well a distributed wait-free algorithm for machines on which re-distribution is e#cient, e.g. shared memory machine. These algorithms have been implemented on di#erent 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 by25,30# as compared to static and dynamic schemes.[[fileno]]2030237030023[[department]]資訊工程學