103
Views
2
CrossRef citations to date
0
Altmetric
Original Articles

Computing Maximal Copies of Polyhedra Contained in a Polyhedron

References

  • [Achterberg 09] Tobias Achterberg. “SCIP: Solving Constraint Integer Programs.” Mathematical Programming Computation 1 (2009), 1–41.
  • [Achterberg et al. 08] Tobias Achterberg, Timo Berthold, Thorsten Koch, and Kati Wolter. “Constraint Integer Programming: A New Approach to Integrate CP and MIP.” In Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, edited by Laurent Perron and Michael A. Trick, Lecture Notes in Computer Science 5015, pp. 6–20. Springer, 2008.
  • [Agarwal et al. 98] Pankaj K. Agarwal, Nina Amenta, and Micha Sharir. “Largest Placement of One Convex Polygon Inside Another.” Discrete and Computational Geometry 19 (1998), 95–104.
  • [Chazelle 83] Bernard Chazelle. “The Polygon Containment Problem.” In Advances in Computing Research I, edited by Franco P. Preparata, pp. 1–33. JAI Press, 1983.
  • [Croft 80] Hallard T. Croft. “On Maximal Regular Polyhedra Inscribed in a Regular Polyhedron.” Proceedings of the London Mathematical Society 3 (1980), 279–296.
  • [Croft et al. 91] Hallard T. Croft, Kenneth J. Falconer, and Richard K. Guy. Unsolved Problems in Geometry. Springer, 1991.
  • [Dilworth and Mane 10] Stephen J. Dilworth and Sateesh R. Mane. “On a Problem of Croft on Optimally Nested Regular Polygons.” Journal of Geometry 99 (2010), 43–66.
  • [Firsching 14] Moritz Firsching. “On Maximal Regular Polyhedra Inscribed in a Regular Polyhedron.” MathOverflow, 2014 (version: 2014-01-09). Available online (http://mathoverflow.net/q/154007).
  • [Gritzmann and Klee 94] Peter Gritzmann and Victor Klee. “On the Complexity of Some Basic Problems in Computational Convexity: I. Containment Problems.” Discrete Mathematics 136 (1994), 129–174.
  • [Hudelson et al. 96] Matthew Hudelson, Victor Klee, and David Larman. “Largest j-Simplices in d-Cubes: Some Relatives of the Hadamard Maximum Determinant Problem.” In Linear Algebra and Its Applications, pp. 519–598. Proceedings of the Fourth Conference of the International Linear Algebra Society, 1996.
  • [Kepler 19] Johannes Kepler. Harmonices Mundi. 1619.
  • [Lenstra et al. 82] Arjen K. Lenstra, Hendrik W. Lenstra, Jr, and László Lovász. “Factoring Polynomials with Rational Coefficients.” Mathematische Annalen 261 (1982), 515–534.
  • [Maehara et al. 09] Hiroshi Maehara, Imre Z. Ruzsa, and Norihide Tokushige. “Large Regular Simplices Contained in a Hypercube.” Periodica Mathematica Hungarica 58 (2009), 121–126.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.