当前期刊: Computer Graphics Forum Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Front Matter
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13

    The European Association for Computer Graphics 41st Annual Conference EUROGRAPHICS 2020 Norrköping, Sweden May 25 – 29, 2020 Programme Committee Chairs Daniele Panozzo, New York, USA Ulf Assarsson, Chalmers, Sweden Conference Chairs Anders Ynnerman, Linköping University, Sweden Matthew Cooper, Linköping University, Sweden Jonas Unger, Linköping University, Sweden

    更新日期:2020-07-13
  • Front Matter
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13

    The European Association for Computer Graphics 41st Annual Conference EUROGRAPHICS 2020 Norrköping, Sweden May 25 – 29, 2020 State of the Art Reports STARs Co‐Chairs Rafal Mantiuk, University of Cambridge, UK Veronica Sundstedt, Blekinge Tekniska Högskola, Sweden Published by The Eurographics Association and John Wiley & Sons Ltd . in Computer Graphics forum , Volume 39 (2020), Number 2 ISSN 1467‐8659

    更新日期:2020-07-13
  • Asynchronous Eulerian Liquid Simulation
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    T. Koike; S. Morishima; R. Ando

    We present a novel method for simulating liquid with asynchronous time steps on Eulerian grids. Previous approaches focus on Smoothed Particle Hydrodynamics (SPH), Material Point Method (MPM) or tetrahedral Finite Element Method (FEM) but the method for simulating liquid purely on Eulerian grids have not yet been investigated. We address several challenges specifically arising from the Eulerian asynchronous

    更新日期:2020-07-13
  • Local Bases for Model‐reduced Smoke Simulations
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Olivier Mercier; Derek Nowrouzezahrai

    We present a flexible model reduction method for simulating incompressible fluids. We derive a novel vector field basis composed of localized basis flows which have simple analytic forms and can be tiled on regular lattices, avoiding the use of complicated data structures or neighborhood queries. Local basis flow interactions can be precomputed and reused to simulate fluid dynamics on any simulation

    更新日期:2020-07-13
  • Fast and Scalable Solvers for the Fluid Pressure Equations with Separating Solid Boundary Conditions
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Junyu Lai; Yangang Chen; Yu Gu; Christopher Batty; Justin W.L. Wan

    In this paper, we propose and evaluate fast, scalable approaches for solving the linear complementarity problems (LCP) arising from the fluid pressure equations with separating solid boundary conditions. Specifically, we present a policy iteration method, a penalty method, and a modified multigrid method, and demonstrate that each is able to properly handle the desired boundary conditions. Moreover

    更新日期:2020-07-13
  • Persistence Analysis of Multi‐scale Planar Structure Graph in Point Clouds
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    T. Lejemble; C. Mura; L. Barthe; N. Mellado

    Modern acquisition techniques generate detailed point clouds that sample complex geometries. For instance, we are able to produce millimeter‐scale acquisition of whole buildings. Processing and exploring geometrical information within such point clouds requires scalability, robustness to acquisition defects and the ability to model shapes at different scales. In this work, we propose a new representation

    更新日期:2020-07-13
  • Progressive Real‐Time Rendering of One Billion Points Without Hierarchical Acceleration Structures
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Markus Schütz; Gottfried Mandlburger; Johannes Otepka; Michael Wimmer

    Research in rendering large point clouds traditionally focused on the generation and use of hierarchical acceleration structures that allow systems to load and render the smallest fraction of the data with the largest impact on the output. The generation of these structures is slow and time consuming, however, and therefore ill‐suited for tasks such as quickly looking at scan data stored in widely

    更新日期:2020-07-13
  • SoftSMPL: Data‐driven Modeling of Nonlinear Soft‐tissue Dynamics for Parametric Humans
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Igor Santesteban; Elena Garces; Miguel A. Otaduy; Dan Casas

    We present SoftSMPL, a learning‐based method to model realistic soft‐tissue dynamics as a function of body shape and motion. Datasets to learn such task are scarce and expensive to generate, which makes training models prone to overfitting. At the core of our method there are three key contributions that enable us to model highly realistic dynamics and better generalization capabilities than state‐of‐the‐art

    更新日期:2020-07-13
  • Modeling and Estimation of Nonlinear Skin Mechanics for Animated Avatars
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Cristian Romero; Miguel A. Otaduy; Dan Casas; Jesus Perez

    Data‐driven models of human avatars have shown very accurate representations of static poses with soft‐tissue deformations. However they are not yet capable of precisely representing very nonlinear deformations and highly dynamic effects. Nonlinear skin mechanics are essential for a realistic depiction of animated avatars interacting with the environment, but controlling physics‐only solutions often

    更新日期:2020-07-13
  • A Practical Method for Animating Anisotropic Elastoplastic Materials
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Camille Schreck; Chris Wojtan

    This paper introduces a simple method for simulating highly anisotropic elastoplastic material behaviors like the dissolution of fibrous phenomena (splintering wood, shredding bales of hay) and materials composed of large numbers of irregularly‐shaped bodies (piles of twigs, pencils, or cards). We introduce a simple transformation of the anisotropic problem into an equivalent isotropic one, and we

    更新日期:2020-07-13
  • Mixing Yarns and Triangles in Cloth Simulation
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Juan J. Casafranca; Gabriel Cirio; Alejandro Rodríguez; Eder Miguel; Miguel A. Otaduy

    This paper presents a method to combine triangle and yarn models in cloth simulation, and hence leverage their best features. The majority of a garment uses a triangle‐based model, which reduces the overall computational and memory cost. Key areas of the garment use a yarn‐based model, which elicits rich effects such as structural nonlinearity and plasticity. To combine both models in a seamless and

    更新日期:2020-07-13
  • Interactively Modifying Compressed Sparse Voxel Representations
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    V. Careil; M. Billeter; E. Eisemann

    Voxels are a popular choice to encode complex geometry. Their regularity makes updates easy and enables random retrieval of values. The main limitation lies in the poor scaling with respect to resolution. Sparse voxel DAGs (Directed Acyclic Graphs) overcome this hurdle and offer high‐resolution representations for real‐time rendering but only handle static data. We introduce a novel data structure

    更新日期:2020-07-13
  • UV‐free Texturing using Sparse Voxel DAGs
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    D. Dolonius; E. Sintorn; U. Assarsson

    An application may have to load an unknown 3D model and, for enhanced realistic rendering, precompute values over the surface domain, such as light maps, ambient occlusion, or other global‐illumination parameters. High‐quality uv‐unwrapping has several problems, such as seams, distortions, and wasted texture space. Additionally, procedurally generated scene content, perhaps on the fly, can make manual

    更新日期:2020-07-13
  • Spherical Gaussian Light‐field Textures for Fast Precomputed Global Illumination
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    R. R. Currius; D. Dolonius; U. Assarsson; E. Sintorn

    We describe a method to use Spherical Gaussians with free directions and arbitrary sharpness and amplitude to approximate the precomputed local light field for any point on a surface in a scene. This allows for a high‐quality reconstruction of these light fields in a manner that can be used to render the surfaces with precomputed global illumination in real‐time with very low cost both in memory and

    更新日期:2020-07-13
  • Neural Temporal Adaptive Sampling and Denoising
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    J. Hasselgren; J. Munkberg; M. Salvi; A. Patney; A. Lefohn

    Despite recent advances in Monte Carlo path tracing at interactive rates, denoised image sequences generated with few samples per‐pixel often yield temporally unstable results and loss of high‐frequency details. We present a novel adaptive rendering method that increases temporal stability and image fidelity of low sample count path tracing by distributing samples via spatio‐temporal joint optimization

    更新日期:2020-07-13
  • DeepBRDF: A Deep Representation for Manipulating Measured BRDF
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Bingyang Hu; Jie Guo; Yanjun Chen; Mengtian Li; Yanwen Guo

    Effective compression of densely sampled BRDF measurements is critical for many graphical or vision applications. In this paper, we present DeepBRDF, a deep‐learning‐based representation that can significantly reduce the dimensionality of measured BRDFs while enjoying high quality of recovery. We consider each measured BRDF as a sequence of image slices and design a deep autoencoder with a masked L2

    更新日期:2020-07-13
  • Unified Neural Encoding of BTFs
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Gilles Rainer; Abhijeet Ghosh; Wenzel Jakob; Tim Weyrich

    Realistic rendering using discrete reflectance measurements is challenging, because arbitrary directions on the light and view hemispheres are queried at render time, incurring large memory requirements and the need for interpolation. This explains the desire for compact and continuously parametrized models akin to analytic BRDFs; however, fitting BRDF parameters to complex data such as BTF texels

    更新日期:2020-07-13
  • Combinatorial Construction of Seamless Parameter Domains
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    J. Zhou; C. Tu; D. Zorin; M. Campen

    The problem of seamless parametrization of surfaces is of interest in the context of structured quadrilateral mesh generation and spline‐based surface approximation. It has been tackled by a variety of approaches, commonly relying on continuous numerical optimization to ultimately obtain suitable parameter domains. We present a general combinatorial seamless parameter domain construction, free from

    更新日期:2020-07-13
  • Greedy Cut Construction for Parameterizations
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Tianyu Zhu; Chunyang Ye; Shuangming Chai; Xiao‐Ming Fu

    We present a novel method to construct short cuts for parameterizations with low isometric distortion. The algorithm contains two steps: (i) detect feature points, where the distortion is usually concentrated; and (ii) construct a cut by connecting the detected feature points. Central to each step is a greedy method. After generating a redundant feature point set, a greedy filtering process is performed

    更新日期:2020-07-13
  • Locally supported tangential vector, n‐vector, and tensor fields
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Ahmad Nasikun; Christopher Brandt; Klaus Hildebrandt

    We introduce a construction of subspaces of the spaces of tangential vector, n‐vector, and tensor fields on surfaces. The resulting subspaces can be used as the basis of fast approximation algorithms for design and processing problems that involve tangential fields. Important features of our construction are that it is based on a general principle, from which constructions for different types of tangential

    更新日期:2020-07-13
  • Expression Packing: As‐Few‐As‐Possible Training Expressions for Blendshape Transfer
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    E. Carrigan; E. Zell; C. Guiard; R. McDonnell

    To simplify and accelerate the creation of blendshape rigs, using a template rig is a common procedure, especially during the creation of digital doubles. Blendshape transfer methods facilitate copy and paste functionality of the blendshapes from the template model to the digital double. However, for adequate personalization, such methods require a set of scanned training expressions of the original

    更新日期:2020-07-13
  • Facial Expression Synthesis using a Global‐Local Multilinear Framework
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    M. Wang; D. Bradley; S. Zafeiriou; T. Beeler

    We present a practical method to synthesize plausible 3D facial expressions for a particular target subject. The ability to synthesize an entire facial rig from a single neutral expression has a large range of applications both in computer graphics and computer vision, ranging from the efficient and cost‐effective creation of CG characters to scalable data generation for machine learning purposes.

    更新日期:2020-07-13
  • Fast Nonlinear Least Squares Optimization of Large‐Scale Semi‐Sparse Problems
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    M. Fratarcangeli; D. Bradley; A. Gruber; G. Zoss; T. Beeler

    Many problems in computer graphics and vision can be formulated as a nonlinear least squares optimization problem, for which numerous off‐the‐shelf solvers are readily available. Depending on the structure of the problem, however, existing solvers may be more or less suitable, and in some cases the solution comes at the cost of lengthy convergence times. One such case is semi‐sparse optimization problems

    更新日期:2020-07-13
  • Invertible Paradoxic Loop Structures for Transformable Design
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Z. Li; G. Nawratil; F. Rist; M. Hensel

    We present an interactive tool compatible with existing software (Rhino/Grasshopper) to design ring structures with a paradoxic mobility, which are self‐collision‐free over the complete motion cycle. Our computational approach allows non‐expert users to create these invertible paradoxic loops with six rotational joints by providing several interactions that facilitate design exploration. In a first

    更新日期:2020-07-13
  • Interactive Modeling of Cellular Structures on Surfaces with Application to Additive Manufacturing
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    P. Stadlbauer; D. Mlakar; H.‐P. Seidel; M. Steinberger; R. Zayer

    The rich and evocative patterns of natural tessellations endow them with an unmistakable artistic appeal and structural properties which are echoed across design, production, and manufacturing. Unfortunately, interactive control of such patterns‐as modeled by Voronoi diagrams, is limited to the simple two dimensional case and does not extend well tofreeform surfaces. We present an approach for direct

    更新日期:2020-07-13
  • Illumination‐Guided Furniture Layout Optimization
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    N. Vitsas; G. Papaioannou; A. Gkaravelis; A. A. Vasilakis

    Lighting plays a very important role in interior design. However, in the specific problem of furniture layout recommendation, illumination has been either neglected or addressed with empirical or very simplified solutions. The effectiveness of a particular layout in its expected task performance can be greatly affected by daylighting and artificial illumination in a non‐trivial manner. In this paper

    更新日期:2020-07-13
  • Polygon Laplacian Made Simple
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Astrid Bunge; Philipp Herholz; Misha Kazhdan; Mario Botsch

    The discrete Laplace‐Beltrami operator for surface meshes is a fundamental building block for many (if not most) geometry processing algorithms. While Laplacians on triangle meshes have been researched intensively, yielding the cotangent discretization as the de‐facto standard, the case of general polygon meshes has received much less attention. We present a discretization of the Laplace operator which

    更新日期:2020-07-13
  • Spectral Mesh Simplification
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Thibault Lescoat; Hsueh‐Ti Derek Liu; Jean‐Marc Thiery; Alec Jacobson; Tamy Boubekeur; Maks Ovsjanikov

    The spectrum of the Laplace‐Beltrami operator is instrumental for a number of geometric modeling applications, from processing to analysis. Recently, multiple methods were developed to retrieve an approximation of a shape that preserves its eigenvectors as much as possible, but these techniques output a subset of input points with no connectivity, which limits their potential applications. Furthermore

    更新日期:2020-07-13
  • Fast and Robust QEF Minimization using Probabilistic Quadrics
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    P. Trettner; L. Kobbelt

    Error quadrics are a fundamental and powerful building block in many geometry processing algorithms. However, finding the minimizer of a given quadric is in many cases not robust and requires a singular value decomposition or some ad‐hoc regularization. While classical error quadrics measure the squared deviation from a set of ground truth planes or polygons, we treat the input data as genuinely uncertain

    更新日期:2020-07-13
  • Subdivision‐Specialized Linear Algebra Kernels for Static and Dynamic Mesh Connectivity on the GPU
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    D. Mlakar; M. Winter; P. Stadlbauer; H.‐P. Seidel; M. Steinberger; R. Zayer

    Subdivision surfaces have become an invaluable asset in production environments. While progress over the last years has allowed the use of graphics hardware to meet performance demands during animation and rendering, high‐performance is limited to immutable mesh connectivity scenarios. Motivated by recent progress in mesh data structures, we show how the complete Catmull‐Clark subdivision scheme can

    更新日期:2020-07-13
  • Stratified Markov Chain Monte Carlo Light Transport
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Adrien Gruson; Rex West; Toshiya Hachisuka

    Markov chain Monte Carlo (MCMC) sampling is a powerful approach to generate samples from an arbitrary distribution. The application to light transport simulation allows us to efficiently handle complex light transport such as highly occluded scenes. Since light transport paths in MCMC methods are sampled according to the path contributions over the sampling domain covering the whole image, bright pixels

    更新日期:2020-07-13
  • An Efficient Transport Estimator for Complex Layered Materials
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Luis E. Gamboa; Adrien Gruson; Derek Nowrouzezahrai

    Layered materials capture subtle, realistic reflection behaviors that traditional single‐layer models lack. Much of this is due to the complex subsurface light transport at the interfaces of – and in the media between – layers. Rendering with these materials can be costly, since we must simulate these transport effects at every evaluation of the underlying reflectance model. Rendering an image requires

    更新日期:2020-07-13
  • Spectral Mollification for Bidirectional Fluorescence
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    A. Jung; J. Hanika; C. Dachsbacher

    Fluorescent materials can shift energy between wavelengths, thereby creating bright and saturated colors both in natural and artificial materials. However, rendering fluorescence for continuous wavelengths or combined with wavelength dependent path configurations so far has only been feasible using spectral unidirectional methods. We present a regularization‐based approach for supporting fluorescence

    更新日期:2020-07-13
  • Fast and Robust Stochastic Structural Optimization
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Qiaodong Cui; Timothy Langlois; Pradeep Sen; Theodore Kim

    Stochastic structural analysis can assess whether a fabricated object will break under real‐world conditions. While this approach is powerful, it is also quite slow, which has previously limited its use to coarse resolutions (e.g., 26 × 34 × 28 ). We show that this approach can be made asymptotically faster, which in practice reduces computation time by two orders of magnitude, and allows the use of

    更新日期:2020-07-13
  • Computational Design and Optimization of Non‐Circular Gears
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Hao Xu; Tianwen Fu; Peng Song; Mingjun Zhou; Chi‐Wing Fu; Niloy J. Mitra

    We study a general form of gears known as non‐circular gears that can transfer periodic motion with variable speed through their irregular shapes and eccentric rotation centers. To design functional non‐circular gears is nontrivial, since the gear pair must have compatible shape to keep in contact during motion, so the driver gear can push the follower to rotate via a bounded torque that the motor

    更新日期:2020-07-13
  • Designing Robotically‐Constructed Metal Frame Structures
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Z. Ma; A. Walzer; C. Schumacher; R. Rust; F. Gramazio; M. Kohler; M. Bächer

    We present a computational technique that aids with the design of structurally‐sound metal frames, tailored for robotic fabrication using an existing process that integrate automated bar bending, welding, and cutting. Aligning frames with structurally‐favorable orientations, and decomposing models into fabricable units, we make the fabrication process scale‐invariant, and frames globally align in an

    更新日期:2020-07-13
  • Optimizing Object Decomposition to Reduce Visual Artifacts in 3D Printing
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    I. Filoscia; T. Alderighi; D. Giorgi; L. Malomo; M. Callieri; P. Cignoni

    We propose a method for the automatic segmentation of 3D objects into parts which can be individually 3D printed and then reassembled by preserving the visual quality of the final object. Our technique focuses on minimizing the surface affected by supports, decomposing the object into multiple parts whose printing orientation is automatically chosen. The segmentation reduces the visual impact on the

    更新日期:2020-07-13
  • Prefilters for Sharp Image Display
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Luís Cláudio Gouveia Rocha; Manuel M. Oliveira; Eduardo S. L. Gastal

    In this paper we use a simplified model of the human visual system to explain why humans tend do prefer “sharpened” digital images. From this model we then derive a family of image prefilters specifically adapted to viewing conditions and user preference, allowing for the trade‐off between ringing and aliasing while maximizing image sharpness. We discuss how our filters can be applied in a variety

    更新日期:2020-07-13
  • RGB2AO: Ambient Occlusion Generation from RGB Images
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    N. Inoue; D. Ito; Y. Hold‐Geoffroy; L. Mai; B. Price; T. Yamasaki

    We present RGB2AO, a novel task to generate ambient occlusion (AO) from a single RGB image instead of screen space buffers such as depth and normal. RGB2AO produces a new image filter that creates a non‐directional shading effect that darkens enclosed and sheltered areas. RGB2AO aims to enhance two 2D image editing applications: image composition and geometry‐aware contrast enhancement. We first collect

    更新日期:2020-07-13
  • Single Sensor Compressive Light Field Video Camera
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Saghi Hajisharif; Ehsan Miandji; Christine Guillemot; Jonas Unger

    This paper presents a novel compressed sensing (CS) algorithm and camera design for light field video capture using a single sensor consumer camera module. Unlike microlens light field cameras which sacrifice spatial resolution to obtain angular information, our CS approach is designed for capturing light field videos with high angular, spatial, and temporal resolution. The compressive measurements

    更新日期:2020-07-13
  • Accurate Real‐time 3D Gaze Tracking Using a Lightweight Eyeball Calibration
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Q. Wen; D. Bradley; T. Beeler; S. Park; O. Hilliges; J. Yong; F. Xu

    3D gaze tracking from a single RGB camera is very challenging due to the lack of information in determining the accurate gaze target from a monocular RGB sequence. The eyes tend to occupy only a small portion of the video, and even small errors in estimated eye orientations can lead to very large errors in the triangulated gaze target. We overcome these difficulties with a novel lightweight eyeball

    更新日期:2020-07-13
  • Style‐Controllable Speech‐Driven Gesture Synthesis Using Normalising Flows
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Simon Alexanderson; Gustav Eje Henter; Taras Kucherenko; Jonas Beskow

    Automatic synthesis of realistic gestures promises to transform the fields of animation, avatars and communicative agents. In off‐line applications, novel tools can alter the role of an animator to that of a director, who provides only high‐level input for the desired animation; a learned network then translates these instructions into an appropriate sequence of body poses. In interactive scenarios

    更新日期:2020-07-13
  • Motion Retargetting based on Dilated Convolutions and Skeleton‐specific Loss Functions
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    SangBin Kim; Inbum Park; Seongsu Kwon; JungHyun Han

    Motion retargetting refers to the process of adapting the motion of a source character to a target. This paper presents a motion retargetting model based on temporal dilated convolutions. In an unsupervised manner, the model generates realistic motions for various humanoid characters. The retargetted motions not only preserve the high‐frequency detail of the input motions but also produce natural and

    更新日期:2020-07-13
  • Binary Ostensibly‐Implicit Trees for Fast Collision Detection
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Floyd M. Chitalu; Christophe Dubach; Taku Komura

    We present a simple, efficient and low‐memory technique, targeting fast construction of bounding volume hierarchies (BVH) for broad‐phase collision detection. To achieve this, we devise a novel representation of BVH trees in memory. We develop a mapping of the implicit index representation to compact memory locations, based on simple bit‐shifts, to then construct and evaluate bounding volume test trees

    更新日期:2020-07-13
  • Real‐time Anticipation of Occlusions for Automated Camera Control in Toric Space
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    L. Burg; C. Lino; M. Christie

    Efficient visibility computation is a prominent requirement when designing automated camera control techniques for dynamic 3D environments; computer games, interactive storytelling or 3D media applications all need to track 3D entities while ensuring their visibility and delivering a smooth cinematic experience. Addressing this problem requires to sample a large set of potential camera positions and

    更新日期:2020-07-13
  • Efficient Minimum Distance Computation for Solids of Revolution
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    S.‐H. Son; S.‐H. Yoon; M.‐S. Kim; G. Elber

    We present a highly efficient algorithm for computing the minimum distance between two solids of revolution, each of which is defined by a planar cross‐section region and a rotation axis. The boundary profile curve for the cross‐section is first approximated by a bounding volume hierarchy (BVH) of fat arcs. By rotating the fat arcs around the axis, we generate the BVH of fat tori that bounds the surface

    更新日期:2020-07-13
  • Segment Tracing Using Local Lipschitz Bounds
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Eric Galin; Eric Guérin; Axel Paris; Adrien Peytavie

    We introduce Segment Tracing, a new algorithm that accelerates the classical Sphere Tracing method for computing the intersection between a ray and an implicit surface. Our approach consists in computing the Lipschitz bound locally over a segment to improve the marching step computation and accelerate the overall process. We describe the computation of the Lipschitz bound for different operators and

    更新日期:2020-07-13
  • Robust Shape Collection Matching and Correspondence from Shape Differences
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Aharon Cohen; Mirela Ben‐Chen

    We propose a method to automatically match two shape collections with a similar shape space structure, e.g. two characters in similar poses, and compute the inter‐maps between the collections. Given the intra‐maps in each collection, we extract the corresponding shape difference operators , and use them to construct an embedding of the shape space of each collection. We then align the two shape spaces

    更新日期:2020-07-13
  • Displacement‐Correlated XFEM for Simulating Brittle Fracture
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Floyd M. Chitalu; Qinghai Miao; Kartic Subr; Taku Komura

    We present a remeshing‐free brittle fracture simulation method under the assumption of quasi‐static linear elastic fracture mechanics (LEFM). To achieve this, we devise two algorithms. First, we develop an approximate volumetric simulation, based on the extended Finite Element Method (XFEM), to initialize and propagate Lagrangian crack‐fronts. We model the geometry of fracture explicitly as a surface

    更新日期:2020-07-13
  • Interactive Meso‐scale Simulation of Skyscapes
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Ulysse Vimont; James Gain; Maud Lastic; Guillaume Cordonnier; Babatunde Abiodun; Marie‐Paule Cani

    Although an important component of natural scenes, the representation of skyscapes is often relatively simplistic. This can be largely attributed to the complexity of the thermodynamics underpinning cloud evolution and wind dynamics, which make interactive simulation challenging. We address this problem by introducing a novel layered model that encompasses both terrain and atmosphere, and supports

    更新日期:2020-07-13
  • Simulation of Dendritic Painting
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    José A. Canabal; Miguel A. Otaduy; Byungmoon Kim; Jose Echevarria

    We present a new system for interactive dendritic painting. Dendritic painting is characterized by the unique and intricate branching patterns that grow from the interaction of inks, solvents and medium. Painting sessions thus become very dynamic and experimental. To achieve a compelling simulation of this painting technique we introduce a new Reaction‐Diffusion model with carefully designed terms

    更新日期:2020-07-13
  • A Survey of Temporal Antialiasing Techniques
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Lei Yang; Shiqiu Liu; Marco Salvi

    Temporal Antialiasing (TAA), formally defined as temporally‐amortized supersampling, is the most widely used antialiasing technique in today's real‐time renderers and game engines. This survey provides a systematic overview of this technique. We first review the history of TAA, its development path and related work. We then identify the two main sub‐components of TAA, sample accumulation and history

    更新日期:2020-07-13
  • A Survey of Multifragment Rendering
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    A. A. Vasilakis; K. Vardis; G. Papaioannou

    In the past few years, advances in graphics hardware have fuelled an explosion of research and development in the field of interactive and real‐time rendering in screen space. Following this trend, a rapidly increasing number of applications rely on multifragment rendering solutions to develop visually convincing graphics applications with dynamic content. The main advantage of these approaches is

    更新日期:2020-07-13
  • Learning Generative Models of 3D Structures
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Siddhartha Chaudhuri; Daniel Ritchie; Jiajun Wu; Kai Xu; Hao Zhang

    3D models of objects and scenes are critical to many academic disciplines and industrial applications. Of particular interest is the emerging opportunity for 3D graphics to serve artificial intelligence: computer vision systems can benefit from synthetically‐generated training data rendered from virtual 3D scenes, and robots can be trained to navigate in and interact with real‐world environments by

    更新日期:2020-07-13
  • State‐of‐the‐art in Automatic 3D Reconstruction of Structured Indoor Environments
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Giovanni Pintore; Claudio Mura; Fabio Ganovelli; Lizeth Fuentes‐Perez; Renato Pajarola; Enrico Gobbetti

    Creating high‐level structured 3D models of real‐world indoor scenes from captured data is a fundamental task which has important applications in many fields. Given the complexity and variability of interior environments and the need to cope with noisy and partial captured data, many open research problems remain, despite the substantial progress made in the past decade. In this survey, we provide

    更新日期:2020-07-13
  • State of the Art on Neural Rendering
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    A. Tewari; O. Fried; J. Thies; V. Sitzmann; S. Lombardi; K. Sunkavalli; R. Martin‐Brualla; T. Simon; J. Saragih; M. Nießner; R. Pandey; S. Fanello; G. Wetzstein; J.‐Y. Zhu; C. Theobalt; M. Agrawala; E. Shechtman; D. B Goldman; M. Zollhöfer

    Efficient rendering of photo‐realistic virtual worlds is a long standing effort of computer graphics. Modern graphics techniques have succeeded in synthesizing photo‐realistic images from hand‐crafted scene representations. However, the automatic generation of shape, materials, lighting, and other aspects of scenes remains a challenging problem that, if solved, would make photo‐realistic computer graphics

    更新日期:2020-07-13
  • Survey of Models for Acquiring the Optical Properties of Translucent Materials
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    J. R. Frisvad; S. A. Jensen; J. S. Madsen; A. Correia; L. Yang; S. K. S. Gregersen; Y. Meuret; P.‐E. Hansen

    The outset of realistic rendering is a desire to reproduce the appearance of the real world. Rendering techniques therefore operate at a scale corresponding to the size of objects that we observe with our naked eyes. At the same time, rendering techniques must be able to deal with objects of nearly arbitrary shapes and materials. These requirements lead to techniques that oftentimes leave the task

    更新日期:2020-07-13
  • A Survey on Sketch Based Content Creation: from the Desktop to Virtual and Augmented Reality
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-13
    Sukanya Bhattacharjee; Parag Chaudhuri

    Sketching is one of the most natural ways for representing any object pictorially. It is however, challenging to convert sketches to 3D content that is suitable for various applications like movies, games and computer aided design. With the advent of more accessible Virtual Reality (VR) and Augmented Reality (AR) technologies, sketching can potentially become a more powerful yet easy‐to‐use modality

    更新日期:2020-07-13
  • Interactive Programming for Parametric CAD
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-02
    Aman Mathur; Marcus Pirron; Damien Zufferey
    更新日期:2020-07-03
  • DockVis: Visual Analysis of Molecular Docking Trajectories
    Comput. Graph. Forum (IF 2.116) Pub Date : 2020-07-01
    Katarína Furmanová; Ondřej Vávra; Barbora Kozlíková; Jiří Damborský; Vojtěch Vonásek; David Bednář; Jan Byška
    更新日期:2020-07-01
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
产业、创新与基础设施
AI核心技术
10years
自然科研线上培训服务
材料学研究精选
Springer Nature Live 产业与创新线上学术论坛
胸腔和胸部成像专题
自然科研论文编辑服务
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
杨超勇
周一歌
华东师范大学
段炼
清华大学
廖矿标
李远
跟Nature、Science文章学绘图
隐藏1h前已浏览文章
中洪博元
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
x-mol收录
福州大学
南京大学
王杰
丘龙斌
电子显微学
何凤
洛杉矶分校
吴杰
赵延川
试剂库存
天合科研
down
wechat
bug