activity
20172025
most citedFrom 3D Models to 3D Prints: an Overview of the Processing Pipeline

166 citations · 371 across the 16 of their papers we have counts for

collaborators

17 papers

cs.GR2025

Volumetric Functional Maps

Filippo Maggioli, Simone Melzi, Marco Livesu

Computing volumetric correspondences between 3D shapes is a prominent tool for medical and industrial applications. In this work, we pave the way for spectral volume mapping, exten…

cs.CG2023

Advancing Front Mapping

Marco Livesu

We present Advancing Front Mapping (AFM), a provably robust algorithm for the computation of surface mappings to simple base domains. Given an input mesh and a convex or star-shape…

cs.CG2022★ 3 cited

Interactive and Robust Mesh Booleans

Gianmarco Cherchi, Fabio Pellacini, Marco Attene +1

Boolean operations are among the most used paradigms to create and edit digital shapes. Despite being conceptually simple, the computation of mesh Booleans is notoriously challengi…

cs.GR2022★ 77 cited

Hex-Mesh Generation and Processing: a Survey

Nico Pietroni, Marcel Campen, Alla Sheffer +7

In this article, we provide a detailed survey of techniques for hexahedral mesh generation. We cover the whole spectrum of alternative approaches to mesh generation, as well as pos…

cs.GR2021★ 28 cited

Optimal Dual Schemes for Adaptive Grid Based Hexmeshing

Marco Livesu, Luca Pitzalis, Gianmarco Cherchi

Hexahedral meshes are an ubiquitous domain for the numerical resolution of partial differential equations. Computing a pure hexahedral mesh from an adaptively refined grid is a pro…

cs.CG2020★ 1 cited

Mapping Surfaces with Earcut

Marco Livesu

Mapping a shape to some parametric domain is a fundamental tool in graphics and scientific computing. In practice, a map between two shapes is commonly represented by two meshes wi…

cs.CG2020★ 1 cited

Deterministic Linear Time Constrained Triangulation using Simplified Earcut

Marco Livesu, Gianmarco Cherchi, Riccardo Scateni +1

Triangulation algorithms that conform to a set of non-intersecting input segments typically proceed in an incremental fashion, by inserting points first, and then segments. Inserti…

cs.GR2020★ 34 cited

A Survey of Algorithms for Geodesic Paths and Distances

Keenan Crane, Marco Livesu, Enrico Puppo +1

Numerical computation of shortest paths or geodesics on curved domains, as well as the associated geodesic distance, arises in a broad range of applications across digital geometry…

cs.CG2020

Obtaining a Canonical Polygonal Schema from a Greedy Homotopy Basis with Minimal Mesh Refinement

Marco Livesu

Any closed manifold of genus g can be cut open to form a topological disk and then mapped to a regular polygon with 4g sides. This construction is called the canonical polygonal sc…

cs.GR2019

Real-time Deformation with Coupled Cages and Skeletons

Fabrizio Corda, Jean-Marc Thiery, Marco Livesu +3

Skeleton-based and cage-based deformation techniques represent the two most popular approaches to control real-time deformations of digital shapes and are, to a vast extent, comple…

cs.CE2019

Parametric shape optimization for combined additive-subtractive manufacturing

Christian Altenhofen, Marco Attene, Oliver Barrowclough +6

In the industrial practice, additive manufacturing processes are often followed by post-processing operations such as subtractive machining, milling, etc. to achieve the desired su…

cs.GR2019★ 3 cited

Benchmark of Polygon Quality Metrics for Polytopal Element Methods

M. Attene, S. Biasotti, S. Bertoluzza +6

Polytopal Element Methods (PEM) allow to solve differential equations on general polygonal and polyhedral grids, potentially offering great flexibility to mesh generation algorithm…

cs.GR2019★ 3 cited

Surface2Volume: Surface Segmentation Conforming Assemblable Volumetric Partition

Chrystiano Araújo, Daniela Cabiddu, Marco Attene +3

Users frequently seek to fabricate objects whose outer surfaces consist of regions with different surface attributes, such as color or material. Manufacturing such objects in a sin…

cs.GR2019★ 2 cited

Loopy Cuts: Surface-Field Aware Block Decomposition for Hex-Meshing

Marco Livesu, Nico Pietroni, Enrico Puppo +2

We present a new fully automatic block-decomposition hexahedral meshing algorithm capable of producing high quality meshes that strictly preserve feature curve networks on the inpu…

cs.GR2018★ 53 cited

HexaLab.net: an online viewer for hexahedral meshes

Matteo Bracci, Marco Tarini, Nico Pietroni +2

We introduce HexaLab: a WebGL application for real time visualization, exploration and assessment of hexahedral meshes. HexaLab can be used by simply opening www.hexalab.net. Our v…

math.NA2018

FETI-DP preconditioners for the Virtual Element Method on general 2D meshes

Daniele Prada, Silvia Bertoluzza, Micol Pennacchio +1

We analyze the performance of a state-of-the-art domain decomposition approach, the Finite Element Tearing and Interconnecting Dual Primal (FETI-DP) method, for the efficient solut…

cs.GR2017★ 166 cited

From 3D Models to 3D Prints: an Overview of the Processing Pipeline

Marco Livesu, Stefano Ellero, Jonás Martìnez +2

Due to the wide diffusion of 3D printing technologies, geometric algorithms for Additive Manufacturing are being invented at an impressive speed. Each single step, in particular al…