Generalizations of Schöbi's Tetrahedral Dissection

Details Generalizations of Schöbi's Tetrahedral Dissection Generalizations of Schöbi's Tetrahedral Dissection

2007-10-20

arxiv.org/abs/0710.3857v2

Mathematics

Metric Geometry

20 pages, 8 figures. New version Nov 13 2007: Example 3 rewritten, added references, other small improvements

Scientific paper

Let v_1, ..., v_n be unit vectors in R^n such that v_i . v_j = -w for i != j, 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\"{o}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\"{o}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\"{o}bi's dissection is given which applies specifically in R^4. The results have applications to source coding and to constant-weight binary codes.

Affiliated with

Also associated with

No associations

Rating

Generalizations of Schöbi's Tetrahedral Dissection does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Generalizations of Schöbi's Tetrahedral Dissection, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalizations of Schöbi's Tetrahedral Dissection will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-477473