Browsing 41-Issue 6 by Title

Computing Schematic Layouts for Spatial Hypergraphs on Concentric Circles and Grids

Set systems can be visualized in various ways. An important distinction between techniques is whether the elements have a spatial location that is to be used for the visualization; for example, the elements are cities on ...

CVFont: Synthesizing Chinese Vector Fonts via Deep Layout Inferring

Creating a high‐quality Chinese vector font library, which can be directly used in real applications is time‐consuming and costly, since the font library typically consists of large amounts of vector glyphs. To address ...

Delaunay Painting: Perceptual Image Colouring from Raster Contours with Gaps

We introduce Delaunay Painting, a novel and easy‐to‐use method to flat‐colour contour‐sketches with gaps. Starting from a Delaunay triangulation of the input contours, triangles are iteratively filled with the appropriate ...

Erratum: Evaluating Data‐type Heterogeneity in Interactive Visual Analyses with Parallel Axes

Error Analysis of Photometric Stereo with Near Quasi‐Point Lights

The shape recovery quality of photometric stereo is sensitive to complicated error factors under close range lighting of quasi‐point lights. However, the error performance of photometric stereo under this practical scenario ...

Event‐based Dynamic Graph Drawing without the Agonizing Pain

Temporal networks can naturally model real‐world complex phenomena such as contact networks, information dissemination and physical proximity. However, nodes and edges bear real‐time coordinates, making it difficult to ...

Evocube: A Genetic Labelling Framework for Polycube‐Maps

Polycube‐maps are used as base‐complexes in various fields of computational geometry, including the generation of regular all‐hexahedral meshes free of internal singularities. However, the strict alignment constraints ...

Fast Neural Representations for Direct Volume Rendering

Despite the potential of neural scene representations to effectively compress 3D scalar fields at high reconstruction quality, the computational complexity of the training and data reconstruction step using scene representation ...

Gaussian Process for Radiance Functions on the S2$\mathbb {S}^2$ Sphere

Efficient approximation of incident radiance functions from a set of samples is still an open problem in physically based rendering. Indeed, most of the computing power required to synthesize a photo‐realistic image is ...

Harmonics Virtual Lights: Fast Projection of Luminance Field on Spherical Harmonics for Efficient Rendering

In this paper, we introduce harmonics virtual lights (HVL), to model indirect light sources for interactive global illumination of dynamic 3D scenes. Virtual point lights (VPL) are an efficient approach to define indirect ...

Image Representation on Curved Optimal Triangulation

Image triangulation aims to generate an optimal partition with triangular elements to represent the given image. One bottleneck in ensuring approximation quality between the original image and a piecewise approximation ...

Issue Information

JOKR: Joint Keypoint Representation for Unsupervised Video Retargeting

In unsupervised video retargeting, content is transferred from one video to another while preserving the original appearance and style, without any additional annotations. While this challenge has seen substantial advancements ...

Learning Human Viewpoint Preferences from Sparsely Annotated Models

View quality measures compute scores for given views and are used to determine an optimal view in viewpoint selection tasks. Unfortunately, despite the wide adoption of these measures, they are rather based on computational ...

Narrow‐Band Screen‐Space Fluid Rendering

This paper presents a novel and practical screen‐space liquid rendering for particle‐based fluids for real‐time applications. Our rendering pipeline performs particle filtering only in a narrow‐band around the boundary ...

NeRF‐Tex: Neural Reflectance Field Textures

We investigate the use of neural fields for modelling diverse mesoscale structures, such as fur, fabric and grass. Instead of using classical graphics primitives to model the structure, we propose to employ a versatile ...

Non‐Isometric Shape Matching via Functional Maps on Landmark‐Adapted Bases

We propose a principled approach for non‐isometric landmark‐preserving non‐rigid shape matching. Our method is based on the functional map framework, but rather than promoting isometries we focus on near‐conformal maps ...

Quad‐fisheye Image Stitching for Monoscopic Panorama Reconstruction

Monoscopic panorama provides the display of omnidirectional contents surrounding the viewer. An increasingly popular way to reconstruct a panorama is to stitch a collection of fisheye images. However, such non‐planar views ...

Real‐Time FE Simulation for Large‐Scale Problems Using Precondition‐Based Contact Resolution and Isolated DOFs Constraints

This paper presents a fast method to compute large‐scale problems in real‐time finite element simulations in the presence of contact and friction. The approach uses a precondition‐based contact resolution that performs a ...

Reconstructing Recognizable 3D Face Shapes based on 3D Morphable Models

Jiang, Diqiong; Jin, Yiwei; Zhang, Fang‐Lue; Lai, Yu‐Kun; Deng, Risheng; Tong, Ruofeng; Tang, Min (© 2022 Eurographics ‐ The European Association for Computer Graphics and John Wiley & Sons Ltd., 2022)

Many recent works have reconstructed distinctive 3D face shapes by aggregating shape parameters of the same identity and separating those of different people based on parametric models (e.g. 3D morphable models (3DMMs)). ...