Abstract
Relative to a given convex bodyC, aj-simplexS inC islargest if it has maximum volume (j-measure) among allj-simplices contained inC, andS isstable (resp.rigid) if vol(S)≥vol(S′) (resp. vol(S)>vol(S′)) for eachj-simplexS′ that is obtained fromS by moving a single vertex ofS to a new position inC. This paper contains a variety of qualitative results that are related to the problems of finding a largest, a stable, or a rigidj-simplex in a givenn-dimensional convex body or convex polytope. In particular, the computational complexity of these problems is studied both for
-polytopes (presented as the convex hull of a finite set of points) and forℋ-polytopes (presented as an intersection of finitely many half-spaces).
Article PDF
Similar content being viewed by others
References
[AK] D. Applegate and R. Kannan, Sampling and integration of near log-concave functions,Proc. 23rd ACM Symp. on Theory of Computing, 1990, pp. 156–163.
[BR] W. Blaschke and K. Reidemeister,Vorlesungen über Differentialgeometrie II. Affine Differentialgeometrie, Springer-Verlag, Berlin, 1923.
[B] L. M. Blumenthal,Distance Geometry, Oxford University Press, London, 1953.
[BGKV] H. Bodlaender, P. Gritzmann, V. Klee and J. Van Leeuwen, Computational complexity of norm-maximization,Combinatorica 10 (1990), 203–225.
[BCM] H. Brönniman, B. Chazelle, and J. Matoušek, Product range spaces, sensitive sampling and derandomization,Proc. 34th IEEE Symp. on Foundations of Computer Science, 1993, pp. 400–409.
[CM] S. Chandran and D. M. Mount, A parallel algorithm for enclosed and enclosing triangles,Internat. J. Comput. Geom. Appl. 2 (1992), 191–214.
[CEGS] B. Chazelle, H. Edelsbrunner, L. Guibas and M. Sharir, Diameter, width, closest line pair, and parametric searching,Discrete Comput. Geom. 10 (1993), 183–196.
[CS] K. Clarkson and P. Shor, Applications of random sampling to computational geometry. II,Discrete Comput. Geom. 4 (1989), 387–421.
[DS] D. P. Dobkin and L. Snyder. On a general method for maximizing and minimizing among certain geometric problems,Proc. 20th IEEE Symp. on Foundations of Computer Science, 1983, pp. 9–17.
[DF] M. E. Dyer and A. M. Frieze, Computing the volume of convex bodies: a case where randomness provably helps. InProbabilistic Combinatorics and Its Applications (B. Bollobás, ed.) Proceedings of Symposia in Applied Mathematics, Vol. 44, American Mathematical Society, Providence, RI, 1991, pp. 123–169.
[DGH] M. Dyer, P. Gritzmann, and A. Hufnagel, On the complexity of computing mixed volumes, Manuscript (1994).
[FGK] U. Faigle, N. Gademann, and W. Kern, A random polynomial time algorithm for well-rounding convex bodies,Discrete Math. (to appear).
[F] L. Fejes Tóth,Regular Figures, Pergamon Press, Oxford, 1964.
[GJ] M. Garey and D. S. Johnson,Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
[GK1] P. Gritzmann and V. Klee, On The 0–1 maximization of positive definite quadratic forms,Operations Research Proceedings 1988, Springer-Verlag, Berlin, 1989, pp. 222–227.
[GK2] P. Gritzmann and V. Klee, Deciding uniqueness in norm-maximization,Math. Programming 57 (1992), 203–214.
[GK3] P. Gritzmann and V. Klee, Computational complexity of inner and outerj-radii of convex polytopes,Math. Programming 59 (1993), 163–213.
[GK4] P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: I. Containment problems,Discrete Math. 136 (1994), 129–174. Reprinted in:New Trends in Discrete Mathematics (W. Deuber, H.-J. Prömel, and B. Voigt, eds.), North-Holland, Amsterdam, 1995, to appear.
[GK5] P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: II. Volume and mixed volumes. In:Polytopes: Abstract, Conves and Computational (T. Bisztriczky, P. McMullen, R. Schneider, and A. Ivic Weiss, eds.), Kluwer, Boston, 1994, pp. 373–466.
[GLS] M. Grötschel, L. Lovász and A. Schrijver,Geometric Algorithms and Combinatorial Optimization, Springer-Verlag, Berlin, 1988.
[G1] P. Gruber, Die meisten konvexen Körper sind glatt, aber nicht zu glatt,Math. Ann. 229 (1977), 259–266.
[G2] B. Grünbaum (with V. Klee, M. A. Perles, and G. C. Shephard),Convex Polytopes, Wiley-Interscience, London, 1967.
[HKL] M. Hudelson, V. Klee, and D. G. Larman, Largestj-simplices ind-cubes: Some relatives of the Hadamard maximum determinant problem, Manuscript, 1995.
[J] D. S. Johnson, A catalog of complexity classes. In:Handbook of Theoretical Computer Science. Vol. A (J. van Leeuwen, ed.), Elsevier and M.I.T. Press, Amsterdam and Cambridge, MA, 1990, pp. 67–161.
[K1] N. Karmarkar, A new polynomial-time algorithm for linear programming,Combinatorica 4 (1984), 373–397.
[K2] R. Karp, Reducibility among, combinatorial problems. In:Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.), Plenum, New York, 1972, pp. 85–103.
[K3] L. G. Khachiyan, Polynomial algorithms in linear programming,U.S.S.R. Comput. Math. and Math. Phys. 20 (1980), 53–72.
[K4] V. Klee, Some new results on smoothness and rotundity in normed linear spaces,Math. Ann. 139 (1959), 51–63.
[K5] V. Klee, Facet centroids and volume minimization,Studia Sci. Math. Hungar. 21 (1986), 143–147.
[KL] V. Klee and M. C. Laskowski, Finding the smallest triangle containing a given convex polygon,J. Algorithms 6 (1985), 359–375.
[L] N. Linial, Hard enumeration problems in geometry and combinatorics,SIAM J. Algebraic Discrete Methods 7 (1986), 331–335.
[M1] A. M. Macbeath, An external property of the hypersphere,Math. Proc. Cambridge Philos. Soc. 47 (1951), 245–247.
[M2] J. R. McKinney, On maximal simplices in a central convex set,Mathematika 21 (1974), 38–44.
[M3] P. McMullen, The maximum number of faces of a convex polytipe,Mathematika 17 (1970), 179–184.
[MC] D. M. Mount and S. Chandran, A unified approach for finding enclosing and enclosed triangles,Proc. Allerton Conf. on Communications, Control, and Computing, 1988, pp. 87–96.
[OAMB] J. O'Rourke, A. Aggarwal, S. Maddila and M. Baldwin, An optimal algorithm for finding minimal enclosing triangles,J. Algorithms 7 (1986), 258–269.
[PS] C. H. Papadimitriou and K. Steiglitz, Some complexity results for the traveling salesman problem,Proc. 8th ACM Symp. on Theory of Computing, 1976, pp. 1–9.
[PY] C. H. Papadimitriou and M. Yannakakis, On recognizing integer polyhedra,Combinatorica 10 (1990), 107–109.
[P] J. Plesnik, NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two,Inform. Process. Lett. 8 (1979), 291–297.
[S1] J. Schaefer, The complexity of satisfiability problems,Proc. 10th Ann. ACM Symp. on Theory of Computing, 1978, pp. 216–226.
[S2] D. Slepian, The content of some extreme simplexes,Pacific J. Math. 31 (1969), 795–808.
[S3] D. M. Y. Sommerville,An Introduction to the Geometry of N Dimensions, Methuen, London, 1929 (reprinted in 1958 by Dover, New York).
[VY] G. Vegter and C. Yap, Minimal circumscribing simplices,Proc. 3rd Canadian Conf. on Computational Geometry, Vancouver, 1991, pp. 58–91.
[W] E. Weidner, A short note on Löwner-John simplices and volume approximation, Manuscript, 1994.
Author information
Authors and Affiliations
Additional information
The research of the first and second authors was supported in part by the Deutsche Forschungs-gemeinschaft and by a joint Max-Planck Research Award. The research of the second author was also supported in part by the Mittag-Leffler Institute and the National Science Foundation.
Rights and permissions
About this article
Cite this article
Gritzmann, P., Klee, V. & Larman, D. Largestj-simplices inn-polytopes. Discrete Comput Geom 13, 477–515 (1995). https://doi.org/10.1007/BF02574058
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574058