Daniele Panozzo

Daniele Panozzo

Auto-generated profile, based on publicly available information

Daniele Panozzo

New York University

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 February 2022 in Nature Cell Biology
Verified
Journal Article
Closed access
PDF file
NYNaoya Yamaguchi
Naoya Yamaguchi
ZZZiyi Zhang
Ziyi Zhang
TSTeseo Schneider
Teseo Schneider
BWBiran Wang
Biran Wang
DPDaniele Panozzo
Daniele Panozzo
HKHolger Knaut
Holger Knaut

22 May 2024 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ZHZizhou Huang
Zizhou Huang
DTDavi Colli Tozoni
Davi Colli Tozoni
AGArvi Gjoka
Arvi Gjoka
ZFZachary Ferguson
Zachary Ferguson
TSTeseo Schneider
Teseo Schneider
DZDenis Zorin
Denis Zorin
We introduce a general differentiable solver for time-dependent deformation problems with contact and friction. Our approach uses a finite element discretization with a high-order time integrator coupled with the recently proposed incremental potential contact method for handling contact and friction forces to solve ODE- and PDE-constrained optimization problems on scenes with complex geometry. It supports static and dynamic problems and differentiation with respect to all physical parameters involved in the physical problem description, which include shape, material parameters, friction parameters, and initial conditions. Our analytically derived adjoint formulation is efficient, with a small overhead (typically less than 10% for nonlinear problems) over the forward simulation, and shares many similarities with the forward problem, allowing the reuse of large parts of existing forward simulator code. We implement our approach on top of the open-source PolyFEM library and demonstrate the applicability of our solver to shape design, initial condition optimization, and material estimation on both simulated results and physical validations.

13 May 2022 in ACM Transactions on Graphics
Verified
Journal Article
Open access
PHPhilipp Herholz
Philipp Herholz
XTXuan Tang
Xuan Tang
TSTeseo Schneider
Teseo Schneider
SKShoaib Kamil
Shoaib Kamil
DPDaniele Panozzo
Daniele Panozzo
OSOlga Sorkine-Hornung
Olga Sorkine-Hornung
We introduce a code generator that converts unoptimized C++ code operating on sparse data into vectorized and parallel CPU or GPU kernels. Our approach unrolls the computation into a massive expression graph, performs redundant expression elimination, grouping, and then generates an architecture-specific kernel to solve the same problem, assuming that the sparsity pattern is fixed, which is a common scenario in many applications in computer graphics and scientific computing. We show that our approach scales to large problems and can achieve speedups of two orders of magnitude on CPUs and three orders of magnitude on GPUs, compared to a set of manually optimized CPU baselines. To demonstrate the practical applicability of our approach, we employ it to optimize popular algorithms with applications to physical simulation and interactive mesh deformation.

13 July 2024
Verified
Conference Paper
Open access
AGArvi Gjoka
Arvi Gjoka
EKEspen Knoop
Espen Knoop
MBMoritz Bächer
Moritz Bächer
DZDenis Zorin
Denis Zorin
DPDaniele Panozzo
Daniele Panozzo
We propose a computational design pipeline for pneumatically-actuated soft robots interacting with their environment through contact. We optimize the shape of the robot with a shape optimization approach, using a physically-accurate high-order finite element model for the forward simulation. Our approach enables fine-grained control over both deformation and contact forces by optimizing the shape of internal cavities, which we exploit to design pneumatically-actuated robots that can assume user-prescribed poses, or apply user-controlled forces. We demonstrate the efficacy of our method on two artistic and two functional examples.

23 July 2023
Verified
Conference Paper
Open access
ZFZachary Ferguson
Zachary Ferguson
PJPranav Jain
Pranav Jain
DZDenis Zorin
Denis Zorin
TSTeseo Schneider
Teseo Schneider
DPDaniele Panozzo
Daniele Panozzo
High-order bases provide major advantages over linear ones in terms of efficiency, as they provide (for the same physical model) higher accuracy for the same running time, and reliability, as they are less affected by locking artifacts and mesh quality. Thus, we introduce a high-order finite element (FE) formulation (high-order bases) for elastodynamic simulation on high-order (curved) meshes with contact handling based on the recently proposed Incremental Potential Contact (IPC) model. Our approach is based on the observation that each IPC optimization step used to minimize the elasticity, contact, and friction potentials leads to linear trajectories even in the presence of nonlinear meshes or nonlinear FE bases. It is thus possible to retain the strong non-penetration guarantees and large time steps of the original formulation while benefiting from the high-order bases and high-order geometry. We accomplish this by mapping displacements and resulting contact forces between a linear collision proxy and the underlying high-order representation. We demonstrate the effectiveness of our approach in a selection of problems from graphics, computational fabrication, and scientific computing.

26 July 2023 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ZFZachary Ferguson
Zachary Ferguson
TSTeseo Schneider
Teseo Schneider
DKDanny Kaufman
Danny Kaufman
DPDaniele Panozzo
Daniele Panozzo
We propose In-Timestep Remeshing, a fully coupled, adaptive meshing algorithm for contacting elastodynamics where remeshing steps are tightly integrated, implicitly, within the timestep solve. Our algorithm refines and coarsens the domain automatically by measuring physical energy changes within each ongoing timestep solve. This provides consistent, degree-of-freedom-efficient, productive remeshing that, by construction, is physics-aware and so avoids the errors, over-refinements, artifacts, per-example hand-tuning, and instabilities commonly encountered when remeshing with timestepping methods. Our in-timestep computation then ensures that each simulation step's output is both a converged stable solution on the updated mesh and a temporally consistent trajectory with respect to the model and solution of the last timestep. At the same time, the output is guaranteed safe (intersection- and inversion-free) across all operations. We demonstrate applications across a wide range of extreme stress tests with challenging contacts, sharp geometries, extreme compressions, large timesteps, and wide material stiffness ranges - all scenarios well-appreciated to challenge existing remeshing methods.