A Set of Rules for a Constructive Geometric Constraint Solver
نویسندگان
چکیده
This paper presents the set of constructive rules used by a two-dimensional, variational geometric constraint solver based on a constructive approach. The main goal in deening the rules has been to keep the set of rules as small as possible while being able to yield a useful solver with a large enough domain of solvable constructions. The rules can be classiied according to their functionality as belonging to one of three possible types: creation rules, merging rules, and constructive rules. Creation rules translate the geometric constraints into the appropiate internal representation. Merging rules are used to compute the transitive closure of angle constraints. Construction rules allow to build triangles and they also build some quadri-laterals. The rules can build any triangle deened by a set of three independent relationships given as either distances between two ver-tices, angles between two sides and altituds. Quadrilateral rules can build three especiic, diierent quadrilaterals.
منابع مشابه
A Rule-Constructive Geometric Constraint Solver
This work reports on the implementation of a two-dimensional, varia-tional geometric constraint solver based on a constructive approach. The solver computes a solution in two phases. First, using rewrite rules, the solver builds a sequence of construction steps. Then, the construction steps are carried out to generate an instance of the geometric object for the current dimension values. We disc...
متن کاملA 2D geometric constraint solver using a graph reduction method
Keywords: Geometric constraints Modeling by constraints Graph-constructive solver Decomposition–recombination (DR) planning Graph algorithms Under-constrained problems a b s t r a c t 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 desig...
متن کاملA Geometric Relaxation Solver for Parametric Constraint-Based Models
In this paper, a new relaxation algorithm for solving geometric constraint-based models is proposed. The algorithm starts from a constructive symbolic representation of objects (Constructive Parametric Solid Model, CPSM) and proceeds by iterative relaxation of the geometric constraints. Models that can be reduced to distance and angle constraints can be handled. A new algorithm based on an iter...
متن کاملVisualizing Constraints in Visualization Rules
The visualization rules of TRIP systems are a set of mapping rules that maps source data into the high-level representation of target picture. The data of this representation consists of geometric graphical objects and geometric constraints among them. When the visualization rules have some bugs, the TRIP system cannot solve the constraints properly and cannot generate a target picture. In orde...
متن کاملSatisfiability Modulo Constraint Handling Rules (Extended Abstract)
Satisfiability Modulo Constraint Handling Rules (SMCHR) is the integration of the Constraint Handling Rules (CHRs) solver programming language into a Satisfiability Modulo Theories (SMT) solver framework. Constraint solvers are implemented in CHR as a set of high-level rules that specify the simplification (rewriting) and constraint propagation behavior. The traditional CHR execution algorithm ...
متن کامل