R
Ramsharan Rangarajan
Researcher at Indian Institute of Science
Publications - 22
Citations - 291
Ramsharan Rangarajan is an academic researcher from Indian Institute of Science. The author has contributed to research in topics: Polygon mesh & Computer science. The author has an hindex of 10, co-authored 21 publications receiving 251 citations. Previous affiliations of Ramsharan Rangarajan include Stanford University & Brown University.
Papers
More filters
Journal ArticleDOI
Universal meshes: A method for triangulating planar curved domains immersed in nonconforming meshes
TL;DR: A new method to triangulate planar, curved domains that transforms a specific collection of triangles in a background mesh to conform to the boundary, which can render both straight‐edged and curvilinear triangulations for the immersed domain.
Journal ArticleDOI
Simulating curvilinear crack propagation in two dimensions with universal meshes
Ramsharan Rangarajan,Maurizio M. Chiaramonte,Michael J. Hunsweck,Yongxing Shen,Yongxing Shen,Adrian J. Lew +5 more
TL;DR: In this paper, the authors formulate a class of delicately controlled problems to model the kink-free evolution of quasistatic cracks in brittle, isotropic, linearly elastic materials in two dimensions.
Journal ArticleDOI
A discontinuous-Galerkin-based immersed boundary method with non-homogeneous boundary conditions and its application to elasticity
TL;DR: Detailed two- and three-dimensional numerical experiments verify that the proposed discontinuous-Galerkin-based immersed boundary method for elasticity problems leads to optimal convergence rates under combinations of essential and natural boundary conditions.
Journal ArticleDOI
A finite element method to compute three-dimensional equilibrium configurations of fluid membranes
Ramsharan Rangarajan,Huajian Gao +1 more
TL;DR: A systematic algorithm for computing large deformations, wherein solutions at subsequent load steps are identified as perturbations of previously computed ones, and a Galerkin finite element method is used to compute discrete C 1 approximations of the normal offset coordinate.
Posted Content
Universal Meshes: A new paradigm for computing with nonconforming triangulations
TL;DR: A method for discretizing planar C2-regular domains immersed in non-conforming triangulations by constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the immersed domain.