The Eurographics Symposium on Geometry Processing (SGP) is the premier venue for disseminating new research ideas and cutting-edge results in geometry processing. In this research area, concepts from mathematics, computer science, and engineering are studied and applied to offer new insights and design efficient algorithms for acquisition, modeling, analysis, manipulation, simulation, and transmission of complex 3D models.
Proceeding Downloads
Stable topological signatures for points on 3D shapes
Comparing points on 3D shapes is among the fundamental operations in shape analysis. To facilitate this task, a great number of local point signatures or descriptors have been proposed in the past decades. However, the vast majority of these descriptors ...
Analysis and synthesis of 3D shape families via deep-learned generative models of surfaces
We present a method for joint analysis and synthesis of geometrically diverse 3D shape families. Our method first learns part-based templates such that an optimal set of fuzzy point and part correspondences is computed between the shapes of an input ...
Example based repetitive structure synthesis
We present an example based geometry synthesis approach for generating general repetitive structures. Our model is based on a meshless representation, unifying and extending previous synthesis methods. Structures in the example and output are converted ...
Reforming shapes for material-aware fabrication
As humans, we regularly associate shape of an object with its built material. In the context of geometric modeling, however, this inter-relation between form and material is rarely explored. In this work, we propose a novel data-driven reforming (i.e., ...
Texture mapping real-world objects with hydrographics
In the digital world, assigning arbitrary colors to an object is a simple operation thanks to texture mapping. However, in the real world, the same basic function of applying colors onto an object is far from trivial. One can specify colors during the ...
Hierarchical multiview rigid registration
Registration is a key step in the 3D reconstruction of real-world objects. In this paper, we propose a hierarchical method for the rigid registration of multiple views. The multiview registration problem is solved via hierarchical optimization defined ...
Sparse non-rigid registration of 3D shapes
Non-rigid registration of 3D shapes is an essential task of increasing importance as commodity depth sensors become more widely available for scanning dynamic scenes. Non-rigid registration is much more challenging than rigid registration as it ...
Tight relaxation of quadratic matching
Establishing point correspondences between shapes is extremely challenging as it involves both finding sets of semantically persistent feature points, as well as their combinatorial matching. We focus on the latter and consider the Quadratic Assignment ...
LeSSS: learned shared semantic spaces for relating multi-modal representations of 3D shapes
In this paper, we propose a new method for structuring multi-modal representations of shapes according to semantic relations. We learn a metric that links semantically similar objects represented in different modalities. First, 3D-shapes are associated ...
Fast and exact (Poisson) solvers on symmetric geometries
In computer graphics, numerous geometry processing applications reduce to the solution of a Poisson equation. When considering geometries with symmetry, a natural question to consider is whether and how the symmetry can be leveraged to derive an ...
Quaternion Julia set shape optimization
We present the first 3D algorithm capable of answering the question: what would a Mandelbrot-like set in the shape of a bunny look like? More concretely, can we find an iterated quaternion rational map whose potential field contains an isocontour with a ...
Dynamic SfM: detecting scene changes from image pairs
Detecting changes in scenes is important in many scene understanding tasks. In this paper, we pursue this goal simply from a pair of image recordings. Specifically, our goal is to infer what the objects are, how they are structured, and how they moved ...
An image degradation model for depth-augmented image editing
Images remain the most popular medium to capture our surroundings. Although significant advances have been made in developing image editing tools, the key challenge is to intelligently account for missing depth information. The growing popularity of ...
Unconditionally stable shock filters for image and geometry processing
This work revisits the Shock Filters of Osher and Rudin [OR90] and shows how the proposed filtering process can be interpreted as the advection of image values along flow-lines. Using this interpretation, we obtain an efficient implementation that only ...
Perfect Laplacians for polygon meshes
A discrete Laplace-Beltrami operator is called perfect if it possesses all the important properties of its smooth counterpart. It is known which triangle meshes admit perfect Laplace operators and how to fix any other mesh by changing the combinatorics. ...
Perfect matching quad layouts for manifold meshes
This paper introduces a new approach to automatically generate pure quadrilateral patch layouts on manifold meshes. The algorithm is based on a careful construction of a singularity graph of a given input frame field or a given periodic global ...
Can bi-cubic surfaces be class A?
'Class A surface' is a term in the automotive design industry, describing spline surfaces with aesthetic, non-oscillating highlight lines. Tensor-product B-splines of degree bi-3 (bicubic) are routinely used to generate smooth design surfaces and are ...
A one-dimensional homologically persistent skeleton of an unstructured point cloud in any metric space
Real data are often given as a noisy unstructured point cloud, which is hard to visualize. The important problem is to represent topological structures hidden in a cloud by using skeletons with cycles. All past skeletonization methods require extra ...
Index Terms
Proceedings of the Eurographics Symposium on Geometry Processing


