Dominique Michelucci
ABSTRACT
Classically, geometric constraint solvers use graph-based methods to analyze systems of geometric constraints. These methods have intrinsic limitations, which the witness method overcomes. This paper details the computation of a basis of the vector space of the free infinitesimal motions of a typical witness, and explains how to use this basis to interrogate the witness for detecting all dependencies between constraints: structural dependencies already detectable by graph-based methods, and also non-structural dependencies, due to known or unknown geometric theorems, which are undetectable with graph-based methods. The paper also discusses how to decide about the rigidity of a witness.
- B. Bruderlin and D. Roller, editors. Geometric Constraint Solving and Applications. Springer-Verlag, 1998. Google Scholar
Digital Library
- K. S. Christos H. Papadimitriou. Combinatorial Optimization, algorithms and Complexity. Dover Publications, 1998. Google ScholarDigital Library
- S. Foufou, D. Michelucci, and J.-P. Jurzak. Numerical decomposition of geometric constraints. In ACM Symp. on Solid and Physical Modelling, pages 143--151, 2005. Google ScholarDigital Library
- C. Fuenfzig, D. Michelucci, and S. Foufou. Nonlinear systems solver in floating-point arithmetic using lp reduction. In Proceedings of the 2009 ACM symposium on Solid modeling, 2009. Google ScholarDigital Library
- X.-S. Gao, C. Hoffmann, and W. Yang. Solving spatial basic geometric constraint configurations with locus intersection. Computer Aided Design, 36(2):111--122, 2004.Google ScholarCross Ref
- X.-S. Gao and G. Zhang. Geometric constraint solving via c-tree decomposition. In ACM Solid Modelling, pages 45--55. ACM Press, New York, 2003. Google ScholarDigital Library
- C. Hoffmann, A. Lomonosov, and M. Sitharam. Decomposition plans for geometric constraint problems, Part II: New algorithms. J. Symbolic Computation, 31:409--427, 2001. Google ScholarDigital Library
- C. Hoffmann, A. Lomonosov, and M. Sitharam. Decomposition plans for geometric constraint systems, Part I: Performance measures for cad. J. Symbolic Computation, 31:367--408, 2001. Google ScholarDigital Library
- H. S. J. Graver, B. Servatius. Combinatorial Rigidity. Graduate Studies in Mathematics. American Mathematical Society, 1993.Google Scholar
- C. Jermann, B. Neveu, and G. Trombettoni. Algorithms for identifying rigid subsystems in geometric constraint systems. In Int. Joint Conf. in Artificial Intelligence IJCAI-03, pages 233--238, 2003. Google ScholarDigital Library
- C. Jermann, G. Trombettoni, B. Neveu, and P. Mathis. Decomposition of geometric constraint systems: a survey. Int. J. of Comp. Geometry and App. (IJCGA), 16(5--6):379--414, 2006.Google Scholar
- H. Lamure and D. Michelucci. Solving constraints by homotopy. In Proc. of the Symp. on Solid Modeling Foundations and CAD/CAM Applications, pages 263--269, May 1995. Google ScholarDigital Library
- D. Michelucci and S. Foufou. Geometric constraint solving: the witness configuration method. Computer Aided Design, 38(4):284--299, 2006. Google ScholarDigital Library
- J. Owen. Constraint on simple geometry in two and three dimensions. Int. J. Comput. Geometry Appl., 6(4):421--434, 1996.Google ScholarCross Ref
Index Terms
- Interrogating witnesses for geometric constraint solving
Recommendations
Interrogating witnesses for geometric constraint solving
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 ...
Parallel algorithms on geometric constraint solving
SAC '07: Proceedings of the 2007 ACM symposium on Applied computingIn this paper, we try to speed up geometric constraint solving with parallel techniques. We propose parallel algorithms for building rule-bases, judging the under(over)-constrained problems, and finding construction sequences of geometric constraint ...
Solving spatial basic geometric constraint configurations with locus intersection
SMA '02: Proceedings of the seventh ACM symposium on Solid modeling and applicationsA basic idea of geometric constraint solving is to decompose the constraint problem into smaller ones according to some basic configurations. In this paper, we find all spatial basic configurations involving points, lines, and planes containing up to ...
Comments