Tree-decomposable and Underconstrained Geometric Constraint Problems

08/18/2016
by   Ioannis Fudos, et al.
0

In this paper, we are concerned with geometric constraint solvers, i.e., with programs that find one or more solutions of a geometric constraint problem. If no solution exists, the solver is expected to announce that no solution has been found. Owing to the complexity, type or difficulty of a constraint problem, it is possible that the solver does not find a solution even though one may exist. Thus, there may be false negatives, but there should never be false positives. Intuitively, the ability to find solutions can be considered a measure of solver's competence. We consider static constraint problems and their solvers. We do not consider dynamic constraint solvers, also known as dynamic geometry programs, in which specific geometric elements are moved, interactively or along prescribed trajectories, while continually maintaining all stipulated constraints. However, if we have a solver for static constraint problems that is sufficiently fast and competent, we can build a dynamic geometry program from it by solving the static problem for a sufficiently dense sampling of the trajectory of the moving element(s). The work we survey has its roots in applications, especially in mechanical computer-aided design (MCAD). The constraint solvers used in MCAD took a quantum leap in the 1990s. These approaches solve a geometric constraint problem by an initial, graph-based structural analysis that extracts generic subproblems and determines how they would combine to form a complete solution. These subproblems are then handed to an algebraic solver that solves the specific instances of the generic subproblems and combines them.

READ FULL TEXT

page 32

page 34

research
10/28/2011

Modelling Constraint Solver Architecture Design as a Constraint Problem

Designing component-based constraint solvers is a complex problem. Some ...
research
04/28/2017

Kiwi - A Minimalist CP Solver

Kiwi is a minimalist and extendable Constraint Programming (CP) solver s...
research
01/31/2010

Dominion -- A constraint solver generator

This paper proposes a design for a system to generate constraint solvers...
research
12/15/2017

On the reducibility of geometric constraint graphs

Geometric modeling by constraints, whose applications are of interest to...
research
09/18/2019

Google vs IBM: A Constraint Solving Challenge on the Job-Shop Scheduling Problem

The job-shop scheduling is one of the most studied optimization problems...
research
09/30/2020

Machine Learning in Airline Crew Pairing to Construct Initial Clusters for Dynamic Constraint Aggregation

The crew pairing problem (CPP) is generally modelled as a set partitioni...
research
01/31/2010

Constraint solvers: An empirical evaluation of design decisions

This paper presents an evaluation of the design decisions made in four s...

Please sign up or login with your details

Forgot password? Click here to reset