59 results
Search Results
Now showing 1 - 10 of 59
Item A Multifragment Renderer for Material Aging Visualization(The Eurographics Association, 2018) Adamopoulos, Georgios; Moutafidou, Anastasia; Drosou, Anastasios; Tzovaras, Dimitrios; Fudos, Ioannis; Jain, Eakta and Kosinka, JiríPeople involved in curatorial work and in preservation/conservation tasks need to understand exactly the nature of aging and to prevent it with minimal preservation work. In this scenario, it is of extreme importance to have tools to produce and visualize digital representations and models of visual surface appearance and material properties, to help the scientist understand how they evolve over time and under particular environmental conditions. We report on the development of a multifragment renderer for visualizing and combining the results of simulated aging of artwork objects. Several natural aging processes manifest themselves through change of color, fading, deformations or cracks. Furthermore, changes in the materials underneath the visible layers may be detected or simulated.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 Smooth Blended Subdivision Shading(The Eurographics Association, 2018) Bakker, Jelle; Barendrecht, Pieter J.; Kosinka, Jiri; Diamanti, Olga and Vaxman, AmirThe concept known as subdivision shading aims at improving the shading of subdivision surfaces. It is based on the subdivision of normal vectors associated with the control net of the surface. By either using the resulting subdivided normal field directly, or blending it with the normal field of the limit surface, renderings of higher visual smoothness can be obtained. In this work we propose a different and more versatile approach to blend the two normal fields, yielding not only better results, but also a proof that our blended normal field is C1.Item Flexible Type: Methods and Applications of Modifying Glyph's Horizontal and Vertical Weight(The Eurographics Association, 2019) Kumawat, Nirmal; dhanuka, praveen kumar; Fusiello, Andrea and Bimber, OliverGraphic designers create logos or artworks by using various tools such as Adobe Illustrator, InDesign etc. Many times, designers face a major problem where they want to change the visual appearance of the text to fit the design in the current context or to make the design look better, but text editing options provided today are very limiting to the user's creativity. The designers get around this by converting text to outlines and then modifying each glyph like a separate graphic. This leads to text no longer being live (essentially unlinked) and the edits for each glyph can be time consuming. The poster presents methods for modifying glyph's horizontal and vertical weight. Later, the poster aims to provide the application of such modification to generate multiple styles by modifying glyph's overall Weight, Width, CapHeight, xHeight, height of Ascender and Descender etc.Item GPU Smoke Simulation on Compressed DCT Space(The Eurographics Association, 2019) Ishida, Daichi; Ando, Ryoichi; Morishima, Shigeo; Cignoni, Paolo and Miguel, EderThis paper presents a novel GPU-based algorithm for smoke animation. Our primary contribution is the use of Discrete Cosine Transform (DCT) compressed space for efficient simulation. We show that our method runs an order of magnitude faster than a CPU implementation while retaining visual details with a smaller memory usage. The key component of our method is an on-the-fly compression and expansion of velocity, pressure and density fields. Whenever these physical quantities are requested during a simulation, we perform data expansion and compression only where necessary in a loop. As a consequence, our simulation allows us to simulate a large domain without actually allocating full memory space for it. We show that albeit our method comes with some extra cost for DCT manipulations, such cost can be minimized with the aid of a devised shared memory usage.Item Rigid Body Joints in Real-Time Unified Particle Physics(The Eurographics Association, 2018) Lovrovic, Bojan; Mihajlovic, Zeljka; Diamanti, Olga and Vaxman, AmirIn this paper, we propose a physically-based method for a rigid body joint simulation. The proposed solution is based on the unified particle physics engine, a simulator that uses only particles for all the dynamic bodies. Such engines are implemented on the GPU and they simulate fluids, rigid bodies or deform-able materials like cloth or ropes. To support more complex systems like skeletal simulation, we show a joint implementation that is intuitive and unique to this environment. Four types of joints will be shown, as well as the necessary details about the rigid body data structure. This will enable the construction of a popular method called ragdoll. Lastly, a performance measurement and a comparison with alternatives will be given.Item Voxel DAGs and Multiresolution Hierarchies: From Large-Scale Scenes to Pre-computed Shadows(The Eurographics Association, 2018) Assarsson, Ulf; Billeter, Markus; Dolonius, Dan; Eisemann, Elmar; Jaspe, Alberto; Scandolo, Leonardo; Sintorn, Erik; Ritschel, Tobias and Telea, AlexandruIn this tutorial, we discuss voxel DAGs and multiresolution hierarchies, which are representations that can encode large volumes of data very efficiently. Despite a significant compression ration, an advantage of these structures is that their content can be efficiently accessed in real-time. This property enables various applications. We begin the tutorial by introducing the concepts of sparsity and of coherency in voxel structures, and explain how a directed acyclic graph (DAG) can be used to represent voxel geometry in a form that exploits both aspects, while remaining usable in its compressed from for e.g. ray casting. In this context, we also discuss extensions that cover the time domain or consider an advanced encoding strategies exploiting symmetries and entropy. We then move on to voxel attributes, such as colors, and explain how to integrate such information with the voxel DAGs. We will provide implementation details and present methods for efficiently constructing the DAGs and also cover how to efficiently access the data structures with e.g. GPU-based ray tracers. The course will be rounded of with a segment on applications. We highlight a few examples and show their results. Pre-computed shadows are a special application, which will be covered in detail. In this context, we also explain how some of previous ideas contribute to multi-resolution hierarchies, which gives an outlook on the potential generality of the presented solutions.Item Anisotropic Filtering for On-the-fly Patch-based Texturing(The Eurographics Association, 2019) Lutz, Nicolas; Sauvage, Basile; Larue, Frédéric; Dischler, Jean-Michel; Cignoni, Paolo and Miguel, EderOn-the-fly patch-based texturing consists of choosing at run-time, for several patches within a tileable texture, one random candidate among a pre-computed set of possible contents. This category of methods generates unbounded textures, for which filtering is not straightforward, because the screen pixel footprint may overlap multiple patches in texture space, i.e. different randomly chosen contents. In this paper, we propose a real-time anisotropic filtering which is fully compliant with the standard graphics pipeline. The main idea is to pre-filter the contents independently, store them in an atlas, and combine them at run-time to produce the final pixel color. The patch-map, referencing to which patch belong the fetched texels, requires a specific filtering approach, in order to recover the patches that overlap at low resolutions. In addition, we show how this method can achieve blending at patch boundaries in order to further reduce visible seams, without modification of our filtering algorithm.Item Presenting a Deep Motion Blending Approach for Simulating Natural Reach Motions(The Eurographics Association, 2018) Gaisbauer, Felix; Froehlich, Philipp; Lehwald, Jannes; Agethen, Philipp; Rukzio, Enrico; Jain, Eakta and Kosinka, JiríMotion blending and character animation systems are widely used in different domains such as gaming or simulation within production industries. Most of the established approaches are based on motion blending techniques. These approaches provide natural motions within common scenarios while inducing low computational costs. However, with increasing amount of influence parameters and constraints such as collision-avoidance, they increasingly fail or require a vast amount of time to meet these requirements. With ongoing progress in artificial intelligence and neural networks, recent works present deep learning based approaches for motion synthesis, which offer great potential for modeling natural motions, while considering heterogeneous influence factors. In this paper, we propose a novel deep blending approach to simulate non-cyclical natural reach motions based on an extension of phase functioned deep neural networks.Item Introducing a Modular Concept for Exchanging Character Animation Approaches(The Eurographics Association, 2018) Gaisbauer, Felix; Agethen, Philipp; Bär, Thomas; Rukzio, Enrico; Jain, Eakta and Kosinka, JiríNowadays, motion synthesis and character animation systems are used in different domains ranging from gaming to medicine and production industries. In recent years, there has been a vast progress in terms of realistic character animation. In this context, motion-capture based animation systems are frequently used to generate natural motions. Other approaches use physics based simulation, statistical models or machine learning methods to generate realistic motions. These approaches are however tightly coupled with the development environment, thus inducing high porting efforts if being incorporated into different platforms. Currently, no standard exists which allows to exchange complex character animation approaches. A comprehensive simulation of complex scenarios utilizing these heterogeneous approaches is therefore not possible, yet. In a different domain than motion, the Functional Mock-up Interface standard has already solved this problem. Initially being tailored to industrial needs, the standards allows to exchange dynamic simulation approaches such as solvers for mechatronic components. We present a novel concept, extending this standard to couple arbitrary character animation approaches using a common interface.