A formalization of geometric constraint systems and their decomposition

DOI10.1007/s00165-009-0117-8zbMath1214.68437OpenAlexW2136362794WikidataQ60326036 ScholiaQ60326036MaRDI QIDQ968304

Pascal Mathis, Simon E. B. Thierry

Publication date: 5 May 2010

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00165-009-0117-8

zbMATH Keywords

decompositiontransformation groupsformalizationparametric CADgeometric constraints solving

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Automated deduction and knowledge management in geometry

Cites Work

• A C-tree decomposition algorithm for 2D and 3D geometric constraint solving
• Using invariance under the similarity group to solve geometric constraint systems
• Using geometric rewrite rules for solving geometric problems symbolically
• Variation of geometries based on a geometric-reasoning method
• Geometric construction by assembling solved subfigures
• Algebraic method for manipulation of dimensional relationships in geometric models
• Rule-oriented method for parameterized computer-aided design
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• GEOMETRICAL CONSTRAINT SYSTEM DECOMPOSITION: A MULTI-GROUP APPROACH
• WELL-FORMED SYSTEMS OF POINT INCIDENCES FOR RESOLVING COLLECTIONS OF RIGID BODIES