147 results
Search Results
Now showing 1 - 10 of 147
Item Interactive Modeling of Mechanical Objects(The Eurographics Association and John Wiley & Sons Ltd., 2016) Ureta, Francisca Gil; Tymms, Chelsea; Zorin, Denis; Maks Ovsjanikov and Daniele PanozzoObjects with various types of mechanical joints are among the most commonly built. Joints implement a vocabulary of simple constrained motions (kinematic pairs) that can be used to build more complex behaviors. Defining physically correct joint geometry is crucial both for realistic appearance of models during motion, as these are typically the only parts of geometry that stay in contact, and for fabrication. Direct design of joint geometry often requires more effort than the design of the rest of the object geometry, as it requires design of components that stay in precise contact, are aligned with other parts, and allow the desired range of motion. We present an interactive system for creating physically realizable joints with user-controlled appearance. Our system minimizes or, in most cases, completely eliminates the need for the user to manipulate low-level geometry of joints. This is achieved by automatically inferring a small number of plausible combinations of joint dimensions, placement and orientation from part geometry, with the user making the final high-level selection based on object semantic. Through user studies, we demonstrate that functional results with a satisfying appearance can be obtained quickly by users with minimal modeling experience, offering a significant improvement in the time required for joint construction, compared to standard modeling approaches.Item Geometry and Attribute Compression for Voxel Scenes(The Eurographics Association and John Wiley & Sons Ltd., 2016) Dado, Bas; Kol, Timothy R.; Bauszat, Pablo; Thiery, Jean-Marc; Eisemann, Elmar; Joaquim Jorge and Ming LinVoxel-based approaches are today's standard to encode volume data. Recently, directed acyclic graphs (DAGs) were successfully used for compressing sparse voxel scenes as well, but they are restricted to a single bit of (geometry) information per voxel. We present a method to compress arbitrary data, such as colors, normals, or reflectance information. By decoupling geometry and voxel data via a novel mapping scheme, we are able to apply the DAG principle to encode the topology, while using a palette-based compression for the voxel attributes, leading to a drastic memory reduction. Our method outperforms existing state-of-the-art techniques and is well-suited for GPU architectures. We achieve real-time performance on commodity hardware for colored scenes with up to 17 hierarchical levels (a 128K3 voxel resolution), which are stored fully in core.Item Aortic Dissection Maps: Comprehensive Visualization of Aortic Dissections for Risk Assessment(The Eurographics Association, 2016) Mistelbauer, Gabriel; Schmidt, Johanna; Sailer, Anna-Margaretha; Bäumler, Kathrin; Walters, Shannon; Fleischmann, Dominik; Stefan Bruckner and Bernhard Preim and Anna Vilanova and Helwig Hauser and Anja Hennemuth and Arvid LundervoldAortic dissection is a life threatening condition of the aorta, characterized by separation of its wall layers into a true and false lumen. A subset of patients require immediate surgical or endovascular repair. All survivors of the acute phase need long-term surveillance with imaging to monitor chronic degeneration and dilatation of the false lumen and prevent late adverse events such as rupture, or malperfusion. We introduce four novel plots displaying features of aortic dissections known or presumed to be associated with risk of future adverse events: Aortic diameter, the blood supply (outflow) to the aortic branches from the true and false lumen, the previous treatment, and an estimate of adverse event-free probabilities in one, two and 5 years. Aortic dissection maps, the composite visualization of these plots, provide a baseline for visual comparison of the complex features and associated risk of aortic dissection. These maps may lead to more individualized monitoring and improved, patient-centric treatment planning in the future.Item Selective Rasterized Ray-traced Reflections on the GPU(The Eurographics Association, 2016) Kastrati, Mattias Frid; Goswami, Prashant; Giovanni Pintore and Filippo StancoRay-tracing achieves impressive effects such as realistic reflections on complex surfaces but is also more computationally expensive than classic rasterization. Rasterized ray-tracing methods can accelerate ray-tracing by taking advantage of the massive parallelization available in the rasterization pipeline on the GPU. In this paper, we propose a selective rasterized raytracing method that optimizes the rasterized ray-tracing by selectively allocating computational resources to reflective regions in the image. Our experiments suggest that the method can speed-up the computation by up to 4 times and also reduce the memory footprint by almost 66% without affecting the image quality. We demonstrate the effectiveness of our method using complex scenes and animations.Item MCFTLE: Monte Carlo Rendering of Finite-Time Lyapunov Exponent Fields(The Eurographics Association and John Wiley & Sons Ltd., 2016) Günther, Tobias; Kuhn, Alexander; Theisel, Holger; Kwan-Liu Ma and Giuseppe Santucci and Jarke van WijkTraditionally, Lagrangian fields such as finite-time Lyapunov exponents (FTLE) are precomputed on a discrete grid and are ray casted afterwards. This, however, introduces both grid discretization errors and sampling errors during ray marching. In this work, we apply a progressive, view-dependent Monte Carlo-based approach for the visualization of such Lagrangian fields in time-dependent flows. Our approach avoids grid discretization and ray marching errors completely, is consistent, and has a low memory consumption. The system provides noisy previews that converge over time to an accurate high-quality visualization. Compared to traditional approaches, the proposed system avoids explicitly predefined fieldline seeding structures, and uses a Monte Carlo sampling strategy named Woodcock tracking to distribute samples along the view ray. An acceleration of this sampling strategy requires local upper bounds for the FTLE values, which we progressively acquire during the rendering. Our approach is tailored for high-quality visualizations of complex FTLE fields and is guaranteed to faithfully represent detailed ridge surface structures as indicators for Lagrangian coherent structures (LCS). We demonstrate the effectiveness of our approach by using a set of analytic test cases and real-world numerical simulations.Item 3D Model for Solar Energy Potential on Buildings from Urban LiDAR Data(The Eurographics Association, 2016) Bill, Andreas; Mohajeri, Nahid; Scartezzini, Jean-Louis; Vincent Tourre and Filip BiljeckiOne of the most promising sustainable energies that can be considered in urban environments is solar energy. A 3D model for solar energy potential on building envelopes based on urban LiDAR data was developed in this study. The developed algorithm can be used to model solar irradiation with high spatio-temporal resolution for roof-, facade-, and ground surfaces simultaneously, while taking into account the surrounding vegetation. Global solar irradiation is obtained for regularly spaced points on building- and ground surfaces with a spatial resolution of 1m2 and a time resolution of 1 hour. The algorithm has been implemented in Matlab and results were generated for two different test areas in the city of Geneva, Switzerland. The results for these specific areas show that, even in a dense urban area, the upper parts of south-east to south-west oriented facades receive 600 to 1000 kWh/m2/year of solar input, which is suitable for active solar installations. The results also show that south oriented facades can get higher solar input during winter months than the low inclined roof surfaces. This demonstrates that, depending on the latitude, facades can have a significant impact on the solar potential of buildings in urban areas, particularly for a sustainable energy planning application.Item Similarity Voting based Viewpoint Selection for Volumes(The Eurographics Association and John Wiley & Sons Ltd., 2016) Tao, Yubo; Wang, Qirui; Chen, Wei; Wu, Yingcai; Lin, Hai; Kwan-Liu Ma and Giuseppe Santucci and Jarke van WijkPrevious viewpoint selection methods in volume visualization are generally based on some deterministic measures of viewpoint quality. However, they may not express the familiarity and aesthetic sense of users for features of interest. In this paper, we propose an image-based viewpoint selection model to learn how visualization experts choose representative viewpoints for volumes with similar features. For a given volume, we first collect images with similar features, and these images reflect the viewpoint preferences of the experts when visualizing these features. Each collected image tallies votes to the viewpoints with the best matching based on an image similarity measure, which evaluates the spatial shape and appearance similarity between the collected image and the rendered image from the viewpoint. The optimal viewpoint is the one with the most votes from the collected images, that is, the viewpoint chosen by most visualization experts for similar features. We performed experiments on various volumes available in volume visualization, and made comparisons with traditional viewpoint selection methods. The results demonstrate that our model can select more canonical viewpoints, which are consistent with human perception.Item Visibility Equalizer Cutaway Visualization of Mesoscopic Biological Models(The Eurographics Association and John Wiley & Sons Ltd., 2016) Muzic, Mathieu Le; Mindek, Peter; Sorger, Johannes; Autin, Ludovic; Goodsell, David S.; Viola, Ivan; Kwan-Liu Ma and Giuseppe Santucci and Jarke van WijkIn scientific illustrations and visualization, cutaway views are often employed as an effective technique for occlusion management in densely packed scenes.We propose a novel method for authoring cutaway illustrations of mesoscopic biological models. In contrast to the existing cutaway algorithms, we take advantage of the specific nature of the biological models. These models consist of thousands of instances with a comparably smaller number of different types. Our method constitutes a two stage process. In the first step, clipping objects are placed in the scene, creating a cutaway visualization of the model. During this process, a hierarchical list of stacked bars inform the user about the instance visibility distribution of each individual molecular type in the scene. In the second step, the visibility of each molecular type is fine-tuned through these bars, which at this point act as interactive visibility equalizers. An evaluation of our technique with domain experts confirmed that our equalizer-based approach for visibility specification is valuable and effective for both, scientific and educational purposes.Item A Deferred Rendering Pipeline Including a Global Illumination Model for Atmospheric Scattering and Transparency(The Eurographics Association, 2016) Heppner, S.; Dransfeld, M.; Domik, G.; Oleg LobachevAbstract This poster presents suitable global illumination models for atmospheric scattering in outdoor scenes combined with a deferred rendering pipeline which offers the possibility of rendering transparent objects. The use case is a HIL simulation for camera based ADAS tests that require a realistic rendering of outdoor scenes.Item External Facelist Calculation with Data-Parallel Primitives(The Eurographics Association, 2016) Lessley, Brenton; Binyahib, Roba; Maynard, Robert; Childs, Hank; Enrico Gobbetti and Wes BethelExternal facelist calculation on three-dimensional unstructured meshes is used in scientific visualization libraries to efficiently render the results of operations such as clipping, interval volumes, and material boundaries. With this study, we consider the external facelist algorithm on many-core architectures. We design and introduce two novel approaches, one based on sorting and one based on hashing. Both of these algorithms consist entirely of data-parallel primitive operations, in an effort to achieve portable performance across different architectures. We study the performance of the algorithms via experiments varying over data set, hardware, and other factors. Overall, we observe that the hashing-based implementation achieves better runtime performance for the majority of configurations, while also achieving the most-stable performance on highly unstructured data sets.