Minghua Liu
Research Subjects
Minghua Liu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Hao Su
University of California San Diego, San Diego, USA
5 shared publications - Ruoxi Shi
University of California San Diego, San Diego, USA
4 shared publications - Xinyue Wei
University of California San Diego, La Jolla, USA
4 shared publications - Fanbo Xiang
Sudo GmbH, La Jolla, USA
2 shared publications - Xiaoshuai Zhang
Hillbot, Sunnyvale, USA
2 shared publications - Chuhao Chen
University of Pennsylvania, Philadelphia, USA
1 shared publication
Latest Publications
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
LARM: A Large Articulated Object Reconstruction Model
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessLARM: A Large Articulated Object Reconstruction Model
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
PartUV: Part-Based UV Unwrapping of 3D Meshes
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessPartUV: Part-Based UV Unwrapping of 3D Meshes
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-13
FreeArt3D: Training-Free Articulated Object Generation using 3D Diffusion
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-13
Open AccessFreeArt3D: Training-Free Articulated Object Generation using 3D Diffusion
- 11 October 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (7)
PaMO: Parallel Mesh Optimization for Intersection‐Free Low‐Poly Modeling on the GPU
Reducing the triangle count in complex 3D models is a basic geometry preprocessing step in graphics pipelines such as efficient rendering and interactive editing. However, most existing mesh simplification methods exhibit a few issues. Firstly, they often lead to self‐intersections during decimation, a major issue for applications such as 3D printing and soft‐body simulation. Second, to perform simplification on a mesh in the wild, one would first need to perform re‐meshing, which often suffers from surface shifts and losses of sharp features. Finally, existing re‐meshing and simplification methods can take minutes when processing large‐scale meshes, limiting their applications in practice. To address the challenges, we introduce a novel GPU‐based mesh optimization approach containing three key components: (1) a parallel re‐meshing algorithm to turn meshes in the wild into watertight, manifold, and intersection‐free ones, and reduce the prevalence of poorly shaped triangles; (2) a robust parallel simplification algorithm with intersection‐free guarantees; (3) an optimization‐based safe projection algorithm to realign the simplified mesh with the input, eliminating the surface shift introduced by re‐meshing and recovering the original sharp features. The algorithm demonstrates remarkable efficiency, simplifying a 2‐million‐face mesh to 20k triangles in 3 seconds on RTX4090. We evaluated the approach on the Thingi10K dataset and showcased its exceptional performance in geometry preservation and speed. https://seonghunn.github.io/pamo/
- 11 October 2025
- Published by Wiley in Computer Graphics Forum
- Vol. 44 (7)
PaMO: Parallel Mesh Optimization for Intersection‐Free Low‐Poly Modeling on the GPU
Reducing the triangle count in complex 3D models is a basic geometry preprocessing step in graphics pipelines such as efficient rendering and interactive editing. However, most existing mesh simplification methods exhibit a few issues. Firstly, they often lead to self‐intersections during decimation, a major issue for applications such as 3D printing and soft‐body simulation. Second, to perform simplification on a mesh in the wild, one would first need to perform re‐meshing, which often suffers from surface shifts and losses of sharp features. Finally, existing re‐meshing and simplification methods can take minutes when processing large‐scale meshes, limiting their applications in practice. To address the challenges, we introduce a novel GPU‐based mesh optimization approach containing three key components: (1) a parallel re‐meshing algorithm to turn meshes in the wild into watertight, manifold, and intersection‐free ones, and reduce the prevalence of poorly shaped triangles; (2) a robust parallel simplification algorithm with intersection‐free guarantees; (3) an optimization‐based safe projection algorithm to realign the simplified mesh with the input, eliminating the surface shift introduced by re‐meshing and recovering the original sharp features. The algorithm demonstrates remarkable efficiency, simplifying a 2‐million‐face mesh to 20k triangles in 3 seconds on RTX4090. We evaluated the approach on the Thingi10K dataset and showcased its exceptional performance in geometry preservation and speed. https://seonghunn.github.io/pamo/
- Open Access
PaMO: Parallel Mesh Optimization for Intersection-Free Low-Poly Modeling on the GPU
Reducing the triangle count in complex 3D models is a basic geometry preprocessing step in graphics pipelines such as efficient rendering and interactive editing. However, most existing mesh simplification methods exhibit a few issues. Firstly, they often lead to self-intersections during decimation, a major issue for applications such as 3D printing and soft-body simulation. Second, to perform simplification on a mesh in the wild, one would first need to perform re-meshing, which often suffers from surface shifts and losses of sharp features. Finally, existing re-meshing and simplification methods can take minutes when processing large-scale meshes, limiting their applications in practice. To address the challenges, we introduce a novel GPU-based mesh optimization approach containing three key components: (1) a parallel re-meshing algorithm to turn meshes in the wild into watertight, manifold, and intersection-free ones, and reduce the prevalence of poorly shaped triangles; (2) a robust parallel simplification algorithm with intersection-free guarantees; (3) an optimization-based safe projection algorithm to realign the simplified mesh with the input, eliminating the surface shift introduced by re-meshing and recovering the original sharp features. The algorithm demonstrates remarkable efficiency, simplifying a 2-million-face mesh to 20k triangles in 3 seconds on RTX4090. We evaluated the approach on the Thingi10K dataset and showcased its exceptional performance in geometry preservation and speed.
Open AccessPaMO: Parallel Mesh Optimization for Intersection-Free Low-Poly Modeling on the GPU
Reducing the triangle count in complex 3D models is a basic geometry preprocessing step in graphics pipelines such as efficient rendering and interactive editing. However, most existing mesh simplification methods exhibit a few issues. Firstly, they often lead to self-intersections during decimation, a major issue for applications such as 3D printing and soft-body simulation. Second, to perform simplification on a mesh in the wild, one would first need to perform re-meshing, which often suffers from surface shifts and losses of sharp features. Finally, existing re-meshing and simplification methods can take minutes when processing large-scale meshes, limiting their applications in practice. To address the challenges, we introduce a novel GPU-based mesh optimization approach containing three key components: (1) a parallel re-meshing algorithm to turn meshes in the wild into watertight, manifold, and intersection-free ones, and reduce the prevalence of poorly shaped triangles; (2) a robust parallel simplification algorithm with intersection-free guarantees; (3) an optimization-based safe projection algorithm to realign the simplified mesh with the input, eliminating the surface shift introduced by re-meshing and recovering the original sharp features. The algorithm demonstrates remarkable efficiency, simplifying a 2-million-face mesh to 20k triangles in 3 seconds on RTX4090. We evaluated the approach on the Thingi10K dataset and showcased its exceptional performance in geometry preservation and speed.