Fanni, Filippo AndreaRossi, Elisa DeGiachetti, AndreaCabiddu, DanielaSchneider, TeseoAllegra, DarioCatalano, Chiara EvaCherchi, GianmarcoScateni, Riccardo2022-11-082022-11-082022978-3-03868-191-52617-4855https://doi.org/10.2312/stag.20221256https://diglib.eg.org:443/handle/10.2312/stag20221256In 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.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies -> Shape modeling; Mesh models; Mesh geometry models; Volumetric modelsComputing methodologiesShape modelingMesh modelsMesh geometry modelsVolumetric models10.2312/stag.2022125657-6711 pages