Marco Attene
Research Subjects
Marco Attene has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Daniela Cabiddu
Istituto di Matematica Applicata e Tecnologie Informatiche “E. Magenes” Consiglio Nazionale delle Ricerche Rome Italy
3 shared publications - Daniele Panozzo
New York University, New York, USA
3 shared publications - Denis Zorin
New York University, New York, USA
2 shared publications - Enrico Puppo
University of Genoa, Genoa, Italy
2 shared publications - Federico Sichetti
Università di Genova, Genova, Italy
2 shared publications - Zizhou Huang
New York University, New York, USA
2 shared publications
Latest Publications
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-15
Surface chamfering for robust tetrahedral meshing
We present an algorithm that produces high quality tetrahedral meshes conforming with input polyhedra. Our meshing algorithm is based on Ruppert's Delaunay refinement where convergence is guaranteed thanks to a novel chamfering approach that removes all acute angles from the input. On such a modified input Delaunay refinement produces a Delaunay tetrahedrization where all the faces have bounded angles. The input portions that were removed by the chamfering are re-inserted in this tetrahedrization to achieve exact conformance at the cost of a small number of bad-shaped tetrahedra near the formerly acute input angles. Numerical robustness is guaranteed along all the phases thanks to a clever use of modern indirect geometric predicates and the definition of a new type of implicit point to represent Steiner vertices on the input faces. In practice, our prototype implementation produces meshes having a quality comparable to the state-of-the-art tetgen software: while tetgen fails on 37% of the 3942 valid models in the Thingi10k dataset, our method succeeds on all of them.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-15
Open AccessSurface chamfering for robust tetrahedral meshing
We present an algorithm that produces high quality tetrahedral meshes conforming with input polyhedra. Our meshing algorithm is based on Ruppert's Delaunay refinement where convergence is guaranteed thanks to a novel chamfering approach that removes all acute angles from the input. On such a modified input Delaunay refinement produces a Delaunay tetrahedrization where all the faces have bounded angles. The input portions that were removed by the chamfering are re-inserted in this tetrahedrization to achieve exact conformance at the cost of a small number of bad-shaped tetrahedra near the formerly acute input angles. Numerical robustness is guaranteed along all the phases thanks to a clever use of modern indirect geometric predicates and the definition of a new type of implicit point to represent Steiner vertices on the input faces. In practice, our prototype implementation produces meshes having a quality comparable to the state-of-the-art tetgen software: while tetgen fails on 37% of the 3942 valid models in the Thingi10k dataset, our method succeeds on all of them.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-18
MiSo: A DSL for Robust and Efficient Solve and MInimize Problems
Many problems in computer graphics can be formulated as finding the global minimum of a function subject to a set of non-linear constraints (Minimize), or finding all solutions of a system of non-linear constraints (Solve). We introduce MiSo, a domain-specific language and compiler for generating efficient C++ code for low-dimensional Minimize and Solve problems, that uses interval methods to guarantee conservative results while using floating point arithmetic. We demonstrate that MiSo-generated code shows competitive performance compared to hand-optimized codes for several computer graphics problems, including high-order collision detection with non-linear trajectories, surface-surface intersection, and geometrical validity checks for finite element simulation.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-18
Open AccessMiSo: A DSL for Robust and Efficient Solve and MInimize Problems
Many problems in computer graphics can be formulated as finding the global minimum of a function subject to a set of non-linear constraints (Minimize), or finding all solutions of a system of non-linear constraints (Solve). We introduce MiSo, a domain-specific language and compiler for generating efficient C++ code for low-dimensional Minimize and Solve problems, that uses interval methods to guarantee conservative results while using floating point arithmetic. We demonstrate that MiSo-generated code shows competitive performance compared to hand-optimized codes for several computer graphics problems, including high-order collision detection with non-linear trajectories, surface-surface intersection, and geometrical validity checks for finite element simulation.
- Open Access
- 9 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (5) , 1-19
High-Order Continuous Geometrical Validity
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform linearly within a time interval. Our algorithm uses a combination of adaptive Bézier refinement and bisection search to determine if, when, and where the Jacobian determinant of an element’s polynomial geometric map becomes negative in the transition from one configuration to another. In elastodynamic simulation, our algorithm guarantees that the system remains physically valid during the entire trajectory, not only at discrete time steps. Unlike previous approaches, physical validity is preserved even when our method is implemented using floating point arithmetic. Hence, our algorithm is only slightly slower than existing non-conservative methods while providing guarantees and while being an easy drop-in replacement for current validity tests. To prove the practical effectiveness of our algorithm, we demonstrate its use in a high-order Incremental Potential Contact (IPC) elastodynamic simulator and experimentally show that it prevents invalid, simulation-breaking configurations that would otherwise occur using non-conservative methods.
- 9 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (5) , 1-19
Open AccessHigh-Order Continuous Geometrical Validity
We propose a conservative algorithm to test the geometrical validity of simplicial (triangles, tetrahedra), tensor product (quadrilaterals, hexahedra), and mixed (prisms) elements of arbitrary polynomial order as they deform linearly within a time interval. Our algorithm uses a combination of adaptive Bézier refinement and bisection search to determine if, when, and where the Jacobian determinant of an element’s polynomial geometric map becomes negative in the transition from one configuration to another. In elastodynamic simulation, our algorithm guarantees that the system remains physically valid during the entire trajectory, not only at discrete time steps. Unlike previous approaches, physical validity is preserved even when our method is implemented using floating point arithmetic. Hence, our algorithm is only slightly slower than existing non-conservative methods while providing guarantees and while being an easy drop-in replacement for current validity tests. To prove the practical effectiveness of our algorithm, we demonstrate its use in a high-order Incremental Potential Contact (IPC) elastodynamic simulator and experimentally show that it prevents invalid, simulation-breaking configurations that would otherwise occur using non-conservative methods.
- 1 May 2019
- Published by Elsevier in Computers & Graphics
- Vol. 80, 73-84
slice2mesh: A meshing tool for the simulation of additive manufacturing processes
- 1 May 2019
- Published by Elsevier in Computers & Graphics
- Vol. 80, 73-84
slice2mesh: A meshing tool for the simulation of additive manufacturing processes
- 1 August 2017
- Published by Elsevier in Computers & Graphics
- Vol. 66, 143-153
ϵ-maps: Characterizing, detecting and thickening thin features in geometric models
- 1 August 2017
- Published by Elsevier in Computers & Graphics
- Vol. 66, 143-153
ϵ-maps: Characterizing, detecting and thickening thin features in geometric models
- Open Access
- 22 June 2015
- Published by U-turn Press LLC
- p. 303-307
A Web Repository to Describe and Execute Shape Processing Workflows
- 22 June 2015
- Published by U-turn Press LLC
- p. 303-307
Open AccessA Web Repository to Describe and Execute Shape Processing Workflows