The Relation between a Polygon Containment Problem and the Problem of Sorting X+Y

スポンサーリンク

概要

• 論文の詳細を見る

• The polygon containment problem is the problem of deciding whether a given polygon P which is allowed to have some kinds of motions, can be placed into another fixed Q. We show that the polygon containment problem in the case of rectilinearly convex polygons under translation, the problem of sorting X+Y and the problem of sorting sums of consecutive numbers are equivalent.

• 一般社団法人情報処理学会の論文
• 1994-12-15

著者

• Barrera A

  Hiroshima Univ.

• Barrera Antonio

  Department Of Mathematics Faculty Of Science Hiroshima University

関連論文

• The Relation between a Polygon Containment Problem and the Problem of Sorting X+Y

スポンサーリンク