Numerical decomposition of geometric constraints

ACM Symposium on Solid Modeling and Applications, SM

Volumn , Issue , 2005, Pages 143-151

  Foufou, Sebti ^a,b   Michelucci, Dominique ^a   Jurzak, Jean Paul ^a  

^a UNIVERSITÉ DE BOURGOGNE   (France)

^b NATIONAL INSTITUTE OF STANDARDS AND TECHNOLOGY   (United States)

Author keywords

Constraints decomposition and solving; Geometric constraints; Geometry provers

Indexed keywords

CONSTRAINT DECOMPOSITION AND SOLVING; GEOMETRIC CONSTRAINT; GEOMETRY PROVERS;

CONSTRAINT THEORY; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM PROCESSES; THEOREM PROVING;

COMPUTATIONAL GEOMETRY;

EID: 30944456120     PISSN: 18117783     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1060244.1060261     Document Type: Conference Paper

References (33)

1. BOUHINEAU, D. 1996. Solving geometrical constraint systems using clp based on linear constraint solver. In Proc. of Third International Conference on Artificial Intelligence, and Symbolic Mathematical Computation, AISMC-3, LNCS 1138, Sprenger, Steyr, Austria.
2. BRDERLIN, B., AND ROLLER, D., Eds. 1998. Geometric Constraint Solving & Applications. Springer Verlag. June.
3. CHOU, S.-C. 1988. Mechanical Geometry theorem Proving. D. Reidel Publishing Company.
4. GAO, X.-S., AND ZHANG. G. 2003. Geometric constraint solving via c-tree decomposition. In ACM Solid Modelling, ACM Press, New York, 45-55.
5. GRÜNBAUM, B. 1967. Convex polytopes. London Interscience.
6. HENDRICKSON, B. 1992. Conditions for unique realizations. SIAM J. Computing 21, 1, 65-84.
7. HOFFMANN, C., LOMONOSOV, A., AND SITHARAM, M. 2001. Decomposition plans for geometric constraint problems, part II: New algorithms. J. Symbolic Computation 31, 409-427.
8. HOFFMANN, C., LOMONOSOV, A., AND SITHARAM, M. 2001. Decomposition plans for geometric constraint systems, parts I: Performance measures for CAD. J. Symbolic Computation 31, 367-408.
9. HOFFMANN, C., SITHARAM, M., AND YUAN, B. 2004. Making constraint solvers useable: overconstraints. Comp. Aided Design.
10. JERMANN, C., NEVEU, B., AND TROMBETTONI, G. 2003. Algorithms for identifying rigid subsystems in geometric constraint systems. IJCAI, 233-238.
11. JOAN-ARINYO, R., SOTO-RIERA, A., VILA-MARTA, S., AND VILAPLANA-PASTO:, J. 2003. Transforming an under-constrained geometric constraint problem into a well-constrained one. In Proc. of Symposium on Solid Modeling and Applications, ACM, 33-44.
12. JOAN-ARINYO, R., SOTO-RIERA, A., VILA-MARTA, S., AND VILAPLANA-PASTO, J. 2004. Revisiting decomposition analysis of geometric constraint graphs. Computer-Aided Design 36, 2, 123-140.
13. JURZAK, J.-P. 2003. Géométrie vectorielle algorithmique : La géométrie vectorielle par l'informatique. Tech. Rep. http://passerelle.u-bourgogne.fr/publications/webgeometrie/, Université de Bourgogne, Dijon.
14. KORTENKAMP, U., AND RICHTER-GEBERT, J. 1998. The Interactive Geometry Software Cinderella. Springer-Verlag.
15. KORTENKAMP, U. 1999. Foundations of Dynamic Geometry. PhD Thesis No 13403, Swiss Federal Institue of Technology, Zurich, Switzerland.
16. LAMAN, G. 1970. On graphs and rigidity of plane skeletal structures. J. Engineering Math. 4, 331-340.
17. LAMURE, H., AND MICHELUCCI, D. 1998. Qualitative study of geometric constraints. In Geometric Constraint Solving and Applications, Springer-Verlag.
18. LIN, V. C., GOSSARD, D. C., AND LIGHT, R. A. 1981. Variational geometry in computer-aided design. In Proceedings of the 8th annual conference on Computer graphics and interactive techniques, ACM Press. 171-177.
19. LOVASZ, L., AND PLUMMER, M. 1986. Matching Theory. North-Holland.
20. LOVASZ, L., AND YEMINI, Y. 1982. On generic rigidity in the plane. SIAM J. Alg. Discr. Meth. 3, 1, 91-98.
21. MICHELUCCI, D., AND FOUFOU, S. 2004. Using Cayley-Menger determinants for geometric constraint solving. In ACM Symposium on Solid Modeling.
22. MIGNOTTE, M., AND STEFANESCU, D. 1999. Polynomials: An algorithmic approach. In Discrete Mathematics and Theoretical Computer Science Series, vol. XI. Springer.
23. OLANO, S., AND BRUNET, P. 1994. Constructive constraint-based model for parametric cad systems. Computer-Aided Design 26, 8, 614-621.
24. OWEN, J. 1991. Algebraic solution for geometry from dimensional constraints. In Proc. of the Symp. on Solid Modeling Foundations and CAD/CAM Applications, 397-407.
25. OWEN, J. 1996. Constraints on simple geometry in two and three dimensions. Int. J. of Computational Geometry and Applications 6, 4, 421-434.
26. POUZERGUES, R. 2002. Les hexamys. Tech. rep., http://hexamys.free.fr/.
27. REGE, A. 1995. A complete and practical algorithm for geometric theorem proving. In ACM Symp. Computational geometry.
28. SCHRAMM, E., AND SCHRECK, P. 2003. Solving geometric constraints invariant modulo the similarity group. In Proceedings of Computational Science and Its Applications - ICCSA 2003, International Conference, Part III, Montreal, Canada, May 2003, Springer, vol. 2669 of Lecture Notes in Computer Science, 356-365.
29. SCHWARTZ, J. 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 4, 27, 701-717.
30. SERRÉ, P., RIVIERE, A., DUONG, A., AND ORTUZAR, A. 2001. Analysis of a geometric specification. In Proceedings of the 27th Design Automation Conference, ASME Design Engineering Technical Conferences.
31. SITHARAM, M., AND ZHOU, Y. 2004. A tractable, approximate characterization of combinatorial rigidity in 3D. In Automated Deduction in Geometry.
32. SUTHERLAND, I. 1963. Sketchpad-A Man-Machine Graphical Interface. PhD thesis, MIT.
33. YANG, L. 2002. Distance coordinates used in geometric constraint solving. Automated Deduction in Geometry, 216-229.