Efficient Parallel Implementations for Surface Subdivision

dc.contributor.authorPadrón, E. J.en_US
dc.contributor.authorAmor, M.en_US
dc.contributor.authorBóo, M.en_US
dc.contributor.authorDoallo, R.en_US
dc.contributor.editorD. Bartz and X. Pueyo and E. Reinharden_US
dc.date.accessioned2014-01-26T16:21:12Z
dc.date.available2014-01-26T16:21:12Z
dc.date.issued2002en_US
dc.description.abstractAchieving an efficient surface subdivision is an important issue today in computer graphics, geometric modeling, and scientific visualization. In this paper we present two parallel versions of the Modified Butterfly algorithm. Both versions are based on a coarse-grain approach, that is, the original mesh is subdivided into small groups and each processor performs the triangles subdivision for a set of groups of the mesh. First approach sorts the groups in decreasing order of number of triangles per group, and then the sorted groups are cyclically distributed on the processors in order to achieve a good load distribution. In the second parallel version the processors can dynamically balance the work load by passing groups from heavier loaded processors to lighter ones, achieving in that way a better load balance. Finally, we evaluate the algorithms on two different systems: a SGI Origin 2000 and a Sun cluster. Good performances in terms of speedup have been obtained using both static and dynamic parallel implementations.en_US
dc.description.seriesinformationEurographics Workshop on Parallel Graphics and Visualizationen_US
dc.identifier.isbn1-58113-579-3en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttps://doi.org/10.2312/EGPGV/EGPGV02/113-122en_US
dc.publisherThe Eurographics Associationen_US
dc.titleEfficient Parallel Implementations for Surface Subdivisionen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
113-122.pdf
Size:
2.91 MB
Format:
Adobe Portable Document Format