Vismay Modi

Vismay Modi

Auto-generated profile, based on publicly available information

Vismay Modi

NVIDIA, Texas, USA

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

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

Representative Publications

View All Publications
19 July 2024 in ACM Transactions on Graphics
Verified
Journal Article
Open access
VMVismay Modi
Vismay Modi
NSNicholas Sharp
Nicholas Sharp
OPOr Perel
Or Perel
SSShinjiro Sueda
Shinjiro Sueda
DLDavid I. W. Levin
David I. W. Levin
The proliferation of 3D representations, from explicit meshes to implicit neural fields and more, motivates the need for simulators agnostic to representation. We present a data-, mesh-, and grid-free solution for elastic simulation for any object in any geometric representation undergoing large, nonlinear deformations. We note that every standard geometric representation can be reduced to an occupancy function queried at any point in space, and we define a simulator atop this common interface. For each object, we fit a small implicit neural network encoding spatially varying weights that act as a reduced deformation basis. These weights are trained to learn physically significant motions in the object via random perturbations. Our loss ensures we find a weight-space basis that best minimizes deformation energy by stochastically evaluating elastic energies through Monte Carlo sampling of the deformation volume. At runtime, we simulate in the reduced basis and sample the deformations back to the original domain. Our experiments demonstrate the versatility, accuracy, and speed of this approach on data including signed distance functions, point clouds, neural primitives, tomography scans, radiance fields, Gaussian splats, surface meshes, and volume meshes, as well as showing a variety of material energies, contact models, and time integration schemes.

28 December 2020 in Computer Graphics Forum
Verified
Journal Article
Closed access
PDF file
VMV. Modi
V. Modi
LFL. Fulton
L. Fulton
AJA. Jacobson
A. Jacobson
SSShinjiro Sueda
Shinjiro Sueda
DLD.I.W. Levin
D.I.W. Levin

10 December 2023
Verified
Conference Paper
Open access
RZRyan S. Zesch
Ryan S. Zesch
VMVismay Modi
Vismay Modi
SSShinjiro Sueda
Shinjiro Sueda
DLDavid I.W. Levin
David I.W. Levin
We present neural collision fields as an alternative to contact point sampling in physics simulations. Our approach is built on top of a novel smoothed integral formulation for the contact surface patches between two triangle meshes. By reformulating collisions as an integral, we avoid issues of sampling common to many collision-handling algorithms. Because the resulting integral is difficult to evaluate numerically, we store its solution in an integrated neural collision field — a 6D neural field in the space of triangle pair vertex coordinates. Our network generalizes well to new triangle meshes without retraining. We demonstrate the effectiveness of our method by implementing it as a constraint in a position-based dynamics framework and show that our neural formulation successfully handles collisions in practical simulations involving both volumetric and thin-shell geometries.

28 February 2023 in Computer Graphics Forum
Verified
Journal Article
Open access
VMV. Modi
V. Modi
YCY. Chen
Y. Chen
AMA. Madan
A. Madan
SSS. Sueda
S. Sueda
DLD. I. W. Levin
D. I. W. Levin
By starting with the assumption that motion is fundamentally a decision making problem, we use the world‐line concept from Special Relativity as the inspiration for a novel multi‐agent path planning method. We have identified a particular set of problems that have so far been overlooked by previous works. We present our solution for the global path planning problem for each agent and ensure smooth local collision avoidance for each pair of agents in the scene. We accomplish this by modelling the collision‐free trajectories of the agents through 2D space and time as rods in 3D. We obtain smooth trajectories by solving a non‐linear optimization problem with a quasi‐Newton interior point solver, initializing the solver with a non‐intersecting configuration from a modified Dijkstra's algorithm. This space–time formulation allows us to simulate previously ignored phenomena such as highly heterogeneous interactions in very constrained environments. It also provides a solution for scenes with unnaturally symmetric agent alignments without the need for jittering agent positions or velocities.


20 October 2025
Verified
Book Chapter
Closed access
PDF file
SKSarah Kushner
Sarah Kushner
VMVismay Modi
Vismay Modi
NMNina Miolane
Nina Miolane