Search Results

Now showing 1 - 10 of 16
  • Item
    Symposium on Geometry Processing 2019 - CGF38-5: Frontmatter
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Bommes, David; Huang, Hui; Bommes, David and Huang, Hui
  • Item
    Hierarchical Functional Maps between Subdivision Surfaces
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Shoham‬‏, ‪Meged; Vaxman, Amir; Ben-Chen, Mirela; Bommes, David and Huang, Hui
    We propose a novel approach for computing correspondences between subdivision surfaces with different control polygons. Our main observation is that the multi-resolution spectral basis functions that are often used for computing a functional correspondence can be compactly represented on subdivision surfaces, and therefore can be efficiently computed. Furthermore, the reconstruction of a pointwise map from a functional correspondence also greatly benefits from the subdivision structure. Leveraging these observations, we suggest a hierarchical pipeline for functional map inference, allowing us to compute correspondences between surfaces at fine subdivision levels, with hundreds of thousands of polygons, an order of magnitude faster than existing correspondence methods. We demonstrate the applicability of our results by transferring high-resolution sculpting displacement maps and textures between subdivision models.
  • Item
    Consistent Shape Matching via Coupled Optimization
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Azencot, Omri; Dubrovina, Anastasia; Guibas, Leonidas; Bommes, David and Huang, Hui
    We propose a new method for computing accurate point-to-point mappings between a pair of triangle meshes given imperfect initial correspondences. Unlike the majority of existing techniques, we optimize for a map while leveraging information from the inverse map, yielding results which are highly consistent with respect to composition of mappings. Remarkably, our method considers only a linear number of candidate points on the target shape, allowing us to work directly with high resolution meshes, and to avoid a delicate and possibly error-prone up-sampling procedure. Key to this dimensionality reduction is a novel candidate selection process, where the mapped points drift over the target shape, finalizing their location based on intrinsic distortion measures. Overall, we arrive at an iterative scheme where at each step we optimize for the map and its inverse by solving two relaxed Quadratic Assignment Problems using off-the-shelf optimization tools. We provide quantitative and qualitative comparison of our method with several existing techniques, and show that it provides a powerful matching tool when accurate and consistent correspondences are required.
  • Item
    Dense Point-to-Point Correspondences Between Genus-Zero Shapes
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Lee, Sing Chun; Kazhdan, Misha; Bommes, David and Huang, Hui
    We describe a novel approach that addresses the problem of establishing correspondences between non-rigidly deformed shapes by performing the registration over the unit sphere. In a pre-processing step, each shape is conformally parametrized over the sphere, centered to remove Möbius inversion ambiguity, and authalically evolved to expand regions that are excessively compressed by the conformal parametrization. Then, for each pair of shapes, we perform fast SO(3) correlation to find the optimal rotational alignment and refine the registration using optical flow. We evaluate our approach on the TOSCA dataset, demonstrating that our approach compares favorably to state-of-the-art methods.
  • Item
    Parallel Globally Consistent Normal Orientation of Raw Unorganized Point Clouds
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Jakob, Johannes; Buchenau, Christoph; Guthe, Michael; Bommes, David and Huang, Hui
    A mandatory component for many point set algorithms is the availability of consistently oriented vertex-normals (e.g. for surface reconstruction, feature detection, visualization). Previous orientation methods on meshes or raw point clouds do not consider a global context, are often based on unrealistic assumptions, or have extremely long computation times, making them unusable on real-world data. We present a novel massively parallelized method to compute globally consistent oriented point normals for raw and unsorted point clouds. Built on the idea of graph-based energy optimization, we create a complete kNN-graph over the entire point cloud. A new weighted similarity criterion encodes the graph-energy. To orient normals in a globally consistent way we perform a highly parallel greedy edge collapse, which merges similar parts of the graph and orients them consistently. We compare our method to current state-of-the-art approaches and achieve speedups of up to two orders of magnitude. The achieved quality of normal orientation is on par or better than existing solutions, especially for real-world noisy 3D scanned data.
  • Item
    Point Pattern Synthesis via Irregular Convolution
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Tu, Peihan; Lischinski, Dani; Huang, Hui; Bommes, David and Huang, Hui
    Point pattern synthesis is a fundamental tool with various applications in computer graphics. To synthesize a point pattern, some techniques have taken an example-based approach, where the user provides a small exemplar of the target pattern. However, it remains challenging to synthesize patterns that faithfully capture the structures in the given exemplar. In this paper, we present a new example-based point pattern synthesis method that preserves both local and non-local structures present in the exemplar. Our method leverages recent neural texture synthesis techniques that have proven effective in synthesizing structured textures. The network that we present is end-to-end. It utilizes an irregular convolution layer, which converts a point pattern into a gridded feature map, to directly optimize point coordinates. The synthesis is then performed by matching inter- and intra-correlations of the responses produced by subsequent convolution layers. We demonstrate that our point pattern synthesis qualitatively outperforms state-of-the-art methods on challenging structured patterns, and enables various graphical applications, such as object placement in natural scenes, creative element patterns or realistic urban layouts in a 3D virtual environment.
  • Item
    Unsupervised Cycle-consistent Deformation for Shape Matching
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Groueix, Thibault; Fisher, Matthew; Kim, Vladimir G.; Russel, Bryan C.; Aubry, Mathieu; Bommes, David and Huang, Hui
    We propose a self-supervised approach to deep surface deformation. Given a pair of shapes, our algorithm directly predicts a parametric transformation from one shape to the other respecting correspondences. Our insight is to use cycle-consistency to define a notion of good correspondences in groups of objects and use it as a supervisory signal to train our network. Our method combines does not rely on a template, assume near isometric deformations or rely on point-correspondence supervision. We demonstrate the efficacy of our approach by using it to transfer segmentation across shapes. We show, on Shapenet, that our approach is competitive with comparable state-of-the-art methods when annotated training data is readily available, but outperforms them by a large margin in the few-shot segmentation scenario.
  • Item
    Feature Preserving Octree-Based Hexahedral Meshing
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Gao, Xifeng; Shen, Hanxiao; Panozzo, Daniele; Bommes, David and Huang, Hui
    We propose an octree-based algorithm to tessellate the interior of a closed surface with hexahedral cells. The generated hexahedral mesh (1) explicitly preserves sharp features of the original input, (2) has a maximal, user-controlled distance deviation from the input surface, (3) is composed of elements with only positive scaled jacobians (measured by the eight corners of a hex [SEK*07]), and (4) does not have self-intersections. We attempt to achieve these goals by proposing a novel pipeline to create an initial pure hexahedral mesh from an octree structure, taking advantage of recent developments in the generation of locally injective 3D parametrizations to warp the octree boundary to conform to the input surface. Sharp features in the input are bijectively mapped to poly-lines in the output and preserved by the deformation, which takes advantage of a scaffold mesh to prevent local and global intersections. The robustness of our technique is experimentally validated by batch processing a large collection of organic and CAD models, without any manual cleanup or parameter tuning. All results including mesh data and statistics in the paper are provided in the additional material. The open-source implementation will be made available online to foster further research in this direction.
  • Item
    Structural Design Using Laplacian Shells
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Ulu, Erva; McCann, Jim; Kara, Levent Burak; Bommes, David and Huang, Hui
    We introduce a method to design lightweight shell objects that are structurally robust under the external forces they may experience during use. Given an input 3D model and a general description of the external forces, our algorithm generates a structurally-sound minimum weight shell object. Our approach works by altering the local shell thickness repeatedly based on the stresses that develop inside the object. A key issue in shell design is that large thickness values might result in self-intersections on the inner boundary creating a significant computational challenge during optimization. To address this, we propose a shape parametrization based on the solution to the Laplace's equation that guarantees smooth and intersection-free shell boundaries. Combined with our gradient-free optimization algorithm, our method provides a practical solution to the structural design of hollow objects with a single inner cavity. We demonstrate our method on a variety of problems with arbitrary 3D models under complex force configurations and validate its performance with physical experiments.
  • Item
    On Evaluating Consensus in RANSAC Surface Registration
    (The Eurographics Association and John Wiley & Sons Ltd., 2019) Hruda, Lukáš; Dvořák, Jan; Vasa, Libor; Bommes, David and Huang, Hui
    Random Sample Consensus is a powerful paradigm that was successfully applied in various contexts, including Location Determination Problem, fundamental matrix estimation and global 3D surface registration, where many previously proposed algorithms can be interpreted as a particular implementation of this concept. In general, a set of candidate transformations is generated by some simple procedure, and an aligning transformation is chosen within this set, such that it aligns the largest portion of the input data. We observe that choosing the aligning transformation may also be interpreted as finding consensus among the candidates, which in turn involves measuring similarity of candidate rigid transformations. While it is not difficult to construct a metric that provides reasonable results, most approaches come with certain limitations and drawbacks. In this paper, we investigate possible means of measuring distances in SE(3) and compare their properties both theoretically and experimentally in a model RANSAC registration algorithm. We also propose modifications to existing measures and propose a novel method of locating the consensus transformation based on Vantage Point Tree data structure.