An efficient adaptive space partitioning algorithm for electromagnetic scattering calculation of complex 3D models

The space partitioning algorithm based on the rounding and addressing operations has been proved to be an efficient space partitioning algorithm with the potential for real-time calculation.An improvement on this kind of space partitioning algorithms for solving complex 3D models is presented.Numerical examples show that the efficiency of the improved algorithm is better than that of the original method.When the size of most target elements is smaller than the size of spatial grids,the efficiency of the improved method can be more than four times of that of the original method.An adaptive method of space partitioning based on the improved algorithm is developed by taking the surface element density or the curvature as the threshold for deep partitioning and conducting the deep partitioning using the octree method.A computer program implementation for applying the method in some typical applications is discussed,and the performance in terms of the efficiency,reliability,and resource use is evaluated.Application testing shows that the results of the adaptive spacing partitioning are more convenient for the follow-up use than that of the basic uniform space partitioning.Furthermore,when it is used to calculate the electromagnetic scattering of complex targets by the ray tracing(RT)method,the adaptive space partitioning algorithm can reduce the calculation time of the RT process by more than 40%compared with the uniform space segmentation algorithm.

Fast,Exact and Robust Set Operations on Polyhedrons Using Localized Constructive Solid Geometry Trees

Regularized Boolean operations have been widely used in 3D modeling systems. However, evaluating Boolean operations may be quite numerically unstable and time consuming, especially for iterated set operations. A novel and unified technique is proposed in this paper for computing single and iterated set operations efficiently, robustly and exactly. An adaptive octree is combined with a nested constructive solid geometry （CSG） tree by this technique. The intersection handling is restricted to the cells in the octree where intersection actually occurs. Within those cells, a CSG tree template is instanced by the surfaces and the tree is converted to planebased binary space partitioning （BSP） for set evaluation; Moreover, the surface classification is restricted to the ceils in the octree where the surfaces only come from a model and are within the bounding-boxes of other polyhedrons. These two ways bring about the efficiency and scalability of the operations, in terms of runtime and memory. As all surfaces in such a cell have the same classification relation, they are classified as a whole. Robustness and exactness are achieved by integrating plane-based geometry representation with adaptive geometry predicate technique in intersection handling, and by applying divide-and-conquer arithmetic on surface classification. Experimental results demonstrate that the proposed approach can guarantee the robustness of Boolean computations and runs faster than other existing approaches.

Gravity-based heuristic for set covering problems and its application in fault diagnosis

A novel algorithm named randomized binary gravita- tional search （RBGS） algorithm is proposed for the set covering problem （SCP）. It differs from previous SCP approaches because it does not work directly on the SCP matrix. In the proposed algo- rithm, the solution of SCP is viewed as multi-dimension position of objects in the binary search space. All objects in the space attract each other by the gravity force, and this force causes a global movement of all objects towards the objects with heavier masses which correspond to good solutions. Computation results show that the proposed algorithm is very competitive. In addition, the proposed aigodthm is extended for SCP to solve the fault diagno- sis problem in graph-based systems.