Geodesic
Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron
Informacionnye tehnologii i vyčislitelnye sistemy, no. 3 (2013), pp. 27-31

Voir la notice de l'article provenant de la source Math-Net.Ru

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. 
@article{ITVS_2013_3_a2,
     author = {D. S. Kokorev},
     title = {Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron},
     journal = {Informacionnye tehnologii i vy\v{c}islitelnye sistemy},
     pages = {27--31},
     publisher = {mathdoc},
     number = {3},
     year = {2013},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ITVS_2013_3_a2/}
}
TY  - JOUR
AU  - D. S. Kokorev
TI  - Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron
JO  - Informacionnye tehnologii i vyčislitelnye sistemy
PY  - 2013
SP  - 27
EP  - 31
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/ITVS_2013_3_a2/
LA  - ru
ID  - ITVS_2013_3_a2
ER  - 
%0 Journal Article
%A D. S. Kokorev
%T Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron
%J Informacionnye tehnologii i vyčislitelnye sistemy
%D 2013
%P 27-31
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ITVS_2013_3_a2/
%G ru
%F ITVS_2013_3_a2
D. S. Kokorev. Algorithm to find a convex polyhedron with maximum size inscribed in other polyhedron. Informacionnye tehnologii i vyčislitelnye sistemy, no. 3 (2013), pp. 27-31. http://geodesic.mathdoc.fr/item/ITVS_2013_3_a2/