...
首页> 外文期刊>Optimization: A Journal of Mathematical Programming and Operations Research >Decomposition of the polyhedron from Albrecht Durer's 'Melencolia I' to a minimal pair of compact convex sets
【24h】

Decomposition of the polyhedron from Albrecht Durer's 'Melencolia I' to a minimal pair of compact convex sets

机译:将多面体从Albrecht Durer的“ Melencolia I”分解为最小的一对紧凑凸集

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Two pairs (A,B),(C,D) of compact convex sets are equivalent if A + D=B + C, where '+' is the Minkowski sum. In [15], the question was posed whether two equivalent minimal pairs are translates of each other. In [6], the first example of a three-dimensional minimal pair, which has an equivalent minimal pair not being the translate of the former, was given. Incidentally, the Minkowski sum of that pair resembles the famous polyhedron from Durer's 'Melancholy'. In this article, we give the decomposition of the polyhedron to a minimal pair of compact convex sets and prove that this pair belongs to a quotient class without the property of translation.
机译:如果A + D = B + C,则两对(A,B),(C,D)紧凸集相等,其中'+'是Minkowski和。在[15]中,提出了一个问题,即两个相等的最小对是否相互翻译。在[6]中,给出了三维最小对的第一个示例,它具有等效的最小对,而不是前者的平移。顺便说一句,这对的Minkowski总和类似于Durer的“忧郁”中著名的多面体。在本文中,我们将多面体的分解给出了最小的紧凑凸集对,并证明该对属于无翻译性质的商类。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号