Treffer: Parallel Implementation of Polypoint Transformations with Adjacent Triangle Plane Intersections.

Modern geometric deformation methods, such as polypoint transformations, are widely used in computer graphics, modeling, and engineering simulations. The obvious solution for lifting the performance limitations would be using parallel or distributed computations. Polypoint transformations are not inherently sequential or otherwise limited in parallelization, however, the potential benefits of parallel computation in the context of polypoint transforamtion have not yet been studied. This work studies the prospects of parallel computation of the polypoint transformations based on intersecting planes. The study focuses on analyzing the efficiency of parallel computations for transforming large 3D models. We investigate the relationship between execution time and thread count, deriving two approximation models (rational and hyperbolic) that closely fit experimental data. A comparison with Amdahlʼs Law reveals that 90 % of the algorithm can be parallelized, achieving a speedup of up to 7,5× using 24 threads. [ABSTRACT FROM AUTHOR]

Copyright of Èlektronnoe Modelirovanie is the property of Pukhov Institute for Modeling in Energy Engineering National Academy of Sciences of Ukraine and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)