16.01.2015 Views

sborník

sborník

sborník

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

25. KONFERENCE O GEOMETRII A POČÍTAČOVÉ GRAFICE<br />

Edita Vranková<br />

ON TWO APPROACHES FOR<br />

CONSTRUCTION OF DIRECT ALTERNATE<br />

LAYOUT FOR STAMPING<br />

Abstract<br />

In the presented paper we study two approaches for making of direct<br />

alternate layout for stamping from geometrical point of view, which are<br />

used above all in engineering in sheet metal forming for production of<br />

cutting pieces. There are solving non-total dense and (total) dense twoperiodical<br />

placements of rectangular and mutually congruent axial<br />

polygons along a line.<br />

Keywords<br />

Cutting plan, direct alternate layout for stamping, congruent rectangular<br />

and axial polygons, non-total and total dense two-periodical placement.<br />

1 Introduction<br />

Not only in engineering, but also in clothing and shoe industry are solving<br />

tasks which lead in principle to interactive or automatic placements of plane<br />

geometric figures without overlapping into some plane domain when only<br />

translations of figures are allowed. An important part of technological<br />

preparation of procedures is the construction of (optimal) cutting plan [1],<br />

[2]. Above all in engineering practice (automobile industry - sheet metal<br />

forming) is often solved direct alternate layout for stamping [2].<br />

Geometrically speaking, it is a periodical placement of union of two<br />

congruent rectangular axial polygons [9] symmetric by some point lying at<br />

the axis of the strip along a line. We called it two-periodical placement of<br />

rectangular axial polygons along a line.<br />

An useful theoretical tool for solving such tasks can be the set D(M,N)<br />

of dense placements for moving polygon M and fixed polygon N. During<br />

placement of polygons it is necessary to provide the non-overlapping of any<br />

two different polygons. Two polygons M, N are overlapping if they have<br />

a common interior point (intM∩intN≠∅). Among all placements of<br />

polygons are important their dense placements from optimization<br />

viewpoint. The polygons M, N are dense placed if there is a common<br />

boundary point (∂M∩∂N≠∅) and if the polygons M, N are not overlapping<br />

293

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!