Abstract
Geometric constraint solving is a key issue in CAD, CAM and PLM. The systems of geometric constraints are today studied and decomposed with graph-based methods, before their numerical resolution. However, graph-based methods can detect only the simplest (called structural) dependences between constraints; they cannot detect subtle dependences due to theorems. To overcome these limitations, this paper proposes a new method: the system is studied (with linear algebra tools) at a witness configuration, which is intuitively similar to the unknown one, and easy to compute.
Original language | English (US) |
---|---|
Pages (from-to) | 284-299 |
Number of pages | 16 |
Journal | CAD Computer Aided Design |
Volume | 38 |
Issue number | 4 |
DOIs | |
State | Published - Apr 2006 |
Keywords
- Constraints dependences
- Decomposition and solving
- Geometric constraints
- Rigidity theory
- The numerical probabilistic method
ASJC Scopus subject areas
- Computer Science Applications
- Computer Graphics and Computer-Aided Design
- Industrial and Manufacturing Engineering