PG2019 Short Papers

Permanent URI for this collection

https://diglib.eg.org/handle/10.2312/2632814

Browse

Browsing PG2019 Short Papers by Subject "Mesh models"

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
    Feature Curve Network Extraction via Quadric Surface Fitting
    (The Eurographics Association, 2019) Zhengda, Lu; Guo, Jianwei; Xiao, Jun; Wang, Ying; Zhang, Xiaopeng; Yan, Dong-Ming; Lee, Jehee and Theobalt, Christian and Wetzstein, Gordon
    Feature curves on 3D shapes provide a high dimensional representation of the geometry and reveal their underlying structure. In this paper, we present an automatic approach for extracting complete feature curve networks from 3D models, as well as generating a high-quality patch layout. Starting from an initial collection of noisy and fragmented feature curves, we first filter non-salient or noisy feature curves by utilizing a quadric surface fitting technique. We then handle the curve intersections and curve missing by conducting a feature extension step to form a closed feature curve network. Finally, we generate a patch layout to reveal a highly structured representation of the input surfaces. Experimental results demonstrate that our algorithm is robust for extracting complete feature curve networks from complex input meshes and achieves superior quality patch layouts compared with the state-of-the-art approaches.