Decomposition Plans for Geometric Constraint Problems, Part II: New Algorithms

✍ Scribed by Christoph M. Hoffman; Andrew Lomonosov; Meera Sitharam

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 409 KB
• Volume: 31
• Category: Article
• ISSN: 0747-7171
• DOI: 10.1006/jsco.2000.0403

✦ Synopsis

We systematically design two new decomposition-recombination (DR) planners, geared to perform well with respect to several performance measures. The DR-planning problem and the performance measures were formally defined in Part I of this paper to closely reflect specific requirements of CAD/CAM applications. As expected, in analysis and comparison based on all of these performance measures, one of the new DR-planners, the modified frontier algorithm (MFA), represents a significant improvement over existing planners based on SR (constraint shape recognition) and MM (maximum matching) that were analyzed in Part I. We also present salient heuristics and data structures used in the implementation of MFA.