Rahul Narain

Rahul Narain

Auto-generated profile, based on publicly available information

Rahul Narain

Indian Institute of Technology Delhi India

Research Focus & Metrics

Academic Career Length

19Years (2008-Present)

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

Representative Publications

View All Publications
1 November 2012 in ACM Transactions on Graphics
Verified
Journal Article
Open access
RNRahul Narain
Rahul Narain
ASArmin Samii
Armin Samii
JOJames F. O'Brien
James F. O'Brien
We present a technique for cloth simulation that dynamically refines and coarsens triangle meshes so that they automatically conform to the geometric and dynamic detail of the simulated cloth. Our technique produces anisotropic meshes that adapt to surface curvature and velocity gradients, allowing efficient modeling of wrinkles and waves. By anticipating buckling and wrinkle formation, our technique preserves fine-scale dynamic behavior. Our algorithm for adaptive anisotropic remeshing is simple to implement, takes up only a small fraction of the total simulation time, and provides substantial computational speedup without compromising the fidelity of the simulation. We also introduce a novel technique for strain limiting by posing it as a nonlinear optimization problem. This formulation works for arbitrary non-uniform and anisotropic meshes, and converges more rapidly than existing solvers based on Jacobi or Gauss-Seidel iterations.

1 December 2009 in ACM Transactions on Graphics
Verified
Journal Article
Open access
RNRahul Narain
Rahul Narain
AGAbhinav Golas
Abhinav Golas
SCSean Curtis
Sean Curtis
MLMing C. Lin
Ming C. Lin
Large dense crowds show aggregate behavior with reduced individual freedom of movement. We present a novel, scalable approach for simulating such crowds, using a dual representation both as discrete agents and as a single continuous system. In the continuous setting, we introduce a novel variational constraint calledunilateral incompressibility, to model the large-scale behavior of the crowd, and accelerate inter-agent collision avoidance in dense scenarios. This approach makes it possible to simulate very large, dense crowds composed of up to a hundred thousand agents at near-interactive rates on desktop computers.

21 July 2013 in ACM Transactions on Graphics
Verified
Journal Article
Open access
RNRahul Narain
Rahul Narain
TPTobias Pfaff
Tobias Pfaff
JOJames F. O'BRien
James F. O'BRien
We present a technique for simulating plastic deformation in sheets of thin materials, such as crumpled paper, dented metal, and wrinkled cloth. Our simulation uses a framework of adaptive mesh refinement to dynamically align mesh edges with folds and creases. This framework allows efficient modeling of sharp features and avoids bend locking that would be otherwise caused by stiff in-plane behavior. By using an explicit plastic embedding space we prevent remeshing from causing shape diffusion. We include several examples demonstrating that the resulting method realistically simulates the behavior of thin sheets as they fold and crumple.

27 July 2015 in ACM Transactions on Graphics
Verified
Journal Article
Open access
RNRahul Narain
Rahul Narain
RARachel A. Albert
Rachel A. Albert
MBMuhammed Abdullah Bülbül
Muhammed Abdullah Bülbül
GWGregory J. Ward
Gregory J. Ward
MBMartin S. Banks
Martin S. Banks
JOJames F. O'Brien
James F. O'Brien
We present a technique for displaying three-dimensional imagery of general scenes with nearly correct focus cues on multi-plane displays. These displays present an additive combination of images at a discrete set of optical distances, allowing the viewer to focus at different distances in the simulated scene. Our proposed technique extends the capabilities of multi-plane displays to general scenes with occlusions and non-Lambertian effects by using a model of defocus in the eye of the viewer. Requiring no explicit knowledge of the scene geometry, our technique uses an optimization algorithm to compute the images to be displayed on the presentation planes so that the retinal images when accommodating to different distances match the corresponding retinal images of the input scene as closely as possible. We demonstrate the utility of the technique using imagery acquired from both synthetic and real-world scenes, and analyze the system's characteristics including bounds on achievable resolution.

27 July 2014 in ACM Transactions on Graphics
Verified
Journal Article
Open access
TPTobias Pfaff
Tobias Pfaff
RNRahul Narain
Rahul Narain
JJJuan Miguel de Joya
Juan Miguel de Joya
JOJames F. O'BRien
James F. O'BRien
This paper presents a method for adaptive fracture propagation in thin sheets. A high-quality triangle mesh is dynamically restructured to adaptively maintain detail wherever it is required by the simulation. These requirements include refining where cracks are likely to either start or advance. Refinement ensures that the stress distribution around the crack tip is well resolved, which is vital for creating highly detailed, realistic crack paths. The dynamic meshing framework allows subsequent coarsening once areas are no longer likely to produce cracking. This coarsening allows efficient simulation by reducing the total number of active nodes and by preventing the formation of thin slivers around the crack path. A local reprojection scheme and a substepping fracture process help to ensure stability and prevent a loss of plasticity during remeshing. By including bending and stretching plasticity models, the method is able to simulate a large range of materials with very different fracture behaviors.

21 July 2013 in ACM Transactions on Graphics
Verified
Journal Article
Open access
DKDoyub Kim
Doyub Kim
WKWoojong Koh
Woojong Koh
RNRahul Narain
Rahul Narain
KFKayvon Fatahalian
Kayvon Fatahalian
ATAdrien Treuille
Adrien Treuille
JOJames F. O'BRien
James F. O'BRien
The central argument against data-driven methods in computer graphics rests on the curse of dimensionality: it is intractable to precompute "everything" about a complex space. In this paper, we challenge that assumption by using several thousand CPU-hours to perform a massive exploration of the space of secondary clothing effects on a character animated through a large motion graph. Our system continually explores the phase space of cloth dynamics, incrementally constructing a secondary cloth motion graph that captures the dynamics of the system. We find that it is possible to sample the dynamical space to a low visual error tolerance and that secondary motion graphs containing tens of gigabytes of raw mesh data can be compressed down to only tens of megabytes. These results allow us to capture the effect of high-resolution, off-line cloth simulation for a rich space of character motion and deliver it efficiently as part of an interactive application.