Schöbi四面体剖分的推广
Generalizations of Schöbi's Tetrahedral Dissection
摘要:
设v_1,...,v_n是R^n中的单位向量,使得v_i . v_j = -w for i!= j,其中-1 ≤ w ≤ 1/(n-1)。点Sum_{i=1..n} lambda_i v_i,其中1 >= lambda_1>=. >= lambda_n >= 0,形成一个“第一类希尔单形”,记为Q_n(w)。Hadwiger在1951年证明了Q_n(w)与立方体等剖。1985年,Schöbi将Q_3(w)分解为三个三角柱cQ_2(1/2)XI,其中I为区间,c = sqrt{2(w+1)/3}。本文将Schöbi的剖分推广到Q_n(w)的n片剖分,使之成为棱柱c Q_{n-1}(1/(n-1))XI,其中c = sqrt{(n-1)(w+1)/n}.迭代这个过程导致Q_n(w)分解成一个n维矩形平行四边形(或"砖“)使用最多n!片.计算Q_n(w)到砖块的映射的复杂度为O(n^2)。给出了对舍比分解的第二个推广,它特别适用于R^4。结果有应用程序的源编码和恒定重量的二进制码。
英文摘要:
Let v_1, ..., v_n be unit vectors in R^n such that v_i . v_j = -w for i != j, where -1 <w < 1/(n-1). The points Sum_{i=1..n} lambda_i v_i, where 1 >= lambda_1 >= ... >= lambda_n >= 0, form a ``Hill-simplex of the first type'', denoted by Q_n(w). It was shown by Hadwiger in 1951 that Q_n(w) is equidissectable with a cube. In 1985, Schöbi gave a three-piece dissection of Q_3(w) into a triangular prism c Q_2(1/2) X I, where I denotes an interval and c = sqrt{2(w+1)/3}. The present paper generalizes Schöbi's dissection to an n-piece dissection of Q_n(w) into a prism c Q_{n-1}(1/(n-1)) X I, where c = sqrt{(n-1)(w+1)/n}. Iterating this process leads to a dissection of Q_n(w) into an n-dimensional rectangular parallelepiped (or ``brick'') using at most n! pieces. The complexity of computing the map from Q_n(w) to the brick is O(n^2). A second generalization of Schöbi's dissection is given which applies specifically in R^4. The results have applications to source coding and to constant-weight binary codes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。