Ming Li 0017

dblp:l/MingLi17 · DBLP profile ↗
← Back
29ranked-venue papers
11as first author
8since 2021 · last 2026
0000-0002-9711-0745ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 27 · 10 first-author · 8 since 2021Theory of computation · 4 · 1 first-authorDatabases, data management, data science and information retrieval · 1Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
YearPublicationVenuePosition
2026 Conditioned Numerical Shape Functions on Unfitted Reduced Coarse Elements for Robust Analysis of Complex Solid Structures
Ming Li 0017
Comput. Aided Des.2
2025 Augmented Sphere Tracing for Real-time Editing Mega-scale Periodic Shell-lattice Structures
Jiajie Guo, Ming Li 0017
Comput. Aided Des.2
2025 Physically reliable 3D styled shape generation via structure-aware topology optimization in unified latent space
Haroon Ijaz, Xuwei Wang, Wei Chen 0001, Hai Lin 0003, Ming Li 0017
Comput. Aided Des.5
2025 Explicit Topology Optimization of Voronoi Foams
abstract
Topology optimization can maximally leverage the high DOFs and mechanical potentiality of porous foams but faces challenges in adapting to free-form outer shapes, maintaining full connectivity between adjacent foam cells, and achieving high simulation accuracy. Utilizing the concept of Voronoi tessellation may help overcome the challenges owing to its distinguished properties on highly flexible topology, natural edge connectivity, and easy shape conforming. However, a variational optimization of the so-called Voronoi foams has not yet been fully explored. In addressing the issue, a concept of explicit topology optimization of open-cell Voronoi foams is proposed that can efficiently and reliably guide the foam's topology and geometry variations under critical physical and geometric requirements. Taking the site (or seed) positions and beam radii as the DOFs, we explore the differentiability of the open-cell Voronoi foams w.r.t. its seed locations, and propose a highly efficient local finite difference method to estimate the derivatives. During the gradient-based optimization, the foam topology can change freely, and some seeds may even be pushed out of shape, which greatly alleviates the challenges of prescribing a fixed underlying grid. The foam's mechanical property is also computed with a much-improved efficiency by an order of magnitude, in comparison with benchmark FEM, via a new material-aware numerical coarsening method on its highly heterogeneous density field counterpart. We show the improved performance of our Voronoi foam in comparison with classical topology optimization approaches and demonstrate its advantages in various settings.
Ming Li 0017, Jingqiao Hu, Wei Chen 0001, Weipeng Kong, Jin Huang 0001
IEEE Trans. Vis. Comput. Graph.1
2023 XVoxel-Based Parametric Design Optimization of Feature Models
Ming Li 0017, Chengfeng Lin, Wei Chen 0036, Yusheng Liu 0006, Shuming Gao, Qiang Zou 0007
Comput. Aided Des.1
2023 Topology driven approximation to rational surface-surface intersection via interval algebraic topology analysis
abstract
Computing the intersection between two parametric surfaces (SSI) is one of the most fundamental problems in geometric and solid modeling. Maintaining the SSI topology is critical to its computation robustness. We propose a topology-driven hybrid symbolic-numeric framework to approximate rational parametric surface-surface intersection (SSI) based on a concept of interval algebraic topology analysis (IATA) , which configures within a 4D interval box the SSI topology. We map the SSI topology to an algebraic system's solutions within the framework, classify and enumerate all topological cases as a mixture of four fundamental cases (or their specific sub-cases). Various complicated topological situations are covered, such as cusp points or curves, tangent points (isolated or not) or curves, tiny loops, self-intersections, or their mixtures. The theoretical formulation is also implemented numerically using advanced real solution isolation techniques, and computed within a topology-driven framework which maximally utilizes the advantages of the topology maintenance of algebraic analysis, the robustness of iterative subdivision, and the efficiency of forward marching. The approach demonstrates improved robustness under benchmark topological cases when compared with available open-source and commercial solutions, including IRIT, SISL, and Parasolid.
Jin-San Cheng, Bingwei Zhang, Yikun Xiao, Ming Li 0017
ACM Trans. Graph.4
2022 Constructing self-supporting structures in biscale topology optimization
Dengyang Zhao, Ting Ting Gu, Yusheng Liu 0006, Shuming Gao, Ming Li 0017
Vis. Comput.5
2021 A novel application framework for self-supporting topology optimization
Dengyang Zhao, Ming Li 0017, Yusheng Liu 0006
Vis. Comput.2
2020 Cellular structure design based on free material optimization under connectivity control
Jingqiao Hu, Ming Li 0017, Xingtong Yang, Shuming Gao
Comput. Aided Des.2
2019 Texture-guided generative structural designs under local control
Jingqiao Hu, Ming Li 0017, Shuming Gao
Comput. Aided Des.2
2019 Free isotropic material optimization via second order cone programming
Xingtong Yang, Ming Li 0017
Comput. Aided Des.2
2018 Discrete multi-material topology optimization under total mass constraint
Xingtong Yang, Ming Li 0017
Comput. Aided Des.2
2016 An ontology-based semantic retrieval approach for heterogeneous 3D CAD models
Fei-wei Qin, Shuming Gao, Ming Li 0017, Jing Bai 0004
Adv. Eng. Informatics4
2016 Direct simulation for CAD models undergoing parametric modifications
Liangchao Zhu, Ming Li 0017, Ralph R. Martin
Comput. Aided Des.2
2016 Skin color modeling for face detection and segmentation: a review and a new approach
Wei Chen 0036, Ming Li 0017
Multim. Tools Appl.4
2013 Engineering analysis error estimation when removing finite-sized features in nonlinear elliptic problems
Ming Li 0017, Shuming Gao, Ralph R. Martin
Comput. Aided Des.1
2012 Adaptive tetrahedral remeshing for modified solid models
Shuming Gao, Ming Li 0017, Wanbin Pan
Graph. Model.3
2011 Estimating defeaturing-induced engineering analysis errors for arbitrary 3D features
Ming Li 0017, Shuming Gao
Comput. Aided Des.1
2011 Estimating the effects of removing negative features on engineering analysis
Ming Li 0017, Shuming Gao, Ralph R. Martin
Comput. Aided Des.1
2010 Detecting design intent in approximate CAD models using symmetry
Ming Li 0017, Frank C. Langbein, Ralph R. Martin
Comput. Aided Des.1
2008 A Comment on "Constructing Regularity Feature Trees for Solid Models"
Frank C. Langbein, Ming Li 0017, Ralph R. Martin
GMP2
2008 Detecting approximate symmetries of discrete point subsets
Ming Li 0017, Frank C. Langbein, Ralph R. Martin
Comput. Aided Des.1
2007 Detecting approximate incomplete symmetries in discrete point sets
abstract
Motivated by the need to detect design intent in approximate boundary representation models, we give an algorithm to detect incomplete symmetries of discrete points, giving the models' potential local symmetries at various automatically detected tolerances. Here, incomplete symmetry is defined as a set of incomplete cycles which are constructed by, e.g., a set of consecutive vertices of an approximately regular polygon, induced by a single isometry. All seven 3D elementary isometries are considered for symmetry detection. Incomplete cycles are first found using a tolerance-controlled point expansion approach. Subsequently, these cycles are clustered for incomplete symmetry detection. The resulting clusters have welldefined, unambiguous approximate symmetries suitable for design intent detection, as demonstrated experimentally.
Ming Li 0017, Frank C. Langbein, Ralph R. Martin
Symposium on Solid and Physical Modeling1
2006 Constructing Regularity Feature Trees for Solid Models
Ming Li 0017, Frank C. Langbein, Ralph R. Martin
GMP1
2006 Quadratic approximation to plane parametric curves and its application in approximate implicitization
Ming Li 0017, Xiao-Shan Gao, Shang-Ching Chou
Vis. Comput.1
2005 Generating Symbolic Interpolants for Scattered Data with Normal Vectors
Ming Li 0017, Xiao-Shan Gao, Jin-San Cheng
J. Comput. Sci. Technol.1
2004 Rational Quadratic Approximation to Real Plane Algebraic Curves
abstract
An algorithm is proposed to give a global approximation to an implicit real plane algebraic curve with rational quadratic B-splines. The algorithm consists of three steps: curve segmentation, segment approximation and curve tracing. The curve is first divided into so-called triangle convex segments. Then each segment is approximated with several rational quadratic Bezier curves. At last, the curve segments are connected into several maximal branches and each branch is represented by a B-spline curve resulting in a C/sup 1/ global parameterization for the curve branch. Due to the detailed geometric analysis, high accuracy of approximation may be achieved with a small number of quadratic segments. The final approximation based on quadratic spline curves keeps many important geometric features and gives a refined topological structure of the original curve.
Xiao-Shan Gao, Ming Li 0017
GMP2
2004 Rational quadratic approximation to real algebraic curves
Xiao-Shan Gao, Ming Li 0017
Comput. Aided Geom. Des.2
2002 Construct Piecewise Hermite Interpolation Surface with Blending Methods
abstract
Three methods are proposed to construct a piecewise Hermite interpolation surface (PHIS), which is a piecewise algebraic surface interpolating a set of given points with associated normal directions. The surface is obtained by blending together some low-degree surface patches. Both the first and the second methods are completely local and give a surface with G/sup n/-continuity. In the third construction, we reduce the number of surface patches by joining as many cubic patches as possible. This method gives a global solution with G/sup 1/-continuity. These three different methods can be used to meet different requirements of the designers.
Xiao-Shan Gao, Ming Li 0017
GMP2