Largest parallelotopes contained in simplices

Discrete Mathematics

Volumn 211, Issue 1-3, 2000, Pages 111-123

  Leng, Gangsong ^a,b   Zhang, Yao ^a,b   Bolin, Ma ^a  

^a HUNAN UNIVERSITY   (China)

^b Hunan Educational Institute   (China)

Author keywords

Largest parellelotopes; Parellelotope stack; Simplices; Volume

Indexed keywords

EID: 0013030960     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(99)00138-7     Document Type: Article

References (12)

1. L.M. Blumenthal, Distance Geometry, Oxford University Press, London, 1953.
2. S. Chandran, D.M. Mount, A parallel algorithm for enclosed and enclosing triangles, Int. J. Comput. Geom. Appl. 2 (1992) 191-214.
3. P. Gritzmann, V. Klee, D. Larman, Largest j-simplices in n-polytopes, Discrete Comput. Geom. 13 (1995) 477-515.
4. M. Hudelson, V. Klee, D. Larman, Largest j-simplices in cubes: some relatives of the Hadamard maximum determinant problem, Linear Algebra Appl. 242-243 (1996) 519-598.
5. V. Klee, Facet centroids and volume minimization, Studia Sci. Math. Hungar. 21 (1986) 143-147.
6. V. Klee, M.C. Laskowski, Finding the smallest triangle containing a given convex polygon, J. Algorithms 6 (1985) 359-375.
7. M. Lassak, Parallelotopes of maximal volume in a simplex, Discrete Comput. Geom. 21 (1999) 449-462.
8. D.M. Mount, S. Chandran, A unified approach for finding enclosing and enclosed triangles, Proc. Allerton Conf. on Communications, Control Computing, 1988, pp. 87-96.
9. D.S. Mitrinovic, J.E. Pečarič, V. Volenec, Recent Advances in Geometric Inequalities, Kluwer, Dordrecht, 1989.
10. G. Vegter, C. Yap, Minimal circumscribing simplices, Proc. 3rd Canad. Conf. on Computational Geometry, Vancouver, 1991, pp. 58-91.
11. J. Zh. Zhang, L. Yang, A class of geometric inequalities concering the masspoint system, J. China Univ. Sci. Tech. 11 (1981) 1-8.
12. Zhang Yao, A conjecture on the volume of the pedal simplex, J. Systems Sci. Math. Sci. 12 (1992) 371-375.