Abstract
Rendering scenes with overlapping transparent faces is challenging for several reasons, including sorting geometry, managing multiple per-pixel fragments, and compositing. These questions have been solved for local rendering previously, for example by order-independent transparency approaches like Depth Peeling or A-buffer implementations. We discuss order-independent transparency algorithms in context of distributed rendering for large data sets or simulations which by design split the work load among a number of computation nodes. Furthermore, we evaluate a per-pixel linked list approach for distributed mesh rendering and multi-variant analysis of molecule data sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
