44-Issue 5

Permanent URI for this collection

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

Browse

Browsing 44-Issue 5 by Subject "Computing methodologies"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    MatAIRials: Isotropic Inflatable Metamaterials for Freeform Surface Design
    (The Eurographics Association and John Wiley & Sons Ltd., 2025) He, Siyuan; Wu, Meng-Jan; Lebée, Arthur; Skouras, Mélina; Attene, Marco; Sellán, Silvia
    Inflatable pads, such as those used as mattresses or protective equipment, are structures made of two planar membranes sealed according to periodic patterns, typically parallel lines or dots. In this work, we propose to treat these inflatables as metamaterials. By considering novel sealing patterns with 6-fold symmetry, we are able to generate a family of inflatable materials whose macroscale contraction is isotropic and can be modulated by controlling the parameters of the seals. We leverage this property of our inflatable materials family to propose a simple and effective algorithm based on conformal mapping that allows us to design the layout of inflatable structures that can be fabricated flat and whose inflated shapes approximate those of given target freeform surfaces.
  • Thumbnail Image
    Item
    Resolving Self-intersections in 3D Meshes while Preserving Floating-point Coordinates
    (The Eurographics Association and John Wiley & Sons Ltd., 2025) Valque, Léo; Lazard, Sylvain; Attene, Marco; Sellán, Silvia
    We present a straightforward and robust method for resolving the mesh intersection problem. We focus specifically on the challenge caused by the intersections resulting from the conversion of the vertices coordinates from their exact mathematical values to a fixed-precision floating-point format. Our method takes as input a soup of triangles and outputs intersection-free models whose vertices coordinates are all represented with double-precision floating-point format. We evaluated our approach thoroughly, considering a large collection of meshes. In particular, we can process all the 4 524 models in Thingi10K [ZJ16] that contain self-intersections. This outperforms previous state-of-the-art approaches: On the 527 models of Thingi10K for which naive rounding fails, Zhou et al.'s approach [ZGZJ16] is capable of handling 91% of them, and Valque's 94% [Val24]. In terms of time efficiency, our approach handles about 50k vertices per second on average, which is faster to that of Zhou et al. by a factor 1.4 on these non-trivial models and is faster than that of Valque by several order of magnitude.