An algorithm to solve 3D guard zone computation problem

Abstract

The guard zone computation problem finds vast applications in the field of VLSI physical design automation and design of embedded systems, where one of the major purposes is to find an optimized way to place a set of 2D blocks on a chip floor. Each (group of) circuit component(s) Ci is associated with a parameter δi, such that a minimum clearance zone of width δi is to be maintained around Ci. In this paper, we introduce the problem in its 3D version. Considering 3D simple solid objects makes the guard zone computation problem more complex and helps to solve many real life problems like VLSI physical design, Geographical Information System, motion control in robotics, and embedded systems. In this paper, we develop an algorithm to compute guard zone of a 3D solid object detecting and excluding overlapped regions among the guard zonal regions, if any.