Tianchang Shen

Tianchang Shen

Auto-generated profile, based on publicly available information

Tianchang Shen

Nvidia, Toronto, Canada

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
26 July 2023 in ACM Transactions on Graphics
Verified
Journal Article
Open access
TSTianchang Shen
Tianchang Shen
JMJacob Munkberg
Jacob Munkberg
JHJon Hasselgren
Jon Hasselgren
KYKangxue Yin
Kangxue Yin
ZWZian Wang
Zian Wang
JGJun Gao
Jun Gao
This work considers gradient-based mesh optimization, where we iteratively optimize for a 3D surface mesh by representing it as the isosurface of a scalar field, an increasingly common paradigm in applications including photogrammetry, generative modeling, and inverse physics. Existing implementations adapt classic isosurface extraction algorithms like Marching Cubes or Dual Contouring; these techniques were designed to extract meshes from fixed, known fields, and in the optimization setting they lack the degrees of freedom to represent high-quality feature-preserving meshes, or suffer from numerical instabilities. We introduce FlexiCubes, an isosurface representation specifically designed for optimizing an unknown mesh with respect to geometric, visual, or even physical objectives. Our main insight is to introduce additional carefully-chosen parameters into the representation, which allow local flexible adjustments to the extracted mesh geometry and connectivity. These parameters are updated along with the underlying scalar field via automatic differentiation when optimizing for a downstream task. We base our extraction scheme on Dual Marching Cubes for improved topological properties, and present extensions to optionally generate tetrahedral and hierarchically-adaptive meshes. Extensive experiments validate FlexiCubes on both synthetic benchmarks and real-world applications, showing that it offers significant improvements in mesh quality and geometric fidelity.

5 December 2023 in ACM Transactions on Graphics
Verified
Journal Article
Open access
ZWZian Wang
Zian Wang
TSTianchang Shen
Tianchang Shen
MNMerlin Nimier-David
Merlin Nimier-David
NSNicholas Sharp
Nicholas Sharp
JGJun Gao
Jun Gao
ZGZan Gojcic
Zan Gojcic
Neural radiance fields achieve unprecedented quality for novel view synthesis, but their volumetric formulation remains expensive, requiring a huge number of samples to render high-resolution images. Volumetric encodings are essential to represent fuzzy geometry such as foliage and hair, and they are well-suited for stochastic optimization. Yet, many scenes ultimately consist largely of solid surfaces which can be accurately rendered by a single sample per pixel. Based on this insight, we propose a neural radiance formulation that smoothly transitions between volumetric- and surface-based rendering, greatly accelerating rendering speed and even improving visual fidelity. Our method constructs an explicit mesh envelope which spatially bounds a neural volumetric representation. In solid regions, the envelope nearly converges to a surface and can often be rendered with a single sample. To this end, we generalize the NeuS [Wang et al. 2021] formulation with a learned spatially-varying kernel size which encodes the spread of the density, fitting a wide kernel to volume-like regions and a tight kernel to surface-like regions. We then extract an explicit mesh of a narrow band around the surface, with width determined by the kernel size, and fine-tune the radiance field within this band. At inference time, we cast rays against the mesh and evaluate the radiance field only within the enclosed region, greatly reducing the number of samples required. Experiments show that our approach enables efficient rendering at very high fidelity. We also demonstrate that the extracted envelope enables downstream applications such as animation and simulation.

3 December 2024
Verified
Conference Paper
Open access
TSTianchang Shen
Tianchang Shen
ZLZhaoshuo Li
Zhaoshuo Li
MLMarc Law
Marc Law
MAMatan Atzmon
Matan Atzmon
SFSanja Fidler
Sanja Fidler
NSNicholas Sharp
Nicholas Sharp

17 April 2025 in ACM Transactions on Graphics
Verified
Journal Article
Open access
GDGilles Daviet
Gilles Daviet
TSTianchang Shen
Tianchang Shen
NSNicholas Sharp
Nicholas Sharp
DLDavid I.W. Levin
David I.W. Levin
We present an elastic simulator for domains defined as evolving implicit functions, which is efficient, robust, and differentiable with respect to both shape and material. This simulator is motivated by applications in 3D reconstruction: it is increasingly effective to recover geometry from observed images as implicit functions, but physical applications require accurately simulating and optimizing-for the behavior of such shapes under deformation, which has remained challenging. Our key technical innovation is to train a small neural network to fit quadrature points for robust numerical integration on implicit grid cells. When coupled with a Mixed Finite Element formulation, this yields a smooth, fully differentiable simulation model connecting the evolution of the underlying implicit surface to its elastic response. We demonstrate the efficacy of our approach on forward simulation of implicits, direct simulation of 3D shapes during editing, and novel physics-based shape and topology optimizations in conjunction with differentiable rendering.

19 July 2026
Verified
Conference Paper
Open access
RLRiccardo De Lutio
Riccardo De Lutio
TFTobias Fischer
Tobias Fischer
YCYen-Yu Chang
Yen-Yu Chang
YZYuxuan Zhang
Yuxuan Zhang
ZWZhangjie Wu
Zhangjie Wu
HTHaithem Turki
Haithem Turki

10 August 2023 in arXiv
Verified
Preprint
Open access
PDF file
TSTianchang Shen
Tianchang Shen
JMJacob Munkberg
Jacob Munkberg
JHJon Hasselgren
Jon Hasselgren
KYKangxue Yin
Kangxue Yin
ZWZian Wang
Zian Wang
JGJun Gao
Jun Gao
This work considers gradient-based mesh optimization, where we iteratively optimize for a 3D surface mesh by representing it as the isosurface of a scalar field, an increasingly common paradigm in applications including photogrammetry, generative modeling, and inverse physics. Existing implementations adapt classic isosurface extraction algorithms like Marching Cubes or Dual Contouring; these techniques were designed to extract meshes from fixed, known fields, and in the optimization setting they lack the degrees of freedom to represent high-quality feature-preserving meshes, or suffer from numerical instabilities. We introduce FlexiCubes, an isosurface representation specifically designed for optimizing an unknown mesh with respect to geometric, visual, or even physical objectives. Our main insight is to introduce additional carefully-chosen parameters into the representation, which allow local flexible adjustments to the extracted mesh geometry and connectivity. These parameters are updated along with the underlying scalar field via automatic differentiation when optimizing for a downstream task. We base our extraction scheme on Dual Marching Cubes for improved topological properties, and present extensions to optionally generate tetrahedral and hierarchically-adaptive meshes. Extensive experiments validate FlexiCubes on both synthetic benchmarks and real-world applications, showing that it offers significant improvements in mesh quality and geometric fidelity.