CN105427374A - 3D (Three-dimensional) printing-oriented model decomposition and arrangement method - Google Patents

Abstract

The invention puts forwards a 3D (Three-dimensional) printing-oriented model decomposition and arrangement method. The method comprises the following steps: giving a model S and a printing space PV, calculating the decomposition of the initial pyramid attribute blocks of the model S, carrying out voxelization on the pyramid attribute blocks to generate a first initial intermediate solution isolu0; initializing an intermediate solution set ISolu={isolu0}, and initializing an optimal complete solution P*; for each intermediate solution isolui in the intermediate solution set ISolu, calculating one series of candidate intermediate solutions generated by the intermediate solutions, and solving an optimal decomposition and arrangement solution of the model S; and carrying out local optimization on a three-dimensional grid of a plurality of extracted blocks, causing the blocks to be more tightly arranged through the translation of each block along the negative direction of a Z axis, and therefore, obtaining the optimal decomposition and arrangement about the model S. The model is decomposed into few blocks, the few blocks are effectively arranged into a printing space, and therefore, a printing process is effectively carried out.

Description

A kind of model decomposition towards 3D printing and aligning method

Technical field

The present invention relates to a kind of decomposition of model of printing towards 3D and the optimization method of arrangement, be specifically related to a kind ofly be similar to the segmentation of the model of pyramid decomposition and beam search and the optimization method of arrangement based on model.

Background technology

3D prints, i.e. the one of rapid shaping technique, and it is a kind of based on digital model file, uses powdery metal or plastics etc. can jointing material, is carried out the technology of constructed object by the mode successively printed.

Recent years, 3D prints more and more mentioned by people, digital model file printout is become ability in kind, it is used widely in many industries.From technology realizes, 3D prints and is normally stacked up by printed material " in layer ", thus digital blueprint is become material object.And such 3D print procedure is all be limited within a print platform with certain space.So can the size of model and print platform be directly connected to and disposablely print finished product.When the overall size of model is beyond the size of print space, cannot be complete put prints into print platform, and this just needs us to decompose model, then the various piece of model is arranged and have printed in print space.For this problem, Hu (HU, R., LI, H., ZHANG, H., ANDCOHEN-OR, D.2014.Approximatepyramidalshapedecomposition.ACMTrans.o nGraph33,6,213:1 – 213:12) etc. people proposed a kind of the least possible method meeting the block of approximate pyramid attribute that model decomposition can be become in 2014, then these are met the block of approximate pyramid attribute separately, utilize fusion sediment rapid shaping (FDM) printer to print, can very effective saving propping material.But the method only considered block model decomposition being become approximate Pyramid, do not consider how to arrange these blocks enter in print space, effectively print.Luo (LUO, L., BARAN, I., RUSINKIEWICZ, S., ANDMATUSIK, W.2012.Chopper:Partitioningmodelsinto3D-printableparts.A CMTrans.onGraph31,6,129:1 – 129:9) etc. people 2012 propose method, a three-dimensional model can be resolved into many pieces, each independent block can be put in print space and print separately.Considered because have block number in this approach, the aesthetic property of assembling capacity and line of cut.But this method does not consider the constraint of propping material or time-write interval.Vanek (VANEK, J., GARCIA, J., BENES, B., MECH, R., CARR, N., STAVA, O., ANDMILLER, G.2014.PackMerger:A3Dprintvolumeoptimizer.ComputerGraphi csForum33,6,322 – 332) etc. a method proposing in 2014 of people, consider that the result how better decomposition model can make to arrange is better.The surface coat of the method first extraction model, be not carry out processing for solid model, then tetrahedralization process carried out to the shelly model extracted, then adopt bottom-up search strategy, first carry out model decomposition, recycling is decomposed the block obtained and is arranged.The problem of this method is, model decomposition has first been become some fixing blocks by it, and then goes arrangement with these blocks, and the space that result in search is reduced greatly, thus greatly reduces the possibility that algorithm can find optimum solution.The method is first decomposed, rearrange, we wish when the solution decomposition of this model and the problem of arrangement, and decompose and can carry out with arrangement simultaneously, the model decomposition situation so just making algorithm to traverse and arranging situation add all greatly.Because this is a NP-hard problem, we wish to find an approximate optimum solution within limited search time.Consider that current 3D printing shaping technique is mainly divided into two classes the need of supporting construction from forming process, one class is the bonding gunite based on dusty material, take 3DP as representative, another kind of be based on resin, plastic material take FDM as the moulding process of representative.In forming process, the former is without the need to supporting construction, and the overall time-write interval depends on the height of model on forming direction, and printed material depends on expending of three-dimensional model itself; The latter needs supporting construction, and overall time-write interval and material are determined jointly by three-dimensional model itself and propping material.Method disclosed by the invention is applicable to above two class moulding process, can consider the constraint that both are different respectively.In addition, decomposing with the process of arrangement, we wish that the block number that model is broken down into is less, so that later stage re-assemblying model.

Note: Pyramid defines, meet the shape of pyramid attribute, refer to, this shape has such base (bottom surface), the vertical line of this base (bottom surface) is done from any point of the inside of this shape, any point on this vertical line all at this shaped interior, the shape meeting above-mentioned character i.e. our said Pyramid.

Summary of the invention

The present invention, in order to solve the problem, proposes a kind of towards the model decomposition of 3D printing and the optimization method of arrangement.Model decomposition, based on the approximate pyramid decomposition of model and beam search strategy, can be become less block, and arrange in print space according to the constraint of different printing techniques, be applicable to powder printer and fusion sediment rapid shaping printer by the method.

The model decomposition printed towards 3D and an aligning method, comprise the following steps:

Step one: the pyramid attribute block decomposition that given a model S, print space PV, computation model S are initial, and by these pyramid attribute block voxelizations, generate first initial intermediate solution isolu ₀;

Step 2: initialization intermediate solution set ISolu={isolu ₀, initialization optimum separates P completely ^*;

Step 3: each intermediate solution isolu in ISolu is closed to middle disaggregation _i, calculate a series of candidate's intermediate solution that intermediate solution produces, and add candidate's intermediate solution set CSolu;

Step 4: to each csolu belonging to candidate's intermediate solution set CSolu _i, calculate its localized target functional value, and select the highest k of mark candidate's intermediate solution csolu ₀..., csolu _k-1, and make candidate's intermediate solution set CSolu={csolu ₀..., csolu _k-1;

Step 5: to each csolu belonging to candidate's intermediate solution set CSolu candidate intermediate solution _iif, candidate's intermediate solution csolu _ibe one to have separated completely, calculate its target function value, if candidate's intermediate solution csolu _itarget function value be greater than P ^*target function value, then P ^*=csolu _i; Otherwise give up this candidate's intermediate solution csolu _i;

If candidate's intermediate solution csolu _ibe not also one completely separate and the target function value of this intermediate solution is more than or equal to P ^*target function value, then by candidate's intermediate solution csolu _iadd intermediate solution set ISolu;

Step 6: if intermediate solution set ISolu is not empty, then jump to step 3; If intermediate solution set ISolu is empty, then P now ^*be the optimum solution solved, according to P ^*in the arranging situation of block inside print space, extract the actual 3D grid corresponding to model S of block of voxelization, namely solve the decomposition of model S and arrangement optimum solution;

Step 7: the 3D grid of multiple pieces step 6 extracted carries out local optimum, by each piece along the translation of Z axis negative direction, the consolidation more arranged by these blocks, thus, obtains the decomposition about the optimum of model S and arrangement.

Concrete steps in described step one are:

(1-1) model S is carried out the decomposition of pyramid attribute block, and convert these pyramid attribute blocks towards, make its bottom surface parallel with xoy plane, voxelization obtains a series of pieces of { p ₀, p ₁, p ₂... };

(1-2) initialization intermediate solution isolu ₀, at isolu ₀in, p ₀, p ₁, p ₂... be not all arranged into print space PV.

Concrete steps in described step 2 are:

(2-1) set of initialization intermediate solution, makes ISolu={isolu ₀;

(2-2) initialization optimum separates P completely ^*, make P ^*target function value be infinite minimum value.

The concrete steps of the calculated candidate intermediate solution in described step 3 are:

(3-1) initialization candidate intermediate solution set CSolu is empty;

(3-2) for each isolu belonging to intermediate solution set ISolu _i, in this intermediate solution, have block { p ₀, p ₁, p ₂... } be not arranged into print space PV, a series of candidate's intermediate solution can be produced when being aligned to each ad-hoc location of print space for each piece;

(3-3) all candidate's intermediate solutions produced in step (3-2) are added candidate's intermediate solution set CSolu.

Further, in step (3-2), be aligned to the ad-hoc location of print space for each piece in whole range mode or be aligned to each ad-hoc location of print space in component arrangement mode;

For each piece of p _i, it can rotate 0 ° around x, y or z-axis, 90 °, 180 ° or 270 °, then moves, by block p with the bottom of the form of moving window at print space _ibe aligned to each ad-hoc location of print space, produce a series of candidate's intermediate solution, in this case, a block be in outside print space is entered print space by complete arrangement, is called whole range;

In addition, a block p _iby a crosscut or perpendicular can also be divided into two block p earnestly _i0, p _i1, p _i0or p _i1rotate 0 ° around x, y or z-axis, 90 °, 180 ° or 270 °, then move, by block p with the bottom of the form of moving window at print space _i0or p _i1be aligned to each ad-hoc location of print space, produce a series of candidate's intermediate solution, in this case, a block be in outside print space is only split the partial block got off and is arranged into print space inside, remaining part forms an independent block, stay print space outside, be called component arrangement.

In described step 4 to the localized target functional value computing method of candidate's intermediate solution be:

Suppose the heap D that current print space inside has been made up of the block arranged by some, a block p arranges in print space by candidate's intermediate solution exactly, form a new heap D ' with D, define one and be used for assessing the localized target function arranged by block p into heap D:

$F_{local}(p,D)=\frac{{\mathrm{\Σ}}_{v\∈p\⊕D}{H}_{GAIN}(v,D)}{n^{\mathrm{\α}}}-\mathrm{\η}\·G_{PWD}(p\⊕D)$

N: block numbers all under current candidate intermediate solution, comprise arrangement or for arranging all pieces of numbers into print space;

V: voxel in the new heap D ' formed;

the number of voxel of all down suctions in the D ' that p, D are formed, the mistake that these down suctions will print

Journey is temporarily filled by dusty material;

H _gAIN(v, D): h _vthe i.e. height of voxel v in print space, H _pVthe i.e. height of whole print space;

α, η: user inputs appointment, adjustable parameter.

In described step 5 for the computing method of a target function value separated completely be:

$F_{global}=\frac{H\left(PV\right)-H\left(D\right)}{N^{\mathrm{\α}}}$

N: all block numbers completely in solution in print space;

H (PV): the height of print space;

H (D): the height of the heap D that all pieces are arranged in print space in solution completely;

α: user inputs appointment, adjustable parameter.

Above-mentioned algorithm is applicable to powder printer.

Further, change the objective function in step 5 into following objective function account form, foregoing description algorithm can be applicable to fusion sediment rapid shaping printer:

$F_{global}=\frac{V\left(S\right)-G_{FDM}\left(D\right)}{N^{\mathrm{\α}}}$

V (S): in step one to the quantity of voxels all after the voxelization of all pieces;

G _fDM(D): be the number of voxel of all down suctions in heap D;

N: all block numbers completely in solution in print space;

α: user inputs appointment, adjustable parameter.

Beneficial effect of the present invention is: solve printer model too large, can not put into the problem that print space prints, propose new algorithm, printing according to different printer retrains, model decomposition is become less block, effectively arranges into print space, print procedure is effectively carried out.

The method of the present invention is based on the approximate pyramid decomposition of model and beam search strategy, model decomposition can be become less block, and arrange in print space according to the constraint of different printing techniques, be applicable to powder printer and fusion sediment rapid shaping printer.

Note: intermediate solution, intermediate solution and incomplete solution, be made up of print space and the block be in outside print space, in intermediate solution, although the block that print space inside has some to arrange, also has at least one block not also to be arranged and enter print space inside.

Separate completely, be different from intermediate solution, all blocks have all been arranged and have entered print space inside.

Accompanying drawing explanation

Fig. 1 be by model tetrahedralization after sectional drawing;

Illustrate initial solution in Fig. 2, be made up of with empty PV some blocks be not arranged into PV on the left side;

Fig. 3 is for illustrating from the intermediate solution of the initial solution described in Fig. 2 after a whole range;

The intermediate solution that Fig. 4 is formed after a component arrangement for the intermediate solution illustrated in Fig. 3;

In Fig. 5, be by Fig. 4 show intermediate solution again through optimum solution that the result of a step whole range obtains;

Demonstrated in Figure 6 is the grid corresponding to model S extracted in the block of voxelization;

As shown in Figure 7, be namely the final result that Fig. 6 obtains after the local optimum of step (7);

The particular flow sheet of this algorithm of Fig. 8.

Embodiment:

Below in conjunction with accompanying drawing and embodiment, the invention will be further described.For the ease of understanding and illustrating, part shows the details of algorithm with the drawings forms of two dimension.

In order to realize decomposition and the arrangement of the model being applicable to powder printer and fusion sediment rapid shaping printer, the present invention adopts following technical scheme (describe for powder printer below, and in the end provide the description how this method being used for fusion sediment rapid shaping printer)

The particular flow sheet of this algorithm is shown in Fig. 8.

(1) given a model S, print space PV, calculates the initial pyramid attribute block of S and decomposes, and by these pyramid attribute block voxelizations, generate first initial intermediate solution isolu ₀(in this intermediate solution, all blocks are not all arranged into beating PV);

(2) initialization intermediate solution set ISolu={isolu ₀, initialization optimum separates P completely ^*;

(3) to each intermediate solution isolu in ISolu _i, calculate and produce its a series of candidate's intermediate solution, and add candidate's intermediate solution set CSolu; Empty

(4) to each csolu _ibelong to CSolu, calculate its mark (localized target functional value), and select the highest k of mark candidate's intermediate solution csolu ₀..., csolu _k-1, and make CSolu={csolu ₀..., csolu _k-1;

(5) to each csolu _ibelong to CSolu,

If csolu _ibe one to have separated completely, calculate its target function value, if csolu _itarget function value be greater than P ^*target function value, then P ^*=csolu _i; Otherwise give up csolu _i;

If csolu _ibe not also one completely separate and the target function value of this intermediate solution is more than or equal to P ^*target function value, then by csolu _iadd ISolu, ISolu=ISolu+{csolu _i;

(6) if ISolu is not empty, then step (3) is jumped to; If ISolu is empty, then P now ^*be the optimum solution solved, according to P ^*in the arranging situation of block inside print space, extract the actual 3D grid corresponding to S of block of voxelization, namely solve the decomposition of S and arrangement optimum solution.

As in Fig. 5, be by Fig. 4 show intermediate solution again through optimum solution that the result of a step whole range obtains.This solution is made up of three blocks, and the result height of arrangement is very low, is conducive to the print procedure of powder quick printer.

Demonstrated in Figure 6 is the grid corresponding to model S extracted in the block of voxelization.

(7) 3D grid of multiple pieces step 6 extracted carries out local optimum, by each piece along the translation of Z axis negative direction, the consolidation more that these blocks are arranged.Thus, we obtain decomposition about the optimum of model S and arrangement.

As shown in Figure 7, be namely the final result that Fig. 6 obtains after the local optimum of step (7).

Concrete steps in described step (1) are:

(1-1) S is carried out the decomposition of pyramid attribute block, and convert these pyramid attribute blocks towards, make its bottom surface parallel with xoy plane, voxelization obtains a series of pieces of { p ₀, p ₁1p ₂... };

In Fig. 1, illustrate a two-dimentional example, in figure, the left side lists initial input shape (and its Pyramid decomposes) respectively, and the voxelization result of its Pyramid resolved into (figure the right).

(1-2) initialization intermediate solution isolu ₀, at isolu ₀in, p ₀, p ₁, p ₂... be not all arranged into PV;

Illustrate initial solution in Fig. 2, be made up of with empty PV some blocks be not arranged into PV on the left side.

Concrete steps in described step (2) are:

(2-1) set of initialization intermediate solution, makes ISolu={isolu ₀;

(2-2) initialization optimum separates P completely ^*, make P ^*target function value be infinite minimum value;

The concrete steps of the calculated candidate intermediate solution in described step (3) are:

(3-1) set of initialization candidate intermediate solution is empty CSolu;

(3-2) for each isolu belonging to ISolu _i, in this intermediate solution, have block { p ₀, p ₁, p ₂... } be not arranged into PV.

For each piece of p _i, it can rotate 0 ° around x, y or z-axis, 90 °, 180 ° or 270 °, then moves (by block p in the bottom of print space with the form of moving window _ibe aligned to each ad-hoc location of print space), produce a series of candidate's intermediate solution.In this case, a block be in outside print space is entered print space by complete arrangement, and we are called whole range;

Fig. 3 is for we show from the intermediate solution of the initial solution described in Fig. 2 after a whole range.

In addition, a block p _iby a crosscut or perpendicular can also be divided into two block p earnestly _i0, p _i1(we filter out the situation that cutting result is not two pieces here), p _i0or p _i1rotate 0 ° around x, y or z-axis, 90 °, 180 ° or 270 °, then move (by block p in the bottom of print space with the form of moving window _i0or p _i1be aligned to each ad-hoc location of print space), produce a series of candidate's intermediate solution.In this case, a block be in outside print space is only split the partial block got off and is arranged into print space inside, and remaining part forms an independent block, and stay print space outside, we are called component arrangement.

The intermediate solution that Fig. 4 is formed after a component arrangement for the intermediate solution that we show in Fig. 3.

(3-3) all candidate's intermediate solutions produced in step (3-2) are added CSolu.

In described step (4) to the localized target functional value computing method of candidate's intermediate solution be:

Suppose the heap D that has been made up of the block arranged by some of current print space inside, a block p arranges in print space by candidate's intermediate solution exactly, forms a new heap D ' with D.We define one and are used for assessing the localized target function arranged by block p into heap D:

$F_{local}(p,D)=\frac{{\mathrm{\Σ}}_{v\∈p\⊕D}{H}_{GAIN}(v,D)}{n^{\mathrm{\α}}}-\mathrm{\η}\·G_{PWD}(p\⊕D)$

N: block number all under current candidate intermediate solution (comprise arrangement or for arranging all pieces of numbers into print space);

V: voxel in the new heap D ' formed;

the number of voxel of all down suctions in the D ' that p, D are formed, these down suctions are temporarily filled in the process printed by dusty material;

H _gAIN(v, D): h _vthe i.e. height of voxel v in print space, H _pVthe i.e. height of whole print space;

α, η: user inputs appointment, adjustable parameter.

Computing method for a target function value separated completely in described step (5) are:

$F_{global}=\frac{H\left(PV\right)-H\left(D\right)}{N^{\mathrm{\α}}}$

N: all block numbers completely in solution in print space;

H (PV): the height of print space;

H (D): the height of the heap D that all pieces are arranged in print space in solution completely;

α: user inputs appointment, adjustable parameter.

Finally, by changing the objective function in step (5) into following objective function account form, foregoing description algorithm can be applicable to fusion sediment rapid shaping printer:

$F_{global}=\frac{V\left(S\right)-G_{FDM}\left(D\right)}{N^{\mathrm{\α}}}$

V (S): in step (1) to the quantity of all voxels after the voxelization of all pieces;

G _fDM(D): be the number of voxel of all down suctions in heap D;

N: all block numbers completely in solution in print space;

α: user inputs appointment, adjustable parameter.

By reference to the accompanying drawings the specific embodiment of the present invention is described although above-mentioned; but not limiting the scope of the invention; one of ordinary skill in the art should be understood that; on the basis of technical scheme of the present invention, those skilled in the art do not need to pay various amendment or distortion that creative work can make still within protection scope of the present invention.

Claims (10)

1., towards model decomposition and the aligning method of 3D printing, it is characterized in that, comprise the following steps:

Step one: the pyramid attribute block decomposition that given a model S, print space PV, computation model S are initial, and by these pyramid attribute block voxelizations, generate first initial intermediate solution isolu ₀;

Step 2: initialization intermediate solution set ISolu={isolu ₀, initialization optimum separates P completely ^*;

Step 3: each intermediate solution isolu in ISolu is closed to middle disaggregation _i, calculate a series of candidate's intermediate solution that intermediate solution produces, and add candidate's intermediate solution set CSolu;

Step 4: to each csolu belonging to candidate's intermediate solution set CSolu _i, calculate its localized target functional value, and select the highest k of mark candidate's intermediate solution csolu ₀..., csolu _k-1, and make candidate's intermediate solution set CSolu={csolu ₀..., csolu _k-1;

Step 5: to each csolu belonging to candidate's intermediate solution set CSolu candidate intermediate solution _iif, candidate's intermediate solution csolu _ibe one to have separated completely, calculate its target function value, if candidate's intermediate solution csolu _itarget function value be greater than P ^*target function value, then P ^*=csolu _i; Otherwise give up this candidate's intermediate solution csolu _i;

If candidate's intermediate solution csolu _ibe not also one completely separate and the target function value of this intermediate solution is more than or equal to P ^*target function value, then by candidate's intermediate solution csolu _iadd intermediate solution set ISolu;

Step 6: if intermediate solution set ISolu is not empty, then jump to step 3; If intermediate solution set ISolu is empty, then P now ^*be the optimum solution solved, according to P ^*in the arranging situation of block inside print space, extract the actual 3D grid corresponding to model S of block of voxelization, namely solve the decomposition of model S and arrangement optimum solution;

Step 7: the 3D grid of multiple pieces step 6 extracted carries out local optimum, by each piece along the translation of Z axis negative direction, the consolidation more arranged by these blocks, thus, obtains the decomposition about the optimum of model S and arrangement.

2. as claimed in claim 1 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, the concrete steps in described step one are:

(1-1) model S is carried out the decomposition of pyramid attribute block, and convert these pyramid attribute blocks towards, make its bottom surface parallel with xoy plane, voxelization obtains a series of pieces of { p ₀, p ₁, p ₂... };

(1-2) initialization intermediate solution isolu ₀, at isolu ₀in, p ₀, p ₁, p ₂..., be not all arranged into print space PV.

3. as claimed in claim 1 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, the concrete steps in described step 2 are:

(2-1) set of initialization intermediate solution, makes ISolu={isolu ₀;

(2-2) initialization optimum separates P completely ^*, make P ^*target function value be infinite minimum value.

4. as claimed in claim 1 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, the concrete steps of the calculated candidate intermediate solution in described step 3 are:

(3-1) initialization candidate intermediate solution set CSolu is empty;

(3-2) for each isolu belonging to intermediate solution set ISolu _i, in this intermediate solution, have block { p ₀, p ₁, p ₂... } be not arranged into print space PV, a series of candidate's intermediate solution can be produced for each piece when being aligned to an ad-hoc location of print space;

(3-3) all candidate's intermediate solutions produced in step (3-2) are added candidate's intermediate solution set CSolu.

5. as claimed in claim 4 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, for in step (3-2), be aligned to each ad-hoc location of print space for each piece in whole range mode or be aligned to an ad-hoc location of print space in component arrangement mode.

6. as claimed in claim 5 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, for each piece of p _i, it can rotate 0 ° around x, y or z-axis, 90 °, 180 ° or 270 °, then moves, by block p with the bottom of the form of moving window at print space _ibe aligned to each ad-hoc location of print space, produce a series of candidate's intermediate solution, in this case, a block be in outside print space is entered print space by complete arrangement, is called whole range.

7. as claimed in claim 5 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, a block p _iby a crosscut or perpendicular can also be divided into two block p earnestly _i0,p _i1, p _i0or p _i1rotate 0 ° around x, y or z-axis, 90 °, 180 ° or 270 °, then move, by block p with the bottom of the form of moving window at print space _i0or p _i1be aligned to each ad-hoc location of print space, produce a series of candidate's intermediate solution, in this case, a block be in outside print space is only split the partial block got off and is arranged into print space inside, remaining part forms an independent block, stay print space outside, be called component arrangement.

8. as claimed in claim 1 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, in described step 4 to the localized target functional value computing method of candidate's intermediate solution be:

Suppose the heap D that current print space inside has been made up of the block arranged by some, a block p arranges in print space by candidate's intermediate solution exactly, form a new heap D ' with D, define one and be used for assessing the localized target function arranged by block p into heap D:

$F_{local}(p,D)=\frac{{\mathrm{\Σ}}_{v\∈p\⊕D}{H}_{GAIN}(v,D)}{n^{\mathrm{\α}}}-\mathrm{\η}\·G_{PWD}(p\⊕D)$

N: block numbers all under current candidate intermediate solution, comprise arrangement or for arranging all pieces of numbers into print space;

V: voxel in the new heap D ' formed;

the number of voxel of all down suctions in the D ' that D is formed, these down suctions are temporarily filled in the process printed by dusty material;

h _vthe i.e. height of voxel v in print space, H _pVthe i.e. height of whole print space;

α, η: user inputs appointment, adjustable parameter.

9. as claimed in claim 1 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, in described step 5 for the computing method of a target function value separated completely be:

$F_{global}=\frac{H\left(PV\right)-H\left(D\right)}{N^{\mathrm{\α}}}$

N: all block numbers completely in solution in print space;

H (PV): the height of print space;

H (D): the height of the heap D that all pieces are arranged in print space in solution completely;

α: user inputs appointment, adjustable parameter.

10. as claimed in claim 9 a kind of towards 3D print model decomposition and aligning method, it is characterized in that, change the objective function in step 5 into following objective function account form, foregoing description algorithm can be applicable to fusion sediment rapid shaping printer:

$F_{global}=\frac{V\left(S\right)-G_{FDM}\left(D\right)}{N^{\mathrm{\α}}}$

V (S): in step one to the quantity of voxels all after the voxelization of all pieces;

G _fDM(D): be the number of voxel of all down suctions in heap D;

N: all block numbers completely in solution in print space;

α: user inputs appointment, adjustable parameter.