Xuan Li

Xuan Li
University of California, Los Angeles | UCLA · Department of Mathematics

Master of Science

About

10
Publications
3,791
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
48
Citations
Additional affiliations
September 2019 - May 2020
University of Pennsylvania
Position
  • Research Intern
May 2019 - November 2019
Adobe Inc.
Position
  • Deep Learning Research Intern
September 2017 - May 2018
Stony Brook University
Position
  • Research Assistant
Education
September 2020 - June 2025
University of Pennsylvania
Field of study
  • Computer Science
September 2017 - May 2020
Stony Brook University
Field of study
  • Computer Science
September 2013 - June 2017
Tsinghua University
Field of study
  • Methematics

Publications

Publications (10)
Preprint
Contact-aware topology optimization faces challenges in robustness, accuracy, and applicability to internal structural surfaces under self-contact. This work builds on the recently proposed barrier-based Incremental Potential Contact (IPC) model and presents a new self-contact-aware topology optimization framework. A combination of SIMP, adjoint se...
Article
This paper introduces BFEMP, a new approach for monolithically coupling the Material Point Method (MPM) with the Finite Element Method (FEM) through barrier energy-based particle–mesh frictional contact using a variational time-stepping formulation. The fully implicit time integration of the coupled system is recast into a barrier-augmented unconst...
Preprint
Full-text available
This paper introduces BFEMP, a new approach for monolithically coupling the Material Point Method (MPM) with the Finite Element Method (FEM) through barrier energy-based particle-mesh frictional contact using a variational time-stepping formulation. The fully implicit time integration of the coupled system is recast into a barrier-augmented unconst...
Article
Full-text available
In this paper, a hybrid Lagrangian‐Eulerian topology optimization (LETO) method is proposed to solve the elastic force equilibrium with the Material Point Method (MPM). LETO transfers density information from freely movable Lagrangian carrier particles to a fixed set of Eulerian quadrature points. The transfer is based on a smooth radial kernel inv...
Preprint
Full-text available
In this paper, a hybrid Lagrangian-Eulerian topology optimization (LETO) method is proposed to solve the elastic force equilibrium with the Material Point Method (MPM). LETO transfers density information from freely movable Lagrangian carrier particles to a fixed set of Eulerian quadrature points. The transfer is based on a smooth radial kernel inv...
Preprint
Full-text available
Unmanned aerial vehicles have been demonstrated successfully in a variety of tasks, including surveying and sampling tasks over large areas. These vehicles can take many forms. Quadrotors' agility and ability to hover makes them well suited for navigating potentially tight spaces, while fixed wing aircraft are capable of efficient flight over long...
Article
Full-text available
There are many methods proposed for generating polycube polyhedrons, but it lacks the study about the possibility of generating polycube polyhedrons. In this paper, we prove a theorem for characterizing the necessary condition for the skeleton graph of a polycube polyhedron, by which Steinitz's theorem for convex polyhedra and Eppstein's theorem fo...
Article
In this paper, we introduce discrete Calabi flow to the graphics research community and present a novel conformal mesh parameterization algorithm. Calabi energy has a succinct and explicit format. Its corresponding flow is conformal and convergent under certain conditions. Our method is based on the Calabi energy and Calabi flow with solid theoreti...
Article
Full-text available
Polycube construction and deformation are essential problems in computer graphics. In this paper, we present a robust, simple, efficient, and automatic algorithm to deform the meshes of arbitrary shapes into polycube form. We derive a clear relationship between a mesh and its corresponding polycube shape. Our algorithm is edge-preserving, and works...

Network

Cited By