EGPGV13: Eurographics Symposium on Parallel Graphics and Visualization
Permanent URI for this collection
Browse
Browsing EGPGV13: Eurographics Symposium on Parallel Graphics and Visualization by Subject "I.3.3 [Computer Graphics]"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Rendering Molecular Surfaces using Order-Independent Transparency(The Eurographics Association, 2013) Kauker, Daniel; Krone, Michael; Panagiotidis, Alexandros; Reina, Guido; Ertl, Thomas; Fabio Marton and Kenneth MorelandIn this paper we present a technique for interactively rendering transparent molecular surfaces. We use Puxels, our implementation of per-pixel linked lists for order-independent transparency rendering. Furthermore, we evaluate the usage of per-pixel arrays as an alternative for this rendering technique. We describe our real-time rendering technique for transparent depiction of complex molecular surfaces like the Solvent Excluded Surface which is based on constructive solid geometry. Additionally, we explain further graphical operations and extensions possible with the Puxels approach. The evaluation benchmarks the performance of the presented methods and compares it to other methods.Item Scalable Seams for Gigapixel Panoramas(The Eurographics Association, 2013) Philip, Sujin; Summa, Brian; Tierny, Julien; Bremer, Peer-Timo; Pascucci, Valerio; Fabio Marton and Kenneth MorelandGigapixel panoramas are an increasingly popular digital image application. They are often created as a mosaic of smaller images composited into a larger single image. The mosaic acquisition can occur over many hours causing the individual images to differ in exposure and lighting conditions. Therefore, to give the appearance of a single seamless image a blending operation is necessary. The quality of this blending depends on the magnitude of discontinuity along the boundaries between the images. Often image boundaries, or seams, are first computed to minimize this transition. Current techniques based on the multi-labeling Graph Cuts method are too slow and memory intensive for panoramas many gigapixels in size. In this paper we present a multithreaded out-of-core seam computing technique that is fast, has a small memory footprint, and gives near perfect scaling up to the number of physical cores of our test system. With this method the time required to compute image boundaries for gigapixel imagery improves from many hours (or even days) to just a few minutes on commodity hardware while still producing boundaries with energy that is on-par, if not better, than Graph Cuts.