FUNDAMENTALNAYA I PRIKLADNAYA MATEMATIKA

(FUNDAMENTAL AND APPLIED MATHEMATICS)

2013, VOLUME 18, NUMBER 2, PAGES 147-152

Computation of the longest segment of a given direction in a simplex

M. V. Nevskii

Abstract

View as HTML     View as gif image

Let $S$ be a nondegenerate simplex in $$Rⁿ and let $v$ be a nonzero $n$-dimensional vector. We give the computational formulas for the length and endpoints of the longest segment in $S$ parallel to $v$.

Location: http://mech.math.msu.su/~fpm/eng/k13/k132/k13211h.htm
Last modified: January 7, 2014