Browsing by Author "Lescoat, Thibault"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Connectivity-preserving Smooth Surface Filling with Sharp Features
    (The Eurographics Association, 2019) Lescoat, Thibault; Memari, Pooran; Thiery, Jean-Marc; Ovsjanikov, Maks; Boubekeur, Tamy; Lee, Jehee and Theobalt, Christian and Wetzstein, Gordon
    We present a method for constructing a surface mesh filling gaps between the boundaries of multiple disconnected input components. Unlike previous works, our method pays special attention to preserving both the connectivity and large-scale geometric features of input parts, while maintaining efficiency and scalability w.r.t. mesh complexity. Starting from an implicit surface reconstruction matching the parts' boundaries, we first introduce a modified dual contouring algorithm which stitches a meshed contour to the input components while preserving their connectivity. We then show how to deform the reconstructed mesh to respect the boundary geometry and preserve sharp feature lines, smoothly blending them when necessary. As a result, our reconstructed surface is smooth and propagates the feature lines of the input. We demonstrate on a wide variety of input shapes that our method is scalable to large input complexity and results in superior mesh quality compared to existing techniques.
  • Thumbnail Image
    Item
    Spectral Mesh Simplification
    (The Eurographics Association and John Wiley & Sons Ltd., 2020) Lescoat, Thibault; Liu, Hsueh-Ti Derek; Thiery, Jean-Marc; Jacobson, Alec; Boubekeur, Tamy; Ovsjanikov, Maks; Panozzo, Daniele and Assarsson, Ulf
    The spectrum of the Laplace-Beltrami operator is instrumental for a number of geometric modeling applications, from processing to analysis. Recently, multiple methods were developed to retrieve an approximation of a shape that preserves its eigenvectors as much as possible, but these techniques output a subset of input points with no connectivity, which limits their potential applications. Furthermore, the obtained Laplacian results from an optimization procedure, implying its storage alongside the selected points. Focusing on keeping a mesh instead of an operator would allow to retrieve the latter using the standard cotangent formulation, enabling easier processing afterwards. Instead, we propose to simplify the input mesh using a spectrum-preserving mesh decimation scheme, so that the Laplacian computed on the simplified mesh is spectrally close to the one of the input mesh. We illustrate the benefit of our approach for quickly approximating spectral distances and functional maps on low resolution proxies of potentially high resolution input meshes.