DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
From MaRDI portal
Publication:3422212
DOI10.1142/S0218195906002105zbMath1104.65304MaRDI QIDQ3422212
Bertrand Neveu, Pascal Mathis, Christophe Jermann, Gilles Trombettoni
Publication date: 9 February 2007
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
WCMgeometric constraintsrigiditymaximum matchingdecomposition techniquesconnectivity analysisDOF analysisDR-plannerPDOF
Related Items (17)
Constructibility classes for triangle location problems ⋮ Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials ⋮ Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems ⋮ Towards a better integration of modelers and black box constraint solvers within the product design process ⋮ Recent advances on the discretizable molecular distance geometry problem ⋮ On bounded block decomposition problems for under-specified systems of equations ⋮ Body-and-cad geometric constraint systems ⋮ A case study in formalizing projective geometry in Coq: Desargues theorem ⋮ A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs ⋮ Foreword to special issue ⋮ Combinatorial rigidity of incidence systems and application to dictionary learning ⋮ A formalization of geometric constraint systems and their decomposition ⋮ Improving inter-block backtracking with interval Newton ⋮ Interrogating witnesses for geometric constraint solving ⋮ CONSTRAINT MODELING FOR CURVES AND SURFACES IN CAGD: A SURVEY ⋮ Detecting All Dependences in Systems of Geometric Constraints Using the Witness Method ⋮ The reachability problem in constructive geometric constraint solving based dynamic geometry
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric constraint solving with conics and linkages
- Variation of geometries based on a geometric-reasoning method
- Geometric construction by assembling solved subfigures
- Rule-oriented method for parameterized computer-aided design
- Symbolic constraints in constructive geometric constraint solving
- A deductive database approach to automated geometry theorem proving and discovering
- Sketch-based pruning of a solution space within a formal geometric constraint solver
- Geometric constraint solver
- CORRECTNESS PROOF OF A GEOMETRIC CONSTRAINT SOLVER
- On Generic Rigidity in the Plane
- Conditions for Unique Graph Realizations
- Computing the block triangular form of a sparse matrix
- Determining the Equivalence of Algebraic Expressions by Hash Coding
- Depth-First Search and Linear Graph Algorithms
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
This page was built for publication: DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
