Abstract
For more than a decade, the trend in geometric constraint systems solving has been to use a geometric decomposition/recombination approach. These methods are generally grounded on the invariance of systems under rigid motions. In order to decompose further, other invariance groups (e.g., scalings) have recently been considered. Geometric decomposition is grounded on the possibility to replace a solved subsystem with a smaller system called boundary. This article shows the central property that justifies decomposition, without assuming specific types of constraints or invariance groups. The exact nature of the boundary system is given. This formalization brings out the elements of a general and modular implementation.
Similar content being viewed by others
References
Aldefeld B (1988) Variations of geometries based on a geometric-reasoning method. Comput Aided Des 20(3): 117–126
Brüderlin B (1993) Using geometric rewrite rules for solving geometric problems symbolically. Theor Comput Sci 116(2): 291–303
Dufourd J-F, Mathis P, Schreck P (1998) Geometric construction by assembling solved subfigures. Artif Intell 99(1): 73–119
Gao X-S, Chou S-C (1998) Solving geometric constraint systems II. A symbolic approach and decision of Rc-constructibility. Comput Aided Des 30(2): 115–122
Gao X-S, Hoffmann CM, Yang W-Q (2002) Solving spatial basic geometric constraint configurations with locus intersection. In: SMA’02: Proceedings of the seventh ACM symposium on solid modeling and applications. ACM, Saarbrücken, germany pp 95–104
Gao X-S, Lin Q, Zhang G-F (2006) A C-tree decomposition algorithm for 2D and 3D geometric constraint solving. Comput Aided Des 38(1): 1–13
Joan-Arinyo R, Soto A (1997) A correct rule-based geometric constraint solver. Comput Graph 5(21): 599–609
Jermann C, Trombettoni G, Neveu B, Mathis P (2006) Decomposition of geometric constraint systems: a survey. Int J Comput Graph Appl 16(5,6): 379–414
Kondo K (1992) Algebraic method for manipulation of dimensional relationships in geometric models. Comput Aided Des 24(3): 141–147
Kramer GA (1992) A geometric constraint engine. Artif Intell 58(1–3): 327–360
Light R, Lin V, Gossard DC (1981) Variational Geometry in CAD. Comput Graph 15(3): 171–175
Lamure H, Michelucci D (1996) Solving geometric constraints by homotopy. IEEE Trans Vis Comput Graph 2(1): 28–34
Latham RS, Middleditch AE (1996) Connectivity analysis: a tool for processing geometric constraints. Comput Aided Des 28(11): 917–928
Owen JC (1991) Algebraic solution for geometry from dimensional constraints. In: SMA’91: proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications. ACM, Austin, pp 397–407
Schreck P (1994) A knowledge-based for solving geometric constructions problems. In: Brahan JW, Lasker GE (eds) Proceedings of the seventh international conference on systems research, Informatics and Cybernetics, pp 19–24
Sitharam M (2006) Well-formed systems of point incidences for resolving collections of rigid bodies. Int J Comput Geometry Appl 16(5,6): 591–615
Schreck P, Mathis P (2006) Geometrical constraint system decomposition: a multi-group approach. Int J Comput Geometry Appl 16(5,6): 431–442
Schreck P, Schramm E (2006) Using the invariance under the similarity group to solve geometric constraint systems. Comput Aided Des 38(5): 475–484
Sunde G (1986) A CAD system with declarative specification of shape. In Proceedings of the IFIP WG 5.2 on Geometric Modeling, Rensselaerville
Thierry SEB, Mathis P, Schreck P (2007) Towards an homogeneous handling of under-constrained and well-constrained systems of geometric constraints. In: SAC’07: Proceedings of the 2007 ACM symposium on Applied computing. ACM, Seoul, pp 773–777
van der Meiden HA, Broonsvort WF (2008) Solving systems of 3D geometric constraints using non-rigid clusters. In: GPM’08: advances in geometric modelling and processing, Hangzhou, China. Lecture Notes in Computer Science, vol 4975. Springer, Berlin
Verroust A, Schonek F, Roller D (1992) Rule-oriented method for parameterized computer-aided design. Comput Aided Des 24(10): 531–540
Wintz J, Schreck P, Mathis P, Fabre A (2006) A framework for geometric constraint satisfaction problem. In: SAC’06: proceedings of the 2006 ACM symposium on applied computing. ACM, Dijon, pp 974–978
Author information
Authors and Affiliations
Corresponding author
Additional information
D.A. Duce
Rights and permissions
About this article
Cite this article
Mathis, P., Thierry, S.E.B. A formalization of geometric constraint systems and their decomposition. Form Asp Comp 22, 129–151 (2010). https://doi.org/10.1007/s00165-009-0117-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00165-009-0117-8