Automatic dimensioning in design for manufacturing
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Algebraic solution for geometry from dimensional constraints
SMA '91 Proceedings of the first ACM symposium on Solid modeling foundations and CAD/CAM applications
Constraint based analysis tools for design
SMA '93 Proceedings on the second ACM symposium on Solid modeling and applications
Parametric design and its impact on solid modeling applications
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Solving geometric constraints by homotopy
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
A graph-constructive approach to solving systems of geometric constraints
ACM Transactions on Graphics (TOG)
Decomposition plans for geometric constraint systems, part I: performance measures for CAD
Journal of Symbolic Computation
Decomposition plans for geometric constraint problems, part II: new algorithms
Journal of Symbolic Computation
A hybrid approach to geometric constraint solving with graph analysis and reduction
Advances in Engineering Software
Solving Geometric Constraints by a Graph-Constructive Approach
IV '99 Proceedings of the 1999 International Conference on Information Visualisation
Engineering Drawings Recognition Using a Case-based Approach
ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 1
Numerical decomposition of geometric constraints
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Spatial geometric constraint solving based on k-connected graph decomposition
Proceedings of the 2006 ACM symposium on Applied computing
Using Cayley-Menger determinants for geometric constraint solving
SM '04 Proceedings of the ninth ACM symposium on Solid modeling and applications
Dealing with redundancy and inconsistency in constructive geometric constraint solving
Advances in Engineering Software
Geometric constraints within feature hierarchies
Computer-Aided Design
A branch-and-prune solver for distance constraints
IEEE Transactions on Robotics
| Hi-index | 0.00 |
Modeling by constraints enables users to describe shapes by specifying relationships between geometric elements. These relationships are called constraints. A constraint solver derives then automatically the design intended by exploiting these constraints. The constraints solvers can be classified in four categories: symbolic, numerical, rule-oriented and graph-constructive solvers. The graph constructive approach is widely used in recent Computer Aided Design (CAD) systems. In this paper, we present a decomposition-recombination (DR) planning algorithm, called S-DR, that uses a graph reduction method to solve systems of 2D geometric constraints. Based on the key concept of skeletons, S-DR planner figures out a plan for decomposing a well constrained system into small sub-systems and recombines the solutions of these sub-systems to derive the solution of the entire system.