scispace - formally typeset
M

Mark S. Shephard

Researcher at Rensselaer Polytechnic Institute

Publications -  308
Citations -  9806

Mark S. Shephard is an academic researcher from Rensselaer Polytechnic Institute. The author has contributed to research in topics: Finite element method & Mesh generation. The author has an hindex of 48, co-authored 292 publications receiving 9223 citations. Previous affiliations of Mark S. Shephard include Johns Hopkins University.

Papers
More filters
Journal ArticleDOI

Automatic three‐dimensional mesh generation by the finite octree technique

TL;DR: An octree-based fully automatic three-dimensional mesh generator is presented, capable of meshing non-manifold models of arbitrary geometric complexity through the explicit tracking and enforcement of geometric compatibility and geometric similarity at each step of the meshing process.
Journal ArticleDOI

Computational plasticity for composite structures based on mathematical homogenization: Theory and practice

TL;DR: In this article, the authors generalize the classical mathematical homogenization theory for heterogeneous medium to account for eigenstrains and derive a close form expression relating arbitrary eigen-strains to the mechanical fields in the phases.
Journal ArticleDOI

A Modified Quadtree Approach To Finite Element Mesh Generation

TL;DR: By allowing the use of quadrants with cut corners, this modeling technique overcomes some of the drawbacks of standard quadtree encoding for finite element mesh generation.
Journal ArticleDOI

Multiphysics simulations: Challenges and opportunities

TL;DR: This study considers multiphysics applications from algorithmic and architectural perspectives, where “algorithmic” includes both mathematical analysis and computational complexity, and “architectural’ includes both software and hardware environments.
Journal ArticleDOI

Robust, geometrically based, automatic two‐dimensional mesh generation

TL;DR: The algorithmic changes made do ensure the robustness of the approach, but introduce additional algorithmic difficulties, the solutions of which are also presented.