A constructive approach to solving 3-D geometric constraint systems using dependence analysis

被引:22
|
作者
Li, YT [1 ]
Hu, SM [1 ]
Sun, JG [1 ]
机构
[1] Tsing Hua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
基金
中国国家自然科学基金;
关键词
geometric constraints; dependence analysis; basic clusters; graph reduction;
D O I
10.1016/S0010-4485(01)00054-9
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Solving geometric constraint systems in 3-D is much more complicated than that in 2-D because the number of variables is larger and some of the results valid in 2-D cannot be extended for 3-D. In this paper, we propose a new DOF-based graph constructive method to geometric constraint systems solving that can efficiently handle well-, over- and under-constrained systems based on the dependence analysis. The basic idea is that the solutions of some geometric elements depend on some others because of the constraints between them. If some geometric elements depend on each other, they must be solved together. In our approach, we first identify all structurally redundant constraints, then we add some constraints to well constrain the system. And we prove that the order of a constraint system after processing under-constrained cases is not more than that of the original system multiplied by 5. After that, we apply a recursive searching process to identify all the clusters, which is shown to be capable of getting the minimum order-reduction result of a well-constrained system. We also briefly describe the constraint evaluation phase and show the implementation results of our method. (C) 2001 Elsevier Science Ltd. All rights reserved.
引用
收藏
页码:97 / 108
页数:12
相关论文
共 50 条
  • [21] Searching the solution space in constructive geometric constraint solving with genetic algorithms
    Luzón, MV
    Soto, A
    Gálvez, JF
    Joan-Arinyo, R
    APPLIED INTELLIGENCE, 2005, 22 (02) : 109 - 124
  • [22] Searching the Solution Space in Constructive Geometric Constraint Solving with Genetic Algorithms
    M. V. Luzón
    A. Soto
    J. F. Gálvez
    R. Joan-Arinyo
    Applied Intelligence, 2005, 22 : 109 - 124
  • [23] The Reachability Problem in Constructive Geometric Constraint Solving Based Dynamic Geometry
    Marta R. Hidalgo
    Robert Joan-Arinyo
    Journal of Automated Reasoning, 2014, 52 : 99 - 122
  • [24] The reachability problem in constructive geometric constraint solving based dynamic geometry
    Joan-Arinyo, R. (robert@lsi.upc.edu), 1600, Kluwer Academic Publishers (52):
  • [25] A geometric approach to anytime constraint solving for TCSPs
    Yeh, HM
    Hsu, JYJ
    Huang, HS
    PRICAI'98: TOPICS IN ARTIFICIAL INTELLIGENCE, 1998, 1531 : 365 - 376
  • [26] Dynamically solving 3D geometric constraint satisfaction problems
    Wu, YM
    Yin, WS
    Zhang, XF
    Zhou, J
    FIFTH INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN & COMPUTER GRAPHICS, VOLS 1 AND 2, 1997, : 399 - 402
  • [27] SOLVING GEOMETRIC CONSTRAINT SYSTEMS - KRAMER,G
    SACKS, EP
    ARTIFICIAL INTELLIGENCE, 1993, 61 (02) : 343 - 349
  • [28] Witness Computation for Solving Geometric Constraint Systems
    Kubicki, Arnaud
    Michelucci, Dominique
    Foufou, Sebti
    2014 SCIENCE AND INFORMATION CONFERENCE (SAI), 2014, : 759 - 770
  • [29] Solving geometric constraint systems. I. A global propagation approach
    Inst of Systems Science of Academia, Sinica, Beijing, China
    Comput Aided Des, 1 (47-54):
  • [30] Solving geometric constraint systems. I. A global propagation approach
    Gao, XS
    Chou, SC
    COMPUTER-AIDED DESIGN, 1998, 30 (01) : 47 - 54