A Constraint Programming Approach for Solving Rigid Geometric Systems

Jermann, Christophe; Trombettoni, Gilles; Neveu, Bertrand; Rueher, Michel

doi:10.1007/3-540-45349-0_18

Cited by 8 publications

(4 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First, let us take an example from literature. In [9], B. Neveu et al presented geometric figures made of triangles, that we recall on Fig.1. The constraint systems, containing only distance constraints, provide respectively 128 and 64 solutions.…”

Section: Freezing Techniquementioning

confidence: 98%

Helping the Designer in Solution Selection: Applications in CAD

Essert

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

In CAD, symbolic geometric solvers allow to solve constraint systems, given under the form of a sketch and a set of constraints, by computing a symbolic construction plan describing how to build the required figure. But a construction plan does not usually define a unique figure, and the selection of the expected figure remains an important topic. This paper expose three methods, automatic or interactive, to help the designer in the exploration of the solution space. These methods guide him towards the expected solution, by basing the construction on the observation of the sketch. A set of examples from a large range of application domains illustrate the different methods.

show abstract

Section: Freezing Techniquementioning

confidence: 98%

Helping the Designer in Solution Selection: Applications in CAD

Essert

2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The accuracy of the topographic measures and the precision of the components dimensions and position are the crucial for the industrialization of the building renovation and the goals of the CRIBA project. Therefore, in order to do so, we need to integrate to the configuration system geometric constraints (for a complete survey, see, [25] or [26], and for more recent work see [27], [14] or [15]).…”

Section: Building Renovation Configuration and Constraintsmentioning

confidence: 99%

Configuration of high performance apartment buildings renovation: A constraint based approach

Vareilles

Santa

Falcon

et al. 2013

2013 IEEE International Conference on Industrial Engineering and Engineering Management

View full text Add to dashboard Cite

This paper looks at the possibility of configuring high performance renovation of apartment buildings by the use of a constraint satisfaction problem (CSP). A new thermal envelope wraps the whole building and allows it to achieve a really low energy performance of 25 kWh/m²/year. This new thermal envelope is composed of rectangular panels, always comprising insulation and cladding, and sometimes including, in addition, doors, windows or solar modules. The panels can be fixed directly onto the walls or onto a metal structure around the whole building. The decision support system, based on CSP approaches, will simultaneously enable the interactive definition of the renovation, the associated bill of material (BOM) and the building site assembly process. The range of knowledge to exploit and to model leads us to integrate into a single decision support system different constraint types, such as classical, dynamic, geometric and global constraints, as well as their filtering methods.

show abstract

“…Equational decompositions work on the graph made of variables and equations [2,1]. When equations model geometric constraints, geometric decompositions generally produce smaller blocks [11,9].…”

Section: Introductionmentioning

confidence: 99%

“…The first paper [2] presented first versions of IBB which included several backtracking schemas, along with an equational decomposition technique. Since then, several variants of IBB have been developed which had never been detailed before ( [11] focussed on the geometric decomposition techniques based on flow machinery. )…”

Section: Introductionmentioning

confidence: 99%

Inter-block Backtracking: Exploiting the Structure in Continuous CSPs

Neveu

Jermann

Trombettoni

2005

Global Optimization and Constraint Satisfaction

Self Cite

View full text Add to dashboard Cite

This paper details a technique, called inter-block backtracking (IBB), which improves interval solving of decomposed systems with non-linear equations over the reals. This technique, introduced in 1998 by Bliek et al., handles a system of equations previously decomposed into a set of (small) k × k subsystems , called blocks. All solutions are obtained by combining the solutions computed in the different blocks. The approach seems particularly suitable for improving interval solving techniques. In this paper, we analyze into the details the different variants of IBB which differ in their backtracking and filtering strategies. We also introduce IBB-GBJ, a new variant based on Dechter's graph-based backjumping. An extensive comparison on a sample of eight CSPs allows us to better understand the behavior of IBB. It shows that the variants IBB-BT+ and IBB-GBJ are good compromises between simplicity and performance. Moreover, it clearly shows that limiting the scope of the filtering to the blocks is very useful. For all the tested instances, IBB gains several orders of magnitude as compared to a global solving.

show abstract

A Constraint Programming Approach for Solving Rigid Geometric Systems

Cited by 8 publications

References 12 publications

Helping the Designer in Solution Selection: Applications in CAD

Helping the Designer in Solution Selection: Applications in CAD

Configuration of high performance apartment buildings renovation: A constraint based approach

Inter-block Backtracking: Exploiting the Structure in Continuous CSPs

Contact Info

Product

Resources

About