Interrogating witnesses for geometric constraint solving

被引:6
|
作者
Foufou, Sebti [1 ,2 ]
Michelucci, Dominique [2 ]
机构
[1] Qatar Univ, CENG, CSE Dept, Doha, Qatar
[2] Univ Bourgogne, Le2i, CNRS 5158, F-21078 Dijon, France
关键词
Geometric constraints; Constraint solving; Constraint decomposition; Dependent and independent constraints; Witness configuration; Infinitesimal motions; DECOMPOSITION PLANS; SYSTEMS;
D O I
10.1016/j.ic.2011.09.006
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Classically, geometric constraint solvers use graph-based methods to decompose systems of geometric constraints. These methods have intrinsic limitations, which the witness method overcomes; a witness is a solution of a variant of the system. This paper details the computation of a basis of the vector space of free infinitesimal motions of a typical witness, and explains how to use this basis to interrogate the witness for dependence detection. The paper shows that the witness method detects all kinds of dependences: structural dependences already detectable by graph-based methods, but also non-structural dependences, due to known or unknown geometric theorems, which are undetectable by graph-based methods. It also discusses how to decide about the rigidity of a witness and how to decompose it. (C) 2012 Elsevier Inc. All rights reserved.
引用
收藏
页码:24 / 38
页数:15
相关论文
共 50 条
  • [31] On Geometric Constraint Solving Based on the Immune Neural Network
    Cao Chunhong
    Zhang Bin
    Wang Limin
    Li Wenhui
    [J]. PROCEEDINGS OF THE 27TH CHINESE CONTROL CONFERENCE, VOL 4, 2008, : 536 - +
  • [32] 3D geometric constraint solving with conicoid
    Jiang, Kun
    Gao, Xiao-Shan
    [J]. Ruan Jian Xue Bao/Journal of Software, 2002, 13 (04): : 482 - 489
  • [33] 3D geometric constraint solving with conicoid
    Jiang, K
    Gao, XS
    [J]. CAD/GRAPHICS '2001: PROCEEDINGS OF THE SEVENTH INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN AND COMPUTER GRAPHICS, VOLS 1 AND 2, 2001, : 25 - 32
  • [34] The Application of Improved PSO Algorithm in the Geometric Constraint Solving
    Tian Wei
    Zhu Xiaogang
    [J]. 2017 INTERNATIONAL CONFERENCE ON COMPUTER NETWORK, ELECTRONIC AND AUTOMATION (ICCNEA), 2017, : 156 - 159
  • [35] The Geometric Constraint Solving Based on the Quantum Particle Swarm
    Cao Chunhong
    Wang Limin
    Li Wenhui
    [J]. ROUGH SET AND KNOWLEDGE TECHNOLOGY (RSKT), 2010, 6401 : 582 - 587
  • [36] Semantic Feature Modeling Based on Geometric Constraint Solving
    Gao, Xue-Yao
    Zhang, Chun-Xiang
    Yu, Xiao-Yang
    [J]. APPLIED SCIENCE, MATERIALS SCIENCE AND INFORMATION TECHNOLOGIES IN INDUSTRY, 2014, 513-517 : 2264 - 2267
  • [37] The geometric constraint solving based on memory particle swarm algorithm
    Cao, CH
    Li, WH
    Zhang, YJ
    Yi, RQ
    [J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 2134 - 2139
  • [38] An expanding algorithm of geometric constraint solving in semantic feature modeling
    Liu, Xianguo
    Sun, Lijuan
    [J]. Information Technology Journal, 2011, 10 (07) : 1447 - 1451
  • [39] Combining constructive and equational geometric constraint-solving techniques
    Joan-Arinyo, R
    Soto-Riera, A
    [J]. ACM TRANSACTIONS ON GRAPHICS, 1999, 18 (01): : 35 - 55
  • [40] Genetic algorithms for root multiselection in constructive geometric constraint solving
    Joan-Arinyo, R
    Luzón, MV
    Soto, A
    [J]. COMPUTERS & GRAPHICS-UK, 2003, 27 (01): : 51 - 60