Computer Graphics Forum

We introduce a generative model of part-segmented 3D objects: the shape variational auto-encoder ShapeVAE. The ShapeVAE describes a joint distribution over the existence of object parts, the locations of a dense set of surface points, and over surface ...

We introduce co-variation analysis as a tool for modeling the way part geometries and configurations co-vary across a family of man-made 3D shapes. While man-made 3D objects exhibit large geometric and structural variations, the geometry, structure, and ...

This paper generalizes the self-similar nesting of Matryoshka dolls "Russian nesting dolls" to arbitrary solid objects. We introduce the problem of finding the largest scale replica of an object that nests inside itself. Not only should the nesting ...

This paper presents a new preconditioning technique for large-scale geometric optimization problems, inspired by applications in mesh parameterization. Our positive semi-definite preconditioner acts on the gradients of optimization problems whose ...

Deep neural networks provide a promising tool for incorporating semantic information in geometry processing applications. Unlike image and video processing, however, geometry processing requires handling unstructured geometric data, and thus data ...

In this paper, we present a novel volumetric mesh representation suited for parallel computing on modern GPU architectures. The data structure is based on a compact, ternary sparse matrix storage of boundary operators. Boundary operators correspond to ...

Most state-of-the-art compression algorithms use complex connectivity traversal and prediction schemes, which are not efficient enough for online compression of large meshes. In this paper we propose a scalable massively parallel approach for ...

Restricted Voronoi diagrams are a fundamental geometric structure used in many applications such as surface reconstruction from point sets or optimal transport. Given a set of sites V = {vk}nk=1 ï ź ℝd and a mesh X with vertices in ℝd connected by ...

Geodesic based Voronoi diagrams play an important role in many applications of computer graphics. Constructing such Voronoi diagrams usually resorts to exact geodesics. However, exact geodesic computation always consumes lots of time and memory, which ...

Hexahedral hex- meshes are important for solving partial differential equations PDEs in applications of scientific computing and mechanical engineering. Many methods have been proposed aiming to generate hex-meshes with high scaled Jacobians. While it ...

In this paper, we propose a controllable embedding method for high- and low-dimensional geometry processing through sparse matrix eigenanalysis. Our approach is equally suitable to perform non-linear dimensionality reduction on big data, or to offer non-...

The heat kernel is a fundamental geometric object associated to every Riemannian manifold, used across applications in computer vision, graphics, and machine learning. In this article, we propose a novel computational approach to estimating the heat ...

The eigenfunctions and eigenvalues of the Laplace-Beltrami operator have proven to be a powerful tool for digital geometry processing, providing a description of geometry that is essentially independent of coordinates or the choice of discretization. ...

In this paper, we propose to consider the adjoint operators of functional maps, and demonstrate their utility in several tasks in geometry processing. Unlike a functional map, which represents a correspondence simply using the pull-back of function ...

Shape correspondence is an important and challenging problem in geometry processing. Generalized map representations, such as functional maps, have been recently suggested as an approach for handling difficult mapping problems, such as partial matching ...

We present a planar harmonic cage-based deformation method with local injectivity and bounded distortion guarantees, that is significantly faster than state-of-the-art methods with similar guarantees, and allows for real-time interaction. With a convex ...

In many geometry processing applications, it is required to improve an initial mesh in terms of multiple quality objectives. Despite the availability of several mesh generation algorithms with provable guarantees, such generated meshes may only satisfy ...