Browsing by Author "Fanni, Filippo Andrea"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    FloralSurf: Space-Filling Geodesic Ornaments
    (The Eurographics Association, 2023) Albano, Valerio; Fanni, Filippo Andrea; Giachetti, Andrea; Pellacini, Fabio; Ritschel, Tobias; Weidlich, Andrea
    We propose a method to generate floral patterns on manifolds without relying on parametrizations. Taking inspiration from the literature on procedural space-filling vegetation, these patterns are made of non-intersecting ornaments that are grown on the surface by repeatedly adding different types of decorative elements, until the whole surface is covered. Each decorative element is defined by a set of geodesic Bézier splines and a set of growth points from which to continue growing the ornaments. Ornaments are grown in a greedy fashion, one decorative element at a time. At each step, we analyze a set of candidates, and retain the one that maximizes surface coverage, while ensuring that it does not intersect other ornaments. All operations in our method are performed in the intrinsic metric of the surface, thus ensuring that the derived decorations have good coverage, with neither distortions nor discontinuities, and can be grown on complex surfaces. In our method, users control the decorations by selecting the size and shape of the decorative elements and the position of the growth points.We demonstrate decorations that vary in the length of the ornaments' lines, and the number, scale and orientation of the placed decorations. We show that these patterns mimic closely the design of hand-drawn objects. Our algorithm supports any manifold surface represented as triangle meshes. In particular, we demonstrate patterns generated on surfaces with high genus, with and without borders and holes, and that can include a mixture of thin and large features.
  • No Thumbnail Available
    Item
    Outside-in Priority-based Approximation of 3D Models in LEGO Bricks
    (The Eurographics Association, 2022) Fanni, Filippo Andrea; Rossi, Elisa De; Giachetti, Andrea; Cabiddu, Daniela; Schneider, Teseo; Allegra, Dario; Catalano, Chiara Eva; Cherchi, Gianmarco; Scateni, Riccardo
    In this paper, we discuss the problem of converting a 3D mesh into an assembly of LEGO blocks. The major challenge of this task is how to aggregate the voxels derived by the shape discretization into a set of standard bricks guaranteeing global connectivity. We propose an outside-in priority-based heuristic method based on the analysis of the critical regions that are more likely to cause the creation of a legal assembly to fail. We show that our graph-building heuristic provides relevant advantages, making it easier to obtain a connected graph with good properties with respect to the layer-based or random aggregation strategies applied in most of the optimization approaches. We also propose BRICKS, a novel dataset for the evaluation of aggregation strategies. It includes voxelizations at 3 different resolutions of 33 shapes and allows the easy comparison of different voxel aggregation strategies independently of the shape discretization step and also considering their scalability. We use it to evaluate our approach with respect to graph-based connectivity measures, showing the advantages of the proposed strategy.