activity
20102023
most citedFast Tetrahedral Meshing in the Wild

184 citations · 568 across the 28 of their papers we have counts for

collaborators

31 papers

math.OC2023★ 5 cited

Optimized shock-protecting microstructures

Zizhou Huang, Daniele Panozzo, Denis Zorin

Mechanical shock is a common occurrence in various settings, there are two different scenarios for shock protection: catastrophic protection (e.g. car collisions and falls) and rou…

cs.GR2023★ 1 cited

Cut-Cell Microstructures for Two-scale Structural Optimization

Davi Colli Tozoni, Zizhou Huang, Daniele Panozzo +1

Two-scale topology optimization, combined with the design of microstructure families with a broad range of effective material parameters, is increasingly widely used in many fabric…

cs.CG2023★ 1 cited

Constrained Delaunay Tetrahedrization: A Robust and Practical Approach

Lorenzo Diazzi, Daniele Panozzo, Amir Vaxman +1

We present a numerically robust algorithm for computing the constrained Delaunay tetrahedrization (CDT) of a piecewise-linear complex, which has a 100% success rate on the 4408 val…

math.NA2023★ 2 cited

Convergent Incremental Potential Contact

Minchen Li, Zachary Ferguson, Teseo Schneider +5

Recent advances in the simulation of frictionally contacting elastodynamics with the Incremental Potential Contact (IPC) model have enabled inversion and intersection-free simulati…

physics.med-ph2022★ 10 cited

Open-Full-Jaw: An open-access dataset and pipeline for finite element models of human jaw

Torkan Gholamalizadeh, Faezeh Moshfeghifar, Zachary Ferguson +7

Developing computational models of the human jaw acquired from cone-beam computed tomography (CBCT) scans is time-consuming and labor-intensive. Besides, a quantitative comparison…

cs.GR2022★ 11 cited

High-Order Incremental Potential Contact for Elastodynamic Simulation on Curved Meshes

Zachary Ferguson, Pranav Jain, Denis Zorin +2

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 reli…

cs.GR2022★ 23 cited

Differentiable solver for time-dependent deformation problems with contact

Zizhou Huang, Davi Colli Tozoni, Arvi Gjoka +4

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…

cs.CE2021

A Large-Scale Benchmark for the Incompressible Navier-Stokes Equations

Zizhou Huang, Teseo Schneider, Minchen Li +3

We introduce a collection of benchmark problems in 2D and 3D (geometry description and boundary conditions), including simple cases with known analytic solution, classical experime…

cs.MS2021★ 2 cited

A Cross-Platform Benchmark for Interval Computation Libraries

Xuan Tang, Zachary Ferguson, Teseo Schneider +3

Interval computation is widely used to certify computations that use floating point operations to avoid pitfalls related to rounding error introduced by inaccurate operations. Desp…

cs.PL2021

Sparsity-Specific Code Optimization using Expression Trees

Philipp Herholz, Xuan Tang, Teseo Schneider +3

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…

cs.LG2021★ 4 cited

An Extensible Benchmark Suite for Learning to Simulate Physical Systems

Karl Otness, Arvi Gjoka, Joan Bruna +4

Simulating physical systems is a core component of scientific computing, encompassing a wide range of physical domains and applications. Recently, there has been a surge in data-dr…

cs.GR2021★ 64 cited

Orienting Point Clouds with Dipole Propagation

Gal Metzer, Rana Hanocka, Denis Zorin +3

Establishing a consistent normal orientation for point clouds is a notoriously difficult problem in geometry processing, requiring attention to both local and global shape characte…

cs.CG2021

Efficient and Robust Discrete Conformal Equivalence with Boundary

Marcel Campen, Ryan Capouellez, Hanxiao Shen +3

We describe an efficient algorithm to compute a conformally equivalent metric for a discrete surface, possibly with boundary, exhibiting prescribed Gaussian curvature at all interi…

cs.CV2020★ 3 cited

DEF: Deep Estimation of Sharp Geometric Features in 3D Shapes

Albert Matveev, Ruslan Rakhimov, Alexey Artemov +6

We propose Deep Estimators of Features (DEFs), a learning-based framework for predicting sharp geometric features in sampled 3D shapes. Differently from existing data-driven method…

cs.RO2020★ 1 cited

Robust & Asymptotically Locally Optimal UAV-Trajectory Generation Based on Spline Subdivision

Ruiqi Ni, Teseo Schneider, Daniele Panozzo +2

Generating locally optimal UAV-trajectories is challenging due to the non-convex constraints of collision avoidance and actuation limits. We present the first local, optimization-b…

cs.GR2020★ 45 cited

A Large Scale Benchmark and an Inclusion-Based Algorithm for Continuous Collision Detection

Bolun Wang, Zachary Ferguson, Teseo Schneider +3

We introduce a large scale benchmark for continuous collision detection (CCD) algorithms, composed of queries manually constructed to highlight challenging degenerate cases and aut…

cs.MS2020★ 5 cited

ACORNS: An Easy-To-Use Code Generator for Gradients and Hessians

Deshana Desai, Etai Shuchatowitz, Zhongshi Jiang +2

The computation of first and second-order derivatives is a staple in many computing applications, ranging from machine learning to scientific computing. We propose an algorithm to…

cs.CV2019

VoronoiNet: General Functional Approximators with Local Support

Francis Williams, Daniele Panozzo, Kwang Moo Yi +1

Voronoi diagrams are highly compact representations that are used in various Graphics applications. In this work, we show how to embed a differentiable version of it -- via a novel…

cs.GR2019★ 184 cited

Fast Tetrahedral Meshing in the Wild

Yixin Hu, Teseo Schneider, Bolun Wang +2

We propose a new tetrahedral meshing method, fTetWild, to convert triangle soups into high-quality tetrahedral meshes. Our method builds on the TetWild algorithm, replacing the rat…

cs.HC2019★ 1 cited

Dynamic Drawing Guidance via Electromagnetic Haptic Feedback

Thomas Langerak, Juan Zarate, Velko Vechev +2

We propose a system to deliver dynamic guidance in drawing, sketching and handwriting tasks via an electromagnet moving underneath a high refresh rate pressure sensitive tablet. Th…

cs.LG2019★ 36 cited

Gradient Dynamics of Shallow Univariate ReLU Networks

Francis Williams, Matthew Trager, Claudio Silva +3

We present a theoretical and empirical study of the gradient dynamics of overparameterized shallow ReLU networks with one-dimensional input, solving least-squares interpolation. We…

cs.GR2019★ 4 cited

Unwind: Interactive Fish Straightening

Francis Williams, Alexander Bock, Harish Doraiswamy +5

The ScanAllFish project is a large-scale effort to scan all the world's 33,100 known species of fishes. It has already generated thousands of volumetric CT scans of fish species wh…

math.NA2019★ 70 cited

A Large-Scale Comparison of Tetrahedral and Hexahedral Elements for Solving Elliptic PDEs with the Finite Element Method

Teseo Schneider, Yixin Hu, Xifeng Gao +3

The Finite Element Method (FEM) is widely used to solve discrete Partial Differential Equations (PDEs) in engineering and graphics applications. The popularity of FEM led to the de…

cs.GR2018

ABC: A Big CAD Model Dataset For Geometric Deep Learning

Sebastian Koch, Albert Matveev, Zhongshi Jiang +6

We introduce ABC-Dataset, a collection of one million Computer-Aided Design (CAD) models for research of geometric deep learning methods and applications. Each model is a collectio…