Ming Li's Homepage

Publications



Detecting Design Intent in Approximate CAD Models using Symmetry

M. Li, F. Langbein, R. Martin
Submitted to Computer-Aided Design.



Figure: Flowchat for detecting design intent on an approximate model.

Abstract: Finding design intent embodied as high-level geometric relations between a CAD model's sub-parts facilitates various tasks such as model editing and analysis. This is especially important for boundary-representation models arising from e.g. reverse engineering or CAD data transfer. These lack explicit information about design intent, and often, the intended geometric relations are only approximately present. We give a novel solution to this problem based on detecting approximate local incomplete symmetries, in a hierarchical decomposition of the model into simpler, more symmetric sub-parts. Design intent is detected as congruencies, symmetries and symmetric arrangements of the leaf-parts in this decomposition. All elementary 3D symmetry types are considered. They may be present only locally in subsets of the leaf-parts, and may also be incomplete, i.e. not all elements required for a symmetry need be present. Adaptive tolerance intervals are used for matching inter-point distances, enabling efficient, robust and consistent detection of approxi- mate symmetries. Doing so avoids finding many spurious relations, reliably resolves ambiguities between relations, and reduces inconsistencies. Experiments show that detected relations reveal significant design intent.



Detecting approximate symmetries of discrete point subsets
M. Li, F. Langbein, R. Martin
Computer-Aided Design, 40(1),76-93,2008

     

Figure: symmetries detected by our algorithm
Left: approximate local symmetries detected on a 4X4 grid disturbed by other 20 random points
Middle: a mechanical object MISUFA
Right: incomplete symmetries detected from the characteristic points extracted from from the MISUFA model

Abstract: Detecting approximate symmetries of parts of a model is important when attempting to determine the geometrical design intent of approximate boundary-representation (B-rep) solid models produced e.g. by reverse engineering systems. For example, such detected symmetries may be enforced exactly on the model to improve its shape, to simplify its analysis, or to constrain it during editing. We give an algorithm to detect local approximate symmetries in a discrete point set derived from a B-rep model: the output comprises the model’s potential local symmetries at various automatically detected tolerance levels. Non-trivial symmetries of subsets of the point set are found as unambiguous permutation cycles, i.e. vertices of an approximately regular polygon or an anti-prism, which are sufficiently separate from other points in the point set. The symmetries are detected using a rigorous, tolerance-controlled, incremental approach, which expands symmetry seed sets by one point at a time. Our symmetry cycle detection approach only depends on inter-point distances. The algorithm takes time O(n4) where n is the number of input points. Results produced by our algorithm are demonstrated using a variety of examples.



Rational Quadratic Approximation to Real Algebraic Curves
Xiao-Shan Gao, Ming Li
Computer Aided Geometric Design, 21,805-828,2004

   

Figure: results of rational quadratic approximation for a quatic algebraic curve (topologies of original curves are preserved).
Left: our approximation result (tolerance bound 0.003; segment number: 8).
Middle: (Xu and Bajaj, 1997)'s approximation result (tolerance bound: 0.1; segment number: 34).
Right: approximation result of a spacial algebraic curve (intersection of two algebraic surfaces) of degree 8 under tolerance bound 0.1.






Abstract: An algorithm is proposed to give a global approximation of an implicit real plane algebraic curve with rational quadratic B-spline curves. The algorithm consists of four steps: topology determination, curve segmentation, segment approximation and curve tracing. Due to the detailed geometric analysis, high accuracy of approximation may be achieved with a small number of quadratic segments. The final approximation keeps many important geometric features of the original curve such as the topology, convexity and sharp points. Our method is implemented and experiments show that it may achieve better approximation bound with less segments than previously known methods. We also extend the method to approximate spatial algebraic curves.


Generating Symbolic Interpolant for Scattered Data with Normal Vectors
Ming Li, Xiao-Shan Gao, Jin-San Cheng
Journal of Computer Science & Technology, 20(6):861-874, 2005







 




Figure: illustration of constructing pre-interpolants, whose convex combination is our desired interpolant.
Left: construct boundary curves interpolating every pair of adjacent points with associated normal directions.
Middel: construct normal curves that interpolate adjacent boundary normals and is normal to the boundary curve tangents.
Right: construct a pre-interpolant that interpolates the two boundary curves with associated normal curves.











Figure: a constructed interpolant for the head model. Left: the triangular mesh; Middle: boundary curves; Right 2: an interpolant

Abstract: Algorithms to generate a triangular or a quadrilateral interpolant with G1-continuity are given in this paper for arbitrary scattered data with associated normal vectors over a prescribed triangular or quadrilateral decomposition. The interpolants are constructed with a general method to generate surfaces from moving B?ezier curves under geometric constraints. With the algorithm, we may obtain interplants in complete symbolic parametric forms, leading to a fast computation of the interpolant. A dynamic interpolation solid modelling software package DISM is implemented based on the algorithm which can be used to generate and manipulate solid objects in an interactive way.




Applying model simplification techniques to accelerate dynamic simulation
M. Li, W. Regli
To be submitted



Figure: roles of dynamic simulation and model simplification in a product design process.

Abstract: Dynamic simulation allows us to investigate, design, visualize, and test a mechanical object even before its real construction, and avoids unnecessary changes occurred in design and unnecessary injuries and damages. However, it is limited by the slow simulation speed due to the complex geometry of mechanical objects. Model simplification is expected to resolve the issue, but previous simplification method cannot be directly applied here --- they are usually geometry-based rather than directly physics-based, and hence are hard to well preserve the original model's dynamic behavior. Furthermore, no explicit fidelity measure is introduced to measure the dynamics difference between the original model and its simplification.

This paper aims to construct a physics-based simplified model for improving dynamics simulation. It is achieved by analyzing the essential factors in determining the dynamic performance of a simulated object: inertia matrix, collision detection, joints and mechanical constraints. The model is simplified based on this by trying to keep these key factors in the simplified model while ignoring other un-essential factors. Method to analyze the dynamic fidelity of the simplified model is also introduced. To our best knowledge, the proposed method is the first in constructing a physics-based simplified model to accelerate dynamic simulation and analyze its fidelity. Experimental results of an illustrative example, snake robot, is also shown to demonstrate our algorithm's performance.






List of Publications

           
Impact Factors are referred to here.

M. Li, F. Langbein, R. Martin, Detecting approximate symmetries of discrete point subsets, Computer-Aided Design, 40(1):76-93, 2008.

M. Li, F. Langbein, R. Martin, A Comment on 'Constructing Regularity Feature Trees for Solid Models', Proc. IEEE Geometric Modeling and Processing, LNCS 4975, 2008.

M. Li, F. Langbein, R. Martin, Detecting approximate incomplete symmetries in discrete point sets, ACM Solid and Physical Modeling, 2007.

M. Li, X. Gao, S. Chou, Rational quadratic approximation to plane parametric curves and its applications in appr. implicitization, The Visual Computer , 22(9-11):906-917, 2006.

J. Cheng, X. Gao, M. Li, Determining the topology of real algebraic surfaces, Mathematics of Surfaces XI, LNCS 3604:121-146, 2006.

M. Li, F. Langbein, R. Martin, Constructing regularity feature trees for solid models, Proc. IEEE Geometric Modeling and Processing, LNCS 4077, 2006.

M. Li, X. Gao, J. Cheng, Generating symbolic interpolants for scattered data with normal vector, Journal of Computer Science & Technology, 20(6):861-874, 2005.

X. Gao, M. Li., Rational quadratic approximation to real algebraic curves, Computer Aided Geometric Design , 21(8):805-828, 2004.

X. Gao, M. Li., Rational quadratic approximation to real plane algebraic curves Proc. IEEE Geometric Modeling and Processing, 93-102, 2004.

X. Gao, M. Li., Construct piecewise Hermite interpolation surface with blending methods, Proc. IEEE Geometric Modeling and Processing, 53-59, 2002.

M. Li, F. Langbein, R. Martin, Detecting design intent in approximate CAD models using symmetry, Submitted to Computer-Aided Design.

M. Li, W. Regli, Applying model simplification techniques to accelerate dynamic simulation, To be submitted.

M. Li, W. Regli, Motion planning of snake robot on rough terrains, In preparation.


           








Attachments (5)

  • ApproximateSymmetry-CAD08.pdf - on Oct 12, 2008 3:04 PM by Ming Li (version 3 / earlier versions)
    2061k View Download
  • CurveApproximation-CAGD04.pdf - on Oct 12, 2008 3:04 PM by Ming Li (version 1)
    637k View Download
  • DesignIntent-CAD08.pdf - on Oct 12, 2008 3:04 PM by Ming Li (version 3 / earlier versions)
    2113k View Download
  • Interpolation-JCST05.pdf - on Oct 12, 2008 3:05 PM by Ming Li (version 1)
    746k View Download
  • ParametricApproximation-TVC06.pdf - on Oct 12, 2008 3:04 PM by Ming Li (version 1)
    465k View Download