ℕℙ-hardness of largest contained and smallest containing simplices for V- and H-polytopes

Discrete and Computational Geometry

Volumn 28, Issue 3, 2002, Pages 349-377

  Packer, Asa ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036823865     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-002-0745-8     Document Type: Article

References (24)

1. [BG] J. W. Boardman and A. F. H. Goetz, Sedimentary facies analysis using imaging spectrometry: a geophysical inverse problem, Proceedings of the Third AVIRIS Workshop, Jet Propulsion Laboratory, Pasadena, CA, 1991, JPL Publication 91-28, pp. 4-13.
2. [BGK1] A. Brieden, P. Gritzmann, and V. Klee, Oracle-polynomial-time approximation of smallest simplices containing convex bodies, manuscript, 1999.
3. [BGK2] A. Brieden, P. Gritzmann, and V. Klee, Oracle-polynomial-time approximation of largest simplices in convex bodies, Discrete Math. 221 (2000), 79-92.
4. [CM] S. Chandran and D. Mount, A parallel algorithm for enclosed and enclosing triangles, Internat. J. Comput. Geom. Appl. 2 (1992), 191-214.
5. [GJ] M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of ℕℙ-Completeness, Freeman, New York, 1979.
6. [GK1] P. Gritzmann and V. Klee, Computational complexity of inner and outer j-radii of polytopes in finite-dimensional normed spaces, Math. Programming 59 (1993), 163-213.
7. [GK2] P. Gritzmann and V. Klee, On the complexity of some basic problems in computational convexity: I. containment problems, Discrete Math. 136 (1994), 129-174.
8. [GKL] P. Gritzmann, V. Klee, and D. Larman, Largest j-simplices in n-polytopes, Discrete Comput. Geom. 13 (1995), 477-515.
9. [Go] A. F. H. Goetz, Imaging spectrometry for earth remote sensing, in Imaging Spectroscopy; Fundamentals and Prospective Applications (F. Toselli and J. Bodechtel, eds.), Kluwer, Dordrecht, 1992, pp. 1-19.
10. [HJ] R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985.
11. [HKL] M. Hudelson, V. Klee, and D. Larman, Largest j-simplices in d-cubes: some relatives of the Hadamard maximum determinant problem, Linear Algebra Appl. 241-243 (1996), 519-598.
12. [Ka] R. M. 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.
13. [Kl] V. Klee, Facet centroids and volume minimization, Studia Sci. Math. Hungar. 21 (1986), 143-147.
14. [KL] V. Klee and M. Laskowski, Finding the smallest triangle containing a given convex polygon, J. Algorithms 6 (1985), 359-375.
15. [La] M. Lassak, Parallelotopes of maximum volume in a simplex, Discrete Comput. Geom. 21 (1999), 449-462.
16. [LZM] G. Leng, Y. Zhang, and B. Ma, Largest parallelotopes contained in simplices, Discrete Math. 211 (2000), 111-123.
17. [OAMB] J. O'Rourke, A. Aggarwal, A. Maddila, and A. Baldwin, An optimal algorithm for finding minimal enclosing triangles, J. Algorithms 7 (1986), 258-269.
18. [Pa1] A. Packer, On certain optimal containment problems involving convex sets, Ph.D. thesis, University of Washington, Seattle, Washington, 2001.
19. [Pa2] A. Packer, Polynomial-time approximation of largest simplices in V-polytopes, submitted to Discrete Appl. Math.
20. [Re] R. Renner, The resolution of a compositional data set into mixtures of fixed source compositions, Appl. Statist. 42 (1993), 615-631.
21. [VY] G. Vegter and C. Yap, Minimal circumscribing simplices, Proceedings of the Third Canadian Con- ference on Computational Geometry, Vancouver. 1991, pp. 58-91.
22. [Wo] M. Wolbers, 1998, personal communication, cited in [BGK1].
23. [Zi] G. M. Ziegler, Lectures on Polytopes, Springer-Verlag, Berlin, 1995.
24. 3, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, 2000, ACM, New York, 2000, pp. 500-509.