|
|
Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2013, Issue 3, Pages 27–31
(Mi itvs122)
|
|
|
|
MATHEMATICAL MODELING
Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron
D. S. Kokorev Moscow Institute of Physics and Technology (State University), Dolgoprudny, Moscow region
Abstract:
The article discusses problem of finding the polyhedrons given shape inside another polyhedrons. It is proposed method for finding the inscribed polyhedrons, based on the reduction of the problem to a nonlinear programming problem and its solutions with ready-made software resources. Also it is proposed possible optimizations to speed up the algorithm.
Keywords:
convex polyhedrons, combinatorial structure, inscribed polyhedron, nonlinear programming problems, solver.
Citation:
D. S. Kokorev, “Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2013, no. 3, 27–31
Linking options:
https://www.mathnet.ru/eng/itvs122 https://www.mathnet.ru/eng/itvs/y2013/i3/p27
|
| Statistics & downloads: |
| Abstract page: | 119 | | Full-text PDF : | 228 | | References: | 2 |
|