In the process of boundary tracking we not only record the boundary points,but also revise the area that the point belongs to,and according to this algorithm,designs a kind of two-dimensional chain table to record the boundary points.

Data structures and algorithm implementation of two-dimension and multi-dimension linked lists;

By the research of multi-dimension linked lists,it would be given out of the mathematical model and recursive arithmetic of multi-dimension linked lists.

By the research of database index,A new and efficient database index built by multi-dimension linked lists is given out ,and also main problems of the database index are discussed there.

Some key information such as sessions and their corresponding states,operation results were saved by using a two-dimensional linked list in parallel reassembly process.

Then we have brought forward a method of three dimensional regular chain,and introduced the data structure of this rule.

The Ant Colony Optimization is used to search the solution space,with the means of two-dimension link structure,although progressive decomposition of the packing space to loading many kinds of rectangular packing objects,and the effective coding and decoding method is given.