A central issue in dealing with geometric constraint systems for CAD/CAM/CAE is the generation of an optimal decomposition plan that not only aids efficient solution, but also captures design intent and supports conceptual design. Though complex, this issue has evolved and crystallized over the past few years, permitting us to take the next important step: in this paper, we formalize, motivate and explain the decomposition-recombination (DR)-planning problem as well as several performance measures by which DR-Planning algorithms can be analyzed and compared.
展开▼
