管材パッキングのシミュレーション(シミュレーションの世界)

概要

論文の詳細を見る
This paper presents a simulation method for estimating the smallest size of a hole that should be made through a wall in order to lay a given set of pipes between the two rooms bounded by the wall. This optimization problem is reduced to a disk packing problem such that, given a set of disks, we want to find the smallest enclosing circle including all the disks without overlap. The problem is approximately solved by simulating the human behavior of shaking the disks in a container while shrinking the container. To achieve this simulation, we employ the circle Voronoi diagram, which is the partition of the plane into regions consisting of points nearest to the associated disks. The circle Voronoi diagram gives us information about the structure of the empty space around the disks, and consequently enables us to find the possible movement of the disks efficiently. Also a digital picture approximation of the Voronoi diagram is used in order to make the computation robust against numerical errors.
日本シミュレーション学会の論文
2005-06-15