719 results
Search Results
Now showing 1 - 10 of 719
Item Statistical Analysis of Parallel Data Uploading using OpenGL(The Eurographics Association, 2019) Wiedemann, Markus; Kranzlmüller, Dieter; Childs, Hank and Frey, SteffenModern real-time visualizations of large-scale datasets require constant high frame rates while their datasets might exceed the available graphics memory. This requires sophisticated upload strategies from host memory to the memory of the graphics cards. A possible solution uses outsourcing of all data uploads onto concurrent threads and disconnecting prohibitive data dependencies. OpenGL provides a variety of functions and parameters but not all allow minimal interference on rendering. In this work, we present a thorough and statistically sound analysis of various effects introduced by choosing different input parameters, such as size, partitioning and number of threads for uploading, as well as combinations of buffer usage hints and uploading functions. This approach provides insight into the problem and offers a basis for future optimizations.Item Discrete Calabi Flow: A Unified Conformal Parameterization Method(The Eurographics Association and John Wiley & Sons Ltd., 2019) Su, Kehua; Li, Chenchen; Zhou, Yuming; Xu, Xu; Gu, Xianfeng; Lee, Jehee and Theobalt, Christian and Wetzstein, GordonConformal parameterization for surfaces into various parameter domains is a fundamental task in computer graphics. Prior research on discrete Ricci flow provided us with promising inspirations from methods derived via Riemannian geometry, which is rigorous in theory and effective in practice. In this paper, we propose a unified conformal parameterization approach for turning triangle meshes into planar and spherical domains using discrete Calabi flow on piecewise linear metric. We incorporate edgeflipping surgery to guarantee convergence as well as other significant improvements including approximate Newton's method, optimal step-lengths, priority embedding and boundary customizing, which achieve better performance and functionality with robustness and accuracy.Item Analytic Spectral Integration of Birefringence-Induced Iridescence(The Eurographics Association and John Wiley & Sons Ltd., 2019) Steinberg, Shlomi; Boubekeur, Tamy and Sen, PradeepOptical phenomena that are only observable in optically anisotropic materials are generally ignored in the computer graphics. However, such optical effects are not restricted to exotic materials and can also be observed with common translucent objects when optical anisotropy is induced, e.g. via mechanical stress. Furthermore accurate prediction and reproduction of those optical effects has important practical applications. We provide a short but complete analysis of the relevant electromagnetic theory of light propagation in optically anisotropic media and derive the full set of formulations required to render birefringent materials. We then present a novel method for spectral integration of refraction and reflection in an anisotropic slab. Our approach allows fast and robust rendering of birefringence-induced iridescence in a physically faithful manner and is applicable to both real-time and offline rendering.Item A Massively Parallel CUDA Algorithm to Compute and Visualize the Solvent Excluded Surface for Dynamic Molecular Data(The Eurographics Association, 2019) Schäfer, Marco; Krone, Michael; Byska, Jan and Krone, Michael and Sommer, BjörnThe interactive visualization of molecular surfaces can help users to understand the dynamic behavior of proteins in molecular dynamics simulations. These simulations play an important role in biochemical and pharmaceutical research, e.g. in drug design. The efficient calculation of molecular surfaces in a fast and memory-saving way is a challenging task. For example, to gain a detailed understanding of complex diseases like Alzheimer, conformational changes and spatial interactions between molecules have to be investigated. Molecular surfaces, such as Solvent Excluded Surfaces (SES), are instrumental for identifying structures such as tunnels or cavities that critically influence transport processes and docking events, which might induce enzymatic reactions. Therefore, we developed a highly parallelized algorithm that exploits the massive computing power of modern graphics hardware. Our analytical algorithm is suitable for the real-time computation of dynamic SES based on many time steps, as it runs interactively on a single consumer GPU for more than 20 k atoms.Item Towards Biomechanically and Visually Plausible Volumetric Cutting Simulation of Deformable Bodies(The Eurographics Association, 2019) Qian, Yinling; Huang, Wenbin; Si, Weixin; Liao, Xiangyun; Wang, Qiong; Heng, Pheng-Ann; Lee, Jehee and Theobalt, Christian and Wetzstein, GordonDue to the simplicity and high efficiency, composited finite element method(CFEM) based virtual cutting attracted much attention in the field of virtual surgery in recent years. Even great progress has been made in volumetric cutting of deformable bodies, there are still several open problems restricting its applications in practical surgical simulator. First among them is cutting fracture modelling. Recent methods would produce cutting surface immediately after an intersection between the cutting plane and the object. But in real cutting, biological tissue would first deform under the external force induced by scalpel and then fracture occurs when the stress exceeds a threshold. Secondly, it's computation-intensive to reconstruct cutting surface highly consistent with the scalpel trajectory, since reconstructed cutting surface in CFEM-based virtual cutting simulation is grid-dependent and the accuracy of cutting surface is proportional to the grid resolution. This paper propose a virtual cutting method based on CFEM which can effectively simulate cutting fracture in a biomechanically and visually plausible way and generate cutting surface which is consistent with the scalpel trajectory with a low resolution finite element grid. We model this realistic cutting as a deformation-fracture repeating process. In deformation stage, the object will deform along with the scalpel motion, while in the fracture stage cutting happens and a cutting surface will be generated from the scalpel trajectory. A delayed fracturing criteria is proposed to determine when and how the cutting fracture occurs and an influence domain adaptation method is employed to generate accurate cutting surface in both procedures of deformation and fracture. Experiments show that our method can realistically simulate volumetric cutting of deformable bodies and efficiently generate accurate cutting surface thus facilitating interactive applications.Item A Preliminary Analysis of Methods for Curvature Estimation on Surfaces With Local Reliefs(The Eurographics Association, 2019) Moscoso Thompson, Elia; Biasotti, Silvia; Cignoni, Paolo and Miguel, EderCurvature estimation is very popular in geometry processing for the analysis of local surface variations. Despite the large number of methods, no quantitative nor qualitative studies have been conducted for a comparative analysis of the different algorithms on surfaces with small geometric variations, such as chiselled or relief surfaces. In this work we compare eight curvature estimation methods that are commonly adopted by the computer graphics community on a number of triangle meshes derived from scans of surfaces with local reliefs.Item A PatchMatch-based Approach for Matte Propagation in Videos(The Eurographics Association and John Wiley & Sons Ltd., 2019) Backes, Marcos; Menezes de Oliveira Neto, Manuel; Lee, Jehee and Theobalt, Christian and Wetzstein, GordonDespite considerable advances in natural image matting over the last decades, video matting still remains a difficult problem. The main challenges faced by existing methods are the large amount of user input required, and temporal inconsistencies in mattes between pairs of adjacent frames. We present a temporally-coherent matte-propagation method for videos based on PatchMatch and edge-aware filtering. Given an input video and trimaps for a few frames, including the first and last, our approach generates alpha mattes for all frames of the video sequence. We also present a user scribble-based interface for video matting that takes advantage of the efficiency of our method to interactively refine the matte results. We demonstrate the effectiveness of our approach by using it to generate temporally-coherent mattes for several natural video sequences. We perform quantitative comparisons against the state-of-the-art sparse-input video matting techniques and show that our method produces significantly better results according to three different metrics. We also perform qualitative comparisons against the state-of-the-art dense-input video matting techniques and show that our approach produces similar quality results while requiring only about 7% of the amount of user input required by such techniques. These results show that our method is both effective and user-friendly, outperforming state-of-the-art solutions.Item Robust Structure‐Based Shape Correspondence(© 2019 The Eurographics Association and John Wiley & Sons Ltd., 2019) Kleiman, Yanir; Ovsjanikov, Maks; Chen, Min and Benes, BedrichWe present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds. We demonstrate that the region‐wise matching that we obtain can be used to find correspondences between feature points, reveal the intrinsic self‐similarities of each shape and even construct point‐to‐point maps across shapes. Our method is both time and space efficient, leading to a pipeline that is significantly faster than comparable approaches. We demonstrate the performance of our approach through an extensive quantitative and qualitative evaluation on several benchmarks where we achieve comparable or superior performance to existing methods.We present a robust method to find region‐level correspondences between shapes, which are invariant to changes in geometry and applicable across multiple shape representations. We generate simplified shape graphs by jointly decomposing the shapes, and devise an adapted graph‐matching technique, from which we infer correspondences between shape regions. The simplified shape graphs are designed to primarily capture the overall structure of the shapes, without reflecting precise information about the geometry of each region, which enables us to find correspondences between shapes that might have significant geometric differences. Moreover, due to the special care we take to ensure the robustness of each part of our pipeline, our method can find correspondences between shapes with different representations, such as triangular meshes and point clouds.Item Procedural Riverscapes(The Eurographics Association and John Wiley & Sons Ltd., 2019) Peytavie, Adrien; Dupont, Thibault; Guérin, Eric; Cortial, Yann; Benes, Bedrich; Gain, James; Galin, Eric; Lee, Jehee and Theobalt, Christian and Wetzstein, GordonThis paper addresses the problem of creating animated riverscapes through a novel procedural framework that generates the inscribing geometry of a river network and then synthesizes matching real-time water movement animation. Our approach takes bare-earth heightfields as input, derives hydrologically-inspired river network trajectories, carves riverbeds into the terrain, and then automatically generates a corresponding blend-flow tree for the water surface. Characteristics, such as the riverbed width, depth and shape, as well as elevation and flow of the fluid surface, are procedurally derived from the terrain and river type. The riverbed is inscribed by combining compactly supported elevation modifiers over the river course. Subsequently, the water surface is defined as a time-varying continuous function encoded as a blend-flow tree with leaves that are parameterized procedural flow primitives and internal nodes that are blend operators. While river generation is fully automated, we also incorporate intuitive interactive editing of both river trajectories and individual riverbed and flow primitives. The resulting framework enables the generation of a wide range of river forms, ranging from slow meandering rivers to rapids with churning water, including surface effects, such as foam and leaves carried downstream.Item mpLBP: An Extension of the Local Binary Pattern to Surfaces based on an Efficient Coding of the Point Neighbours(The Eurographics Association, 2019) Moscoso Thompson, Elia; Biasotti, Silvia; Digne, Julie; Chaine, Raphaëlle; Biasotti, Silvia and Lavoué, Guillaume and Veltkamp, RemcoThe description of surface textures in terms of repeated colorimetric and geometric local surface variations is a crucial task for several applications, such as object interpretation or style identification. Recently, methods based on extensions to the surface meshes of the Local Binary Pattern (LBP) or the Scale-Invariant Feature Transform (SIFT) descriptors have been proposed for geometric and colorimetric pattern retrieval and classification. With respect to the previous works, we consider a novel LBPbased descriptor based on the assignment of the point neighbours into sectors of equal area and a non-uniform, multiple ring sampling. Our method is able to deal with surfaces represented as point clouds. Experiments on different benchmarks confirm the competitiveness of the method within the existing literature, in terms of accuracy and computational complexity.