| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4961315 | Procedia Computer Science | 2016 | 6 Pages |
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. This method requires a fairly good initial solution obtained by more inaccurate methods. Disadvantages of these methods are considered. This methods analogue, based on the nonlinear programming problem, is offered. Research results and future development plans are written.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Denis Kokorev, Nikolay Piskovatskii,