ACM Home Page
Please provide us with feedback. Feedback
Combining symbolic and numerical solvers to simplify indecomposable systems solving
Full text PdfPdf (2.18 MB)
Source Symposium on Applied Computing archive
Proceedings of the 2008 ACM symposium on Applied computing table of contents
Fortaleza, Ceara, Brazil
SESSION: Geometric constraints and reasoning table of contents
Pages 1838-1842  
Year of Publication: 2008
ISBN:978-1-59593-753-7
Authors
Arnaud Fabre  University Louis Pasteur, Strasbourg, France
Pascal Schreck  University Louis Pasteur, Strasbourg, France
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 19,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1363686.1364128
What is a DOI?

ABSTRACT

In Computer-Aided Design, solvers always attempt to decompose geometric constraint systems into smaller ones in order to make faster the resolution. However, this scheme often fails in the case of 3D geometric constraint systems since they are hardly decomposable. We have studied a new method which uses jointly two solvers, a symbolic one and a numerical one, in order to solve a system S: system S is transformed into a parametric system S' "almost" equivalent to S and such that system S" is symbolically solvable and the numerical solver computes solutions of S from solutions of S".


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
B. Aldefeld, H. Malberg, H. Richter, and K. Voss. Rule-based variational geometry in computer-aided design, pages 27--46. (D. T. Pham ed.), Springer-Verlag, 1992.
 
2
D. Cox, J. Little, and D. O'Shea. Using Algebraic Geometry, Springer-Verlag, New York, 1998.
 
3
4
5
 
6
X.-S, Gao, C. M. Hoffmann, and W.-Q. Yang. Solving spatial basic geometric constraint configurations with locus intersection. Computer-Aided Design, 36:111--122, 2004.
 
7
8
 
9
H. Lamure and D. Michelucci. Qualitative study of geometric constraints. In Geometric Constraint Solving and Applications, pages 234--258. Springer, 1998.
10
 
11
D. Michelucci and S. Foufou. The witness configuration method. Computer-Aided Design, 38(4):284--299, 2006.
12
 
13
P. Schreck, J.-F. Dufourd, and P. Mathis. Using a numerical tool in a formal construction method with decomposition. In Proceedings of 2th International Conference on Computer Graphics and Artificial Intelligence, Limoges, France, 1998.
 
14
G. Sunde. Specification of shape by dimensions and other geometric constraints. In Proceedings of the Eurographics Workshop on Intelligent CAD systems, Noordwisjkeroul, 1987.
 
15
W. Wu. Basic principles of mechanical theorem proving in elementary geometries. Journal of Symbolic Computation, 4:207--235, 1984.

Collaborative Colleagues:
Arnaud Fabre: colleagues
Pascal Schreck: colleagues