Largest j-Simplices in n-Polytopes.
V. Klee; P. Gritzmann; D. Larman
Discrete & computational geometry (1995)
- Volume: 13, Issue: 3-4, page 477-516
- ISSN: 0179-5376; 1432-0444/e
Access Full Article
top
How to cite
topKlee, V., Gritzmann, P., and Larman, D.. "Largest j-Simplices in n-Polytopes.." Discrete & computational geometry 13.3-4 (1995): 477-516. <http://eudml.org/doc/131376>.
@article{Klee1995,
author = {Klee, V., Gritzmann, P., Larman, D.},
journal = {Discrete & computational geometry},
keywords = {polytopes; largest simplices; computational complexity; inscribed simplices},
number = {3-4},
pages = {477-516},
title = {Largest j-Simplices in n-Polytopes.},
url = {http://eudml.org/doc/131376},
volume = {13},
year = {1995},
}
TY - JOUR
AU - Klee, V.
AU - Gritzmann, P.
AU - Larman, D.
TI - Largest j-Simplices in n-Polytopes.
JO - Discrete & computational geometry
PY - 1995
VL - 13
IS - 3-4
SP - 477
EP - 516
KW - polytopes; largest simplices; computational complexity; inscribed simplices
UR - http://eudml.org/doc/131376
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.