37-Issue 5

Permanent URI for this collection

Geometry Processing 2018 - Symposium Proceedings
Paris, France
July 7 - 11, 2018
(for Posters see SGP 2018 - Posters)
Functional Maps
Interactive Curve Constrained Functional Maps
Anne Gehre, Michael M. Bronstein, Leif Kobbelt, and Justin Solomon
Topological Function Optimization for Continuous Shape Matching
Adrien Poulenard, Primoz Skraba, and Maks Ovsjanikov
Kernel Functional Maps
Larry Wang, Anne Gehre, Michael M. Bronstein, and Justin Solomon
Geometric Optimization
Efficient Path Generation with Reduced Coordinates
Renjie Chen, Craig Gotsman, and Kai Hormann
Packing Irregular Objects in 3D Space via Hybrid Optimization
Yuexin Ma, Zhonggui Chen, Wenchao Hu, and Wenping Wang
Error Propagation Control in Laplacian Mesh Compression
Libor Váša and Jan Dvořák
Shape Analysis and Representation
Learning Fuzzy Set Representations of Partial Shapes on Dual Embedding Spaces
Minhyuk Sung, Anastasia Dubrovina, Vladimir G. Kim, and Leonidas J. Guibas
Effective Characterization of Relief Patterns
Andrea Giachetti
Discrete Differential Geometry
A Unified Discrete Framework for Intrinsic and Extrinsic Dirac Operators for Geometry Processing
Zi Ye, Olga Diamanti, Chengcheng Tang, Leonidas J. Guibas, and Tim Hoffmann
An Explicit Structure-preserving Numerical Scheme for EPDiff
Omri Azencot, Orestis Vantzos, and Mirela Ben-Chen
Fast Approximation of Laplace-Beltrami Eigenproblems
Ahmad Nasikun, Christopher Brandt, and Klaus Hildebrandt
Meshing
Hierarchical Quad Meshing of 3D Scanned Surfaces
Dennis R. Bukenberger and Hendrik P. A. Lensch
QuadriFlow: A Scalable and Robust Method for Quadrangulation
Jingwei Huang, Yichao Zhou, Matthias Niessner, Jonathan Richard Shewchuk, and Leonidas J. Guibas
Field-Aligned and Lattice-Guided Tetrahedral Meshing
Saifeng Ni, Zichun Zhong, Jin Huang, Wenping Wang, and Xiaohu Guo
Spaces and Transformations
Principal Geodesic Analysis in the Space of Discrete Shells
Behrend Heeren, Chao Zhang, Martin Rumpf, and William Smith
Statistical Modeling of the 3D Geometry and Topology of Botanical Trees
Guan Wang, Hamid Laga, Jinyuan Jia, Ning Xie, and Hedi Tabia
Modular Latent Spaces for Shape Correspondences
Vignesh Ganapathi-Subramanian, Olga Diamanti, and Leonidas J. Guibas
Möbius Registration
Alex Baden, Keenan Crane, and Misha Kazhdan
Point Clouds and Reconstruction
Constructing 3D CSG Models from 3D Raw Point Clouds
Qiaoyun Wu, Kai Xu, and Jun Wang
Sensor-aware Normal Estimation for Point Clouds from 3D Range Scans
Marc Comino Trinidad, Carlos Andujar, Antonio Chica, and Pere Brunet

BibTeX (37-Issue 5)
                
@article{
10.1111:cgf.13486,
journal = {Computer Graphics Forum}, title = {{
Interactive Curve Constrained Functional Maps}},
author = {
Gehre, Anne
and
Bronstein, Michael M.
and
Kobbelt, Leif
and
Solomon, Justin
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13486}
}
                
@article{
10.1111:cgf.13487,
journal = {Computer Graphics Forum}, title = {{
Topological Function Optimization for Continuous Shape Matching}},
author = {
Poulenard, Adrien
and
Skraba, Primoz
and
Ovsjanikov, Maks
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13487}
}
                
@article{
10.1111:cgf.13488,
journal = {Computer Graphics Forum}, title = {{
Kernel Functional Maps}},
author = {
Wang, Larry
and
Gehre, Anne
and
Bronstein, Michael M.
and
Solomon, Justin
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13488}
}
                
@article{
10.1111:cgf.13489,
journal = {Computer Graphics Forum}, title = {{
Efficient Path Generation with Reduced Coordinates}},
author = {
Chen, Renjie
and
Gotsman, Craig
and
Hormann, Kai
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13489}
}
                
@article{
10.1111:cgf.13490,
journal = {Computer Graphics Forum}, title = {{
Packing Irregular Objects in 3D Space via Hybrid Optimization}},
author = {
Ma, Yuexin
and
Chen, Zhonggui
and
Hu, Wenchao
and
Wang, Wenping
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13490}
}
                
@article{
10.1111:cgf.13491,
journal = {Computer Graphics Forum}, title = {{
Error Propagation Control in Laplacian Mesh Compression}},
author = {
Vasa, Libor
and
Dvořák, Jan
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13491}
}
                
@article{
10.1111:cgf.13492,
journal = {Computer Graphics Forum}, title = {{
Learning Fuzzy Set Representations of Partial Shapes on Dual Embedding Spaces}},
author = {
Sung, Minhyuk
and
Dubrovina, Anastasia
and
Kim, Vladimir G.
and
Guibas, Leonidas J.
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13492}
}
                
@article{
10.1111:cgf.13493,
journal = {Computer Graphics Forum}, title = {{
Effective Characterization of Relief Patterns}},
author = {
Giachetti, Andrea
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13493}
}
                
@article{
10.1111:cgf.13494,
journal = {Computer Graphics Forum}, title = {{
A Unified Discrete Framework for Intrinsic and Extrinsic Dirac Operators for Geometry Processing}},
author = {
Ye, Zi
and
Diamanti, Olga
and
Tang, Chengcheng
and
Guibas, Leonidas J.
and
Hoffmann, Tim
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13494}
}
                
@article{
10.1111:cgf.13495,
journal = {Computer Graphics Forum}, title = {{
An Explicit Structure-preserving Numerical Scheme for EPDiff}},
author = {
Azencot, Omri
and
Vantzos, Orestis
and
Ben-Chen, Mirela
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13495}
}
                
@article{
10.1111:cgf.13496,
journal = {Computer Graphics Forum}, title = {{
Fast Approximation of Laplace-Beltrami Eigenproblems}},
author = {
Nasikun, Ahmad
and
Brandt, Christopher
and
Hildebrandt, Klaus
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13496}
}
                
@article{
10.1111:cgf.13497,
journal = {Computer Graphics Forum}, title = {{
Hierarchical Quad Meshing of 3D Scanned Surfaces}},
author = {
Bukenberger, Dennis R.
and
Lensch, Hendrik P. A.
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13497}
}
                
@article{
10.1111:cgf.13498,
journal = {Computer Graphics Forum}, title = {{
QuadriFlow: A Scalable and Robust Method for Quadrangulation}},
author = {
Huang, Jingwei
and
Zhou, Yichao
and
Niessner, Matthias
and
Shewchuk, Jonathan Richard
and
Guibas, Leonidas J.
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13498}
}
                
@article{
10.1111:cgf.13499,
journal = {Computer Graphics Forum}, title = {{
Field-Aligned and Lattice-Guided Tetrahedral Meshing}},
author = {
Ni, Saifeng
and
Zhong, Zichun
and
Huang, Jin
and
Wang, Wenping
and
Guo, Xiaohu
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13499}
}
                
@article{
10.1111:cgf.13500,
journal = {Computer Graphics Forum}, title = {{
Principal Geodesic Analysis in the Space of Discrete Shells}},
author = {
Heeren, Behrend
and
Zhang, Chao
and
Rumpf, Martin
and
Smith, William
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13500}
}
                
@article{
10.1111:cgf.13501,
journal = {Computer Graphics Forum}, title = {{
Statistical Modeling of the 3D Geometry and Topology of Botanical Trees}},
author = {
Wang, Guan
and
Laga, Hamid
and
Jia, Jinyuan
and
Xie, Ning
and
Tabia, Hedi
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13501}
}
                
@article{
10.1111:cgf.13502,
journal = {Computer Graphics Forum}, title = {{
Modular Latent Spaces for Shape Correspondences}},
author = {
Ganapathi-Subramanian, Vignesh
and
Diamanti, Olga
and
Guibas, Leonidas J.
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13502}
}
                
@article{
10.1111:cgf.13503,
journal = {Computer Graphics Forum}, title = {{
Möbius Registration}},
author = {
Baden, Alex
and
Crane, Keenan
and
Kazhdan, Misha
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13503}
}
                
@article{
10.1111:cgf.13504,
journal = {Computer Graphics Forum}, title = {{
Constructing 3D CSG Models from 3D Raw Point Clouds}},
author = {
Wu, Qiaoyun
and
Xu, Kai
and
Wang, Jun
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13504}
}
                
@article{
10.1111:cgf.13505,
journal = {Computer Graphics Forum}, title = {{
Sensor-aware Normal Estimation for Point Clouds from 3D Range Scans}},
author = {
Comino Trinidad, Marc
and
Andujar, Carlos
and
Chica, Antonio
and
Brunet, Pere
}, year = {
2018},
publisher = {
The Eurographics Association and John Wiley & Sons Ltd.},
ISSN = {1467-8659},
DOI = {
10.1111/cgf.13505}
}

Browse

Recent Submissions

Now showing 1 - 21 of 21
  • Item
    Frontmatter: Symposium on Geometry Processing 2018
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ju, Tao; Vaxman, Amir; Ju, Tao and Vaxman, Amir
  • Item
    Interactive Curve Constrained Functional Maps
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Gehre, Anne; Bronstein, Michael M.; Kobbelt, Leif; Solomon, Justin; Ju, Tao and Vaxman, Amir
    Functional maps have gained popularity as a versatile framework for representing intrinsic correspondence between 3D shapes using algebraic machinery. A key ingredient for this framework is the ability to find pairs of corresponding functions (typically, feature descriptors) across the shapes. This is a challenging problem on its own, and when the shapes are strongly non-isometric, nearly impossible to solve automatically. In this paper, we use feature curve correspondences to provide flexible abstractions of semantically similar parts of non-isometric shapes. We design a user interface implementing an interactive process for constructing shape correspondence, allowing the user to update the functional map at interactive rates by introducing feature curve correspondences. We add feature curve preservation constraints to the functional map framework and propose an efficient numerical method to optimize the map with immediate feedback. Experimental results show that our approach establishes correspondences between geometrically diverse shapes with just a few clicks.
  • Item
    Topological Function Optimization for Continuous Shape Matching
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Poulenard, Adrien; Skraba, Primoz; Ovsjanikov, Maks; Ju, Tao and Vaxman, Amir
    We present a novel approach for optimizing real-valued functions based on a wide range of topological criteria. In particular, we show how to modify a given function in order to remove topological noise and to exhibit prescribed topological features. Our method is based on using the previously-proposed persistence diagrams associated with real-valued functions, and on the analysis of the derivatives of these diagrams with respect to changes in the function values. This analysis allows us to use continuous optimization techniques to modify a given function, while optimizing an energy based purely on the values in the persistence diagrams. We also present a procedure for aligning persistence diagrams of functions on different domains, without requiring a mapping between them. Finally, we demonstrate the utility of these constructions in the context of the functional map framework, by first giving a characterization of functional maps that are associated with continuous point-topoint correspondences, directly in the functional domain, and then by presenting an optimization scheme that helps to promote the continuity of functional maps, when expressed in the reduced basis, without imposing any restrictions on metric distortion. We demonstrate that our approach is efficient and can lead to improvement in the accuracy of maps computed in practice.
  • Item
    Kernel Functional Maps
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Wang, Larry; Gehre, Anne; Bronstein, Michael M.; Solomon, Justin; Ju, Tao and Vaxman, Amir
    Functional maps provide a means of extracting correspondences between surfaces using linear-algebraic machinery. While the functional framework suggests efficient algorithms for map computation, the basic technique does not incorporate the intuition that pointwise modifications of a descriptor function (e.g. composition of a descriptor and a nonlinearity) should be preserved under the mapping; the end result is that the basic functional maps problem can be underdetermined without regularization or additional assumptions on the map. In this paper, we show how this problem can be addressed through kernelization, in which descriptors are lifted to higher-dimensional vectors or even infinite-length sequences of values. The key observation is that optimization problems for functional maps only depend on inner products between descriptors rather than descriptor values themselves. These inner products can be evaluated efficiently through use of kernel functions. In addition to deriving a kernelized version of functional maps including a recent extension in terms of pointwise multiplication operators, we provide an efficient conjugate gradient algorithm for optimizing our generalized problem as well as a strategy for low-rank estimation of kernel matrices through the Nyström approximation.
  • Item
    Efficient Path Generation with Reduced Coordinates
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Chen, Renjie; Gotsman, Craig; Hormann, Kai; Ju, Tao and Vaxman, Amir
    Path generation is an important problem in many fields, especially robotics. One way to create a path between a source point z and a target point y inside a complex planar domain W is to define a non-negative distance function d(y; z), such that following the negative gradient of d (by z) traces out such a path. This presents two challenges: (1) The mathematical challenge of defining d, such that d(y; z) has a single minimum at z = y for any fixed y, because the gradient-descent path may otherwise terminate at a local minimum before reaching y; (2) The computational challenge of defining d, such that it can be computed efficiently. Using the concepts of harmonic measure and f -divergence, we show how to assign a set of reduced coordinates to each point in W and to define a family of distance functions based on these coordinates, such that both the mathematical and the computational challenge are met. Since in practice, especially in robotics applications, the path is often restricted to follow the edges of a discrete network defined on a finite set of sites sampled from W, any method that works well in the continuous setting must be discretized appropriately to preserve the important properties of the continuous case. We show how to define a network connecting a finite set of sites, such that a greedy routing algorithm, which is the discrete equivalent of continuous gradient descent, based on our reduced coordinates is guaranteed to generate a path in the network between any two sites. In many cases, this network is close to a planar graph, especially if the set of sites is dense. Guaranteeing the existence of a greedy route between any two points in the graph is a significant advantage in practical applications, avoiding the complexity of other path-planning methods, such as the shortest-path and A* algorithms. While the paths generated by our algorithm are not the shortest possible, in practice we found that they are close to that.
  • Item
    Packing Irregular Objects in 3D Space via Hybrid Optimization
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ma, Yuexin; Chen, Zhonggui; Hu, Wenchao; Wang, Wenping; Ju, Tao and Vaxman, Amir
    Packing problems arise in a wide variety of practical applications. The basic problem is that of placing as many objects as possible in a non-overlapping configuration within a given container. Problems involving irregular shapes are the most challenging cases. In this paper, we consider the most general forms of irregular shape packing problems in 3D space, where both the containers and the objects can be of any shapes, and free rotations of the objects are allowed. We propose a heuristic method for efficiently packing irregular objects by combining continuous optimization and combinatorial optimization. Starting from an initial placement of an appropriate number of objects, we optimize the positions and orientations of the objects using continuous optimization. In combinatorial optimization, we further reduce the gaps between objects by swapping and replacing the deployed objects and inserting new objects. We demonstrate the efficacy of our method with experiments and comparisons.
  • Item
    Error Propagation Control in Laplacian Mesh Compression
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Vasa, Libor; Dvořák, Jan; Ju, Tao and Vaxman, Amir
    Laplacian mesh compression, also known as high-pass mesh coding, is a popular technique for efficiently storing both static and dynamic triangle meshes that gained further recognition with the advent of perceptual mesh distortion evaluation metrics. Currently, the usual rule of thumb that drives the decision for a mesh compression algorithm is whether or not accuracy in absolute scale is required: Laplacian mesh encoding is chosen when perceptual quality is the main objective, while other techniques provide better results in terms of mechanistic error measures such as mean squared error. In this work, we present a modification of the Laplacian mesh encoding algorithm that preserves its benefits while it substantially reduces the resulting absolute error. Our approach is based on analyzing the reconstruction stage and modifying the quantization of differential coordinates, so that the decoded result stays close to the input even in areas that are distant from anchor points. In our approach, we avoid solving an overdetermined system of linear equations and thus reduce data redundancy, improve conditioning and achieve faster processing. Our approach can be directly applied to both static and dynamic mesh compression and we provide quantitative results comparing our approach with the state of the art methods.
  • Item
    Learning Fuzzy Set Representations of Partial Shapes on Dual Embedding Spaces
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Sung, Minhyuk; Dubrovina, Anastasia; Kim, Vladimir G.; Guibas, Leonidas J.; Ju, Tao and Vaxman, Amir
    Modeling relations between components of 3D objects is essential for many geometry editing tasks. Existing techniques commonly rely on labeled components, which requires substantial annotation effort and limits components to a dictionary of predefined semantic parts. We propose a novel framework based on neural networks that analyzes an uncurated collection of 3D models from the same category and learns two important types of semantic relations among full and partial shapes: complementarity and interchangeability. The former helps to identify which two partial shapes make a complete plausible object, and the latter indicates that interchanging two partial shapes from different objects preserves the object plausibility. Our key idea is to jointly encode both relations by embedding partial shapes as fuzzy sets in dual embedding spaces. We model these two relations as fuzzy set operations performed across the dual embedding spaces, and within each space, respectively. We demonstrate the utility of our method for various retrieval tasks that are commonly needed in geometric modeling interfaces.
  • Item
    Effective Characterization of Relief Patterns
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Giachetti, Andrea; Ju, Tao and Vaxman, Amir
    In this paper, we address the problem of characterizing relief patterns over surface meshes independently on the underlying shape. We propose to tackle the problem by estimating local invariant features and encoding them using the Improved Fisher Vector technique, testing both features estimated on 3D meshes and local descriptors estimated on raster images created by encoding local surface properties (e.g. mean curvature) over a surface parametrization. We compare the robustness of the obtained descriptors against noise and surface bending and evaluate retrieval performances on a specific benchmark proposed in a track of the Eurographics Shape REtrieval Contest 2017. Results show that, with the proposed framework, it is possible to obtain retrieval results largely improving the state of the art and that the image-based approach is still effective when the underlying surface is heavily deformed.
  • Item
    A Unified Discrete Framework for Intrinsic and Extrinsic Dirac Operators for Geometry Processing
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ye, Zi; Diamanti, Olga; Tang, Chengcheng; Guibas, Leonidas J.; Hoffmann, Tim; Ju, Tao and Vaxman, Amir
    Spectral mesh analysis and processing methods, namely ones that utilize eigenvalues and eigenfunctions of linear operators on meshes, have been applied to numerous geometric processing applications. The operator used predominantly in these methods is the Laplace-Beltrami operator, which has the often-cited property that it is intrinsic, namely invariant to isometric deformation of the underlying geometry, including rigid transformations. Depending on the application, this can be either an advantage or a drawback. Recent work has proposed the alternative of using the Dirac operator on surfaces for spectral processing. The available versions of the Dirac operator either only focus on the extrinsic version, or introduce a range of mixed operators on a spectrum between fully extrinsic Dirac operator and intrinsic Laplace operator. In this work, we introduce a unified discretization scheme that describes both an extrinsic and intrinsic Dirac operator on meshes, based on their continuous counterparts on smooth manifolds. In this discretization, both operators are very closely related, and preserve their key properties from the smooth case. We showcase various applications of our operators, with improved numerics over prior work.
  • Item
    An Explicit Structure-preserving Numerical Scheme for EPDiff
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Azencot, Omri; Vantzos, Orestis; Ben-Chen, Mirela; Ju, Tao and Vaxman, Amir
    We present a new structure-preserving numerical scheme for solving the Euler-Poincaré Differential (EPDiff) equation on arbitrary triangle meshes. Unlike existing techniques, our method solves the difficult non-linear EPDiff equation by constructing energy preserving, yet fully explicit, update rules. Our approach uses standard differential operators on triangle meshes, allowing for a simple and efficient implementation. Key to the structure-preserving features that our method exhibits is a novel numerical splitting scheme. Namely, we break the integration into three steps which rely on linear solves with a fixed sparse matrix that is independent of the simulation and thus can be pre-factored. We test our method in the context of simulating concentrated reconnecting wavefronts on flat and curved domains. In particular, EPDiff is known to generate geometrical fronts which exhibit wave-like behavior when they interact with each other. In addition, we also show that at a small additional cost, we can produce globally-supported periodic waves by using our simulated fronts with wavefronts tracking techniques. We provide quantitative graphs showing that our method exactly preserves the energy in practice. In addition, we demonstrate various interesting results including annihilation and recreation of a circular front, a wave splitting and merging when hitting an obstacle and two separate fronts propagating and bending due to the curvature of the domain.
  • Item
    Fast Approximation of Laplace-Beltrami Eigenproblems
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Nasikun, Ahmad; Brandt, Christopher; Hildebrandt, Klaus; Ju, Tao and Vaxman, Amir
    The spectrum and eigenfunctions of the Laplace-Beltrami operator are at the heart of effective schemes for a variety of problems in geometry processing. A burden attached to these spectral methods is that they need to numerically solve a large-scale eigenvalue problem, which results in costly precomputation. In this paper, we address this problem by proposing a fast approximation algorithm for the lowest part of the spectrum of the Laplace-Beltrami operator. Our experiments indicate that the resulting spectra well-approximate reference spectra, which are computed with state-of-the-art eigensolvers. Moreover, we demonstrate that for different applications that comparable results are produced with the approximate and the reference spectra and eigenfunctions. The benefits of the proposed algorithm are that the cost for computing the approximate spectra is just a fraction of the cost required for numerically solving the eigenvalue problems, the storage requirements are reduced and evaluation times are lower. Our approach can help to substantially reduce the computational burden attached to spectral methods for geometry processing.
  • Item
    Hierarchical Quad Meshing of 3D Scanned Surfaces
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Bukenberger, Dennis R.; Lensch, Hendrik P. A.; Ju, Tao and Vaxman, Amir
    In this paper we present a novel method to reconstruct watertight quad meshes on scanned 3D geometry. There exist many different approaches to acquire 3D information from real world objects and sceneries. Resulting point clouds depict scanned surfaces as sparse sets of positional information. A common downside is the lack of normals, connectivity or topological adjacency data which makes it difficult to actually recover a meaningful surface. The concept described in this paper is designed to reconstruct a surface mesh despite all this missing information. Even when facing varying sample density, our algorithm is still guaranteed to produce watertight manifold meshes featuring quad faces only. The topology can be set-up to follow superimposed regular structures or align naturally to the point cloud's shape. Our proposed approach is based on an initial divide and conquer subsampling procedure: Surface samples are clustered in meaningful neighborhoods as leafs of a kd-tree. A representative sample of the surface neighborhood is determined for each leaf using a spherical surface approximation. The hierarchical structure of the binary tree is utilized to construct a basic set of loose tiles and to interconnect them. As a final step, missing parts of the now coherent tile structure are filled up with an incremental algorithm for locally optimal gap closure. Disfigured or concave faces in the resulting mesh can be removed with a constrained smoothing operator.
  • Item
    QuadriFlow: A Scalable and Robust Method for Quadrangulation
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Huang, Jingwei; Zhou, Yichao; Niessner, Matthias; Shewchuk, Jonathan Richard; Guibas, Leonidas J.; Ju, Tao and Vaxman, Amir
    QuadriFlow is a scalable algorithm for generating quadrilateral surface meshes based on the Instant Field-Aligned Meshes of Jakob et al. (ACM Trans. Graph. 34(6):189, 2015). We modify the original algorithm such that it efficiently produces meshes with many fewer singularities. Singularities in quadrilateral meshes cause problems for many applications, including parametrization and rendering with Catmull-Clark subdivision surfaces. Singularities can rarely be entirely eliminated, but it is possible to keep their number small. Local optimization algorithms usually produce meshes with many singularities, whereas the best algorithms tend to require non-local optimization, and therefore are slow. We propose an efficient method to minimize singularities by combining the Instant Meshes objective with a system of linear and quadratic constraints. These constraints are enforced by solving a global minimum-cost network flow problem and local boolean satisfiability problems. We have verified the robustness and efficiency of our method on a subset of ShapeNet comprising 17,791 3D objects in the wild. Our evaluation shows that the quality of the quadrangulations generated by our method is as good as, if not better than, those from other methods, achieving about four times fewer singularities than Instant Meshes. Other algorithms that produce similarly few singularities are much slower; we take less than ten seconds to process each model. Our source code is publicly available.
  • Item
    Field-Aligned and Lattice-Guided Tetrahedral Meshing
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ni, Saifeng; Zhong, Zichun; Huang, Jin; Wang, Wenping; Guo, Xiaohu; Ju, Tao and Vaxman, Amir
    We present a particle-based approach to generate field-aligned tetrahedral meshes, guided by cubic lattices, including BCC and FCC lattices. Given a volumetric domain with an input frame field and a user-specified edge length for the cubic lattice, we optimize a set of particles to form the desired lattice pattern. A Gaussian Hole Kernel associated with each particle is constructed. Minimizing the sum of kernels of all particles encourages the particles to form a desired layout, e.g., field-aligned BCC and FCC. The resulting set of particles can be connected to yield a high quality field-aligned tetrahedral mesh. As demonstrated by experiments and comparisons, the field-aligned and lattice-guided approach can produce higher quality isotropic and anisotropic tetrahedral meshes than state-of-the-art meshing methods.
  • Item
    Principal Geodesic Analysis in the Space of Discrete Shells
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Heeren, Behrend; Zhang, Chao; Rumpf, Martin; Smith, William; Ju, Tao and Vaxman, Amir
    Important sources of shape variability, such as articulated motion of body models or soft tissue dynamics, are highly nonlinear and are usually superposed on top of rigid body motion which must be factored out. We propose a novel, nonlinear, rigid body motion invariant Principal Geodesic Analysis (PGA) that allows us to analyse this variability, compress large variations based on statistical shape analysis and fit a model to measurements. For given input shape data sets we show how to compute a low dimensional approximating submanifold on the space of discrete shells, making our approach a hybrid between a physical and statistical model. General discrete shells can be projected onto the submanifold and sparsely represented by a small set of coefficients. We demonstrate two specific applications: model-constrained mesh editing and reconstruction of a dense animated mesh from sparse motion capture markers using the statistical knowledge as a prior.
  • Item
    Statistical Modeling of the 3D Geometry and Topology of Botanical Trees
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Wang, Guan; Laga, Hamid; Jia, Jinyuan; Xie, Ning; Tabia, Hedi; Ju, Tao and Vaxman, Amir
    We propose a framework for statistical modeling of the 3D geometry and topology of botanical trees. We treat botanical trees as points in a tree-shape space equipped with a proper metric that captures the geometric and the topological differences between trees. Geodesics in the tree-shape space correspond to the optimal sequence of deformations, i.e. bending, stretching, and topological changes, which align one tree onto another. In this way, the 3D tree modeling and synthesis problem becomes a problem of exploring the tree-shape space either in a controlled fashion, using statistical regression, or randomly by sampling from probability distributions fitted to populations in the tree-shape space. We show how to use this framework for (1) computing statistical summaries, e.g. the mean and modes of variations, of a population of botanical trees, (2) synthesizing random instances of botanical trees from probability distributions fitted to a population of botanical trees, and (3) modeling, interactively, 3D botanical trees using a simple sketching interface. The approach is fast and only requires as input 3D botanical tree models with a known upright orientation.
  • Item
    Modular Latent Spaces for Shape Correspondences
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Ganapathi-Subramanian, Vignesh; Diamanti, Olga; Guibas, Leonidas J.; Ju, Tao and Vaxman, Amir
    We consider the problem of transporting shape descriptors across shapes in a collection in a modular fashion, in order to establish correspondences between them. A common goal when mapping between multiple shapes is consistency, namely that compositions of maps along a cycle of shapes should be approximately an identity map. Existing attempts to enforce consistency typically require recomputing correspondences whenever a new shape is added to the collection, which can quickly become intractable. Instead, we propose an approach that is fully modular, where the bulk of the computation is done on each shape independently. To achieve this, we use intermediate nonlinear embedding spaces, computed individually on every shape; the embedding functions use ideas from diffusion geometry and capture how different descriptors on the same shape inter-relate. We then establish linear mappings between the different embedding spaces, via a shared latent space. The introduction of nonlinear embeddings allows for more nuanced correspondences, while the modularity of the construction allows for parallelizable calculation and efficient addition of new shapes. We compare the performance of our framework to standard functional correspondence techniques and showcase the use of this framework to simple interpolation and extrapolation tasks.
  • Item
    Möbius Registration
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Baden, Alex; Crane, Keenan; Kazhdan, Misha; Ju, Tao and Vaxman, Amir
    Conformal parameterizations over the sphere provide high-quality maps between genus zero surfaces, and are essential for applications such as data transfer and comparative shape analysis. However, such maps are not unique: to define correspondence between two surfaces, one must find the Möbius transformation that best aligns two parameterizations-akin to picking a translation and rotation in rigid registration problems. We describe a simple procedure that canonically centers and rotationally aligns two spherical maps. Centering is implemented via elementary operations on triangle meshes in R3, and minimizes area distortion. Alignment is achieved using the FFT over the group of rotations. We examine this procedure in the context of spherical conformal parameterization, orbifold maps, non-rigid symmetry detection, and dense point-to-point surface correspondence.
  • Item
    Constructing 3D CSG Models from 3D Raw Point Clouds
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Wu, Qiaoyun; Xu, Kai; Wang, Jun; Ju, Tao and Vaxman, Amir
    The Constructive Solid Geometry (CSG) tree, encoding the generative process of an object by a recursive compositional structure of bounded primitives, constitutes an important structural representation of 3D objects. Therefore, automatically recovering such a compositional structure from the raw point cloud of an object represents a high-level reverse engineering problem, finding applications from structure and functionality analysis to creative redesign. We propose an effective method to construct CSG models and trees directly over raw point clouds. Specifically, a large number of hypothetical bounded primitive candidates are first extracted from raw scans, followed by a carefully designed pruning strategy. We then choose to approximate the target CSG model by the combination of a subset of these candidates with corresponding Boolean operations using a binary optimization technique, from which the corresponding CSG tree can be derived. Our method attempts to consider the minimal description length concept in the point cloud analysis setting, where the objective function is designed to minimize the construction error and complexity simultaneously. We demonstrate the effectiveness and robustness of our method with extensive experiments on real scan data with various complexities and styles.
  • Item
    Sensor-aware Normal Estimation for Point Clouds from 3D Range Scans
    (The Eurographics Association and John Wiley & Sons Ltd., 2018) Comino Trinidad, Marc; Andujar, Carlos; Chica, Antonio; Brunet, Pere; Ju, Tao and Vaxman, Amir
    Normal vectors are essential for many point cloud operations, including segmentation, reconstruction and rendering. The robust estimation of normal vectors from 3D range scans is a challenging task due to undersampling and noise, specially when combining points sampled from multiple sensor locations. Our error model assumes a Gaussian distribution of the range error with spatially-varying variances that depend on sensor distance and reflected intensity, mimicking the features of Lidar equipment. In this paper we study the impact of measurement errors on the covariance matrices of point neighborhoods. We show that covariance matrices of the true surface points can be estimated from those of the acquired points plus sensordependent directional terms. We derive a lower bound on the neighbourhood size to guarantee that estimated matrix coefficients will be within a predefined error with a prescribed probability. This bound is key for achieving an optimal trade-off between smoothness and fine detail preservation. We also propose and compare different strategies for handling neighborhoods with samples coming from multiple materials and sensors. We show analytically that our method provides better normal estimates than competing approaches in noise conditions similar to those found in Lidar equipment.