Article | REF: S7212 V1

Optimizing the placement of irregular shapes

Authors: Salah MAOUCHE, Catherine K. BOUNSAYTHIP, Gilles ROUSSEL

Publication date: December 10, 2000

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


Français

3. Representation of the placement problem

Placement is an ordered combination of shapes. All combinations can be represented by a tree-structured state graph. The optimal placement problem then becomes a problem of finding the optimal path between the root of the tree, where no shape is placed, and a leaf of the tree, whose corresponding placement occupies the minimum area. To solve this optimization problem numerically, we need to define a state representation for traversing the search space and adopt a state exploration algorithm.

3.1 State graphs and placement

Here we recall some definitions ...

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!


The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Control and systems engineering

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Representation of the placement problem