16.01.2015 Views

sborník

sborník

sborník

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

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

Světlana Tomiczková<br />

AREA OF THE MINKOWSKI SUM OF<br />

TWO CONVEX SETS<br />

Abstract<br />

This paper deals with the area of the Minkowski sum of two<br />

convex polygons and the area of the Minkowski sum of two<br />

convex sets bounded by closed curves.<br />

Minkowski sum, area.<br />

Keywords<br />

1 Introduction<br />

The Minkowski sum of two point sets A and B can be defined as<br />

A ⊕ B = ⋃ A b or A ⊕ B = {a + b| a ∈ A ∧ b ∈ B}.<br />

b∈B<br />

We will find the rule for the computation of the area of the<br />

Minkowski sum of two convex sets.<br />

2 Area of the Minkowski sum of two convex<br />

polygons<br />

Theorem 1: (see fig. 1) Let A and B be convex polygons and<br />

O = [0, 0] an inner point of the polygon B and C = A ⊕ B. Then the<br />

area S(C) of the polygon C is<br />

S(C) = S(A) + S(B) +<br />

n∑<br />

|a i ||v i |,<br />

where S(A), S(B) are areas of the polygons A, B, a i is the edge of the<br />

polygon A, n i is the outer normal vector of a i and v i is the distance of<br />

the extreme point in direction n i on the polygon B from the straight<br />

line which is parallel with a i and goes through the point O = [0, 0].<br />

Proof: (see fig. 2) Let A 1 , . . . , A n be the vertices of the polygon<br />

A and B 1 , . . . , B m the vertices of the polygon B. We denote the<br />

i=1<br />

255

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

Saved successfully!

Ooh no, something went wrong!