Abstract
This paper presents a practical solution for surface fitting problems with prioritized geometry constraints in reverse engineering. The approach allows prioritizing constraints and uses them for decomposing the problem into a set of sequentially solved, manageable sub-problems. The result of each solution step is trade-off between satisfying the set of constraints and fitting of the surfaces to the measured points. The overall solution process trades off solution quality with complexity of the problem. Solution quality is checked against pre-defined tolerances assigned to the geometry constraints. Results on a benchmark problem demonstrate the suitability of the approach to solving large problems with hundreds of surfaces and constraints.
| Original language | English |
|---|---|
| Pages (from-to) | 399-417 |
| Number of pages | 19 |
| Journal | CAD Computer Aided Design |
| Volume | 37 |
| Issue number | 4 |
| DOIs | |
| State | Published - 1 Apr 2005 |
Keywords
- Clustering
- Design structure matrix
- Geometry constraints
- Partitioning
- Problem decomposition
- Reverse engineering