This article is cited in 8 papers

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

M. V. Nevskii

P. G. Demidov Yaroslavl State University, Yaroslavl, Russia

Abstract: Let $S$ be a nondegenerate simplex in $\mathbb R^n$ 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$.

UDC: 514.17+517.51

 English version: Journal of Mathematical Sciences (New York), 2014, 203:6, 851–854

Bibliographic databases:

• 
•