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

DOI10.1007/S10958-014-2175-6MaRDI QIDQ2259301zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 3 March 2015

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-014-2175-6

zbMATH Keywords

longest segmentsimplex

Mathematics Subject Classification ID

Polyhedra and polytopes; regular figures, division of spaces (51M20)

Recommendations

• Properties of axial diameters of a simplex
• On a property of \(n\)-dimensional simplices
• Convergence of suitable affine subspace method for finding the least distance to a simplex
• Parallelotopes of maximum volume in a simplex
• Two isoperimetric problems for Euclidean simplices

Cites work

• LATTICES AND CONVEX SETS IN SPACE
• On a property of \(n\)-dimensional simplices
• Properties of axial diameters
• Properties of axial diameters of a simplex

Cited in

(3)

• Perfect simplices in \({\mathbb R}^5\)
• The longest segment in the complement of a packing
• On Properties of a Regular Simplex Inscribed into a Ball

This page was built for publication: Computation of the longest segment of a given direction in a simplex

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2259301)