Advertisement

Journal of Computer Science and Technology

, Volume 17, Issue 3, pp 314–323 | Cite as

Singularity analysis of geometric constraint systems

  • Peng Xiaobo Email author
  • Chen Liping 
  • Zhou Fanli 
  • Zhou Ji 
Correspondence

Abstract

Singularity analysis is an important subject of the geometric constraint satisfaction problem. In this paper, three kinds of singularities are described and corresponding identification methods are presented for both under-constrained systems and over-constrained systems. Another special but common singularity for under-constrained geometric systems, pseudo-singularity, is analyzed. Pseudo-singularity is caused by a variety of constraint matching of under-constrained systems and can be removed by improving constraint distribution. To avoid pseudo-singularity and decide redundant constraints adaptively, a diferentiation algorithm is proposed in the paper. Its correctness and efficiency have been validated through its practical applications in a 2D/3D geometric constraint solver CBA.

Keywords

geometric constraint satisfaction parametric design singularity redundant constraint pseudo-singularity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Light R, Lin V, Gossard D. Variational geometry in CAD.Computer Graphics, 1981, 15 (3): 171–177.CrossRefGoogle Scholar
  2. [2]
    Kramer G A. A geometric constraint engine.Artificial Intelligence, 1992, 58: 327–360.CrossRefMathSciNetGoogle Scholar
  3. [3]
    Chen Liping, Zhou Ji. Research of geometric constraint system reasoning.Journal of Huazhong Univ. of Sci & Tech, 1995, 6: 70–74. (in Chinese)Google Scholar
  4. [4]
    Dong Jinxiang. A new thought of constraint solving in variable drawing systems.Journal of Computer-Aided Design & Computer Graphics, 1997, 9(6): 513–519. (in Chinese)Google Scholar
  5. [5]
    Jae Yael Lee, Kwangsoo Kim. A 2-D geometric constraint solver using DOF-based graph reduction.Computer-Aided Design, 1998, 30(11): 883–896.zbMATHCrossRefGoogle Scholar
  6. [6]
    Gao Xiaoshan, Chou Shangching. Solving geometric constraint systems. Part II, A symbolic approach and decision of Re-constructibility.Computer-Aided Design, 1998, 30(20): 115–122.Google Scholar
  7. [7]
    Wang Boxing, Chen Liping, Zhou Ji. Study and practice of key technologies of geometric constraint driven function in traditional drafting systems.Computer Research & Development, 1998, 35(10): 935–940. (in Chinese)Google Scholar
  8. [8]
    Chen Liping, Wang Boxing. An optimal method of bipartite graph matching for underconstrained geometry solving.Chinese Journal of Computers, May, 2000, 23(5): 523–530. (in Chinese).MathSciNetGoogle Scholar
  9. [9]
    Haug E J. Computer Aided Kinematics and Dynamics of Mechanical Systems. Allyn and Bacon, Vol.I, 1989.Google Scholar
  10. [10]
    Hong Jiazhen. Computational Dynamics of Multibody Systems. Advanced Education Press, China, 1996, (4): 70. (in Chinese)Google Scholar
  11. [11]
    Chen Liping, Peng Xiaobo. An approach to a 2D/3D geometric constraint solver. InProceedings of ASME DETC'00/DAC-14515, Baltimore, Maryland, September 10–13, 2000.Google Scholar
  12. [12]
    Yan Weimin, Wu Weiming. Data Structure. Tsinghua University Press, China, 1992. (in Chinese)Google Scholar

Copyright information

© Science Press, Beijing China and Allerton Press Inc. 2002

Authors and Affiliations

  • Peng Xiaobo 
    • 1
    Email author
  • Chen Liping 
    • 1
  • Zhou Fanli 
    • 1
  • Zhou Ji 
    • 1
  1. 1.National CAD Support Software Engineering Research CenterHuazhoung University of Science and TechnologyWuhanP. R. China

Personalised recommendations