CN104890236B - The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing - Google Patents
The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing Download PDFInfo
- Publication number
- CN104890236B CN104890236B CN201510155677.7A CN201510155677A CN104890236B CN 104890236 B CN104890236 B CN 104890236B CN 201510155677 A CN201510155677 A CN 201510155677A CN 104890236 B CN104890236 B CN 104890236B
- Authority
- CN
- China
- Prior art keywords
- block
- scan lines
- blockother
- blockcur
- endpoint
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Abstract
The invention discloses a kind of Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing, the present invention is that all scan lines are switched into principle with least hops to carry out subregion, each block includes as far as possible many scan lines, after piecemeal, all blocks are sorted again, so as to realize the efficient sequence of scan lines.Paths ordering of the present invention with blockette reduces jump distance, improves scan efficiency；The paths ordering of blockette causes that scanning pattern integration degree is higher, and printing continuity degree is high, the characteristics of be favorably improved shaping strength.
Description
Technical field
The present invention relates to 3D printing technique field, more particularly, to a kind of 3D printing that can effectively improve scan efficiency
Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method.
Background technology
In 3D printing（Rapid shaping）In technical field, SLA（Stereo Lithography Apparatus）Technique is
A kind of Layered Manufacturing Technology, computer controls laser beam, for the surface of raw material is scanned, is scanned region to photosensitive resin
Thin resin layer produces photopolymerization reaction and solidifies, and forms a thin layer of part.Workbench moves down a distance for thickness, so as to
The new liquid resin of last layer is applied again in the resin surface being cured, and next layer of scanning machining is carried out, so repeatedly, until whole
Individual raw basin is finished.
The work of SLA is mainly photosensitive resin material is scanned, and scanning is divided into the scanning to supporting construction again, to mould
The scanning of type profile and the scanning to model entity, the among these scanning to model entity occupy the workload of maximum.Entity is swept
Retouching path is present in the line segment form of substantial amounts of individual segmentation, and just scanning pattern must be entered when mould shapes are more complicated
Row rational sorting, it is to avoid excessively redirect.Therefore the operating efficiency to the sequence of model entity scanning pattern for SLA is to closing weight
Will.
Scan lines generally are obtained by the way of grid scanning, after scan lines are obtained, if not to scan line
Duan Jinhang effective and reasonable sequence, then occur in print procedure it is more redirect, cause scan efficiency to reduce.
Chinese patent mandate publication number：CN104057611A, authorizes publication date September in 2014 24, discloses a kind of base
In the 3D printing fill path generation method of scan line inclination angle optimization, comprise the following steps：Step 1, according to 3D printing equipment with
And printing precision requirement determines suitable fill path spacing and thickness, and obtain needing the SLC files of processing entity according to thickness；
Step 2, using fill path spacing as offset or dish generation Contour offset path, and innermost layer bias path is biased
To biasing polygon Ω；Step 3, the scan line inclination angle that each layer is determined according to processing efficiency and printing precision specific requirement；Step
4th, internal fill path is generated with the intersection point of biasing polygon Ω according to scan line inclination angle and scan line.The deficiency of the invention
Place is low scan efficiency.
The content of the invention
Goal of the invention of the invention is to overcome the scan efficiency of scanning pattern generation method of the prior art low
It is not enough, there is provided a kind of Stereo Lithography Apparatus Rapid Prototyping scanning pattern sequence side of 3D printing that can effectively improve scan efficiency
Method.
To achieve these goals, the present invention uses following technical scheme：
A kind of Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing, comprises the following steps：
（1-1）Set up the two-dimensional array of each scan lines：
Cut using horizontal grid, obtain all scan lines that object is vertically arranged in order, set each and sweep
The data structure of line segment is retouched for SEGMENT, SEGMENT includes characterizing the attribute Point of scan lines left end point, characterizes scan line
The attribute OtherPoint of section right endpoint, characterizes the attribute BIndex of block index where scan lines；
It is M to set scan lines horizontal direction maximum number, and vertical direction maximum number is N, then will be positioned at vertical direction
The m articles scan lines of line n are stored as array Segments [n] [m], n ∈ N, m ∈ M；
（1-2）All scan lines are traveled through, according to scan lines Duplication OverlapRatio and jump distance
All scan lines are divided into K block BLOCK by TravelDistance：
Block lists as Blocks [K] are set, the initial value of maximum block index MaxBIndex is 0, the minimum weight of setting
Folded rate MinOverlapRatio and maximum jump are apart from MaxTravelDistance；
（1-2-1）Current scan lines as Segments [n] [m] are set, the next line scan lines of current line are
Segments[n-1][:], Current Scan line segment Segments [n] [m] and all scan lines of next line are carried out respectively
Match somebody with somebody：
Segments[n-1][:] in, n-1 represents line number, colon:The uncertain implication of columns is represented,:Can be 1 to L,
L is natural number.N and m characterizes the numerical value of determination respectively in Segments [n] [m], and Segments [n] [m] represents determination
Scan lines.
Assuming that Segments [n] [m] is SegmentA, Segments [n-1] [:] in any bar scan lines be
SegmentB, then calculate the overlap distance OverlapDistance of SegmentA and SegmentB, and calculate using following formula
Duplication OverlapRatio and jump distance TravelDistance：
OverlapRatio = OverlapDistance / |SegmentB.Point -
SegmentB.OtherPoint |,
TravelDistance = Min{
| SegmentA.Point-SegmentB.Point |,
| SegmentA.Point-SegmentB.OtherPoint |,
| SegmentA.OtherPoint- SegmentB.Point |,
|SegmentA.OtherPoint- SegmentB.OtherPoint| }；
Setup parameter MinOverlapRatio and MaxTravelDistance；
Overlap distance OverlapDistance is the length that two scan lines overlap, SegmentA.Point and
SegmentA.OtherPoint represents the left end point and right endpoint of SegmentA respectively；
SegmentB.Point and SegmentB.OtherPoint represent the left end point and right endpoint of SegmentB respectively；
To Segments [n-1] [:] in L bars scan lines sequentially calculate OverlapRatio with Segments [n] [m]
And TravelDistance,
If OverlapRatio>MinOverlapRatio, then be judged to matching；
If OverlapRatio≤MinOverlapRatio
And TravelDistance<MaxTravelDistance, then be judged to matching；
If OverlapRatio≤MinOverlapRatio
And TravelDistance >=MaxTravelDistance, is judged to mismatch；
When result of determination is for matching, then the BIndex of Segments [n] [m] is set to all scan lines of lastrow
Section in corresponding that scan lines Bindex, show to belong to same block, at the same terminate to Segments [n] [m]
With judgement；
When result of determination is to mismatch, then making the BIndex of Segments [n] [m] increases by 1, shows that this is one new
Block, while making MaxBIndex increase by 1；
After all scan lines traversal is completed, time zone is distributed by scan lines according to the BIndex of every scan lines
In block list Block [K]；
（1-3）Each block is sorted apart from BlockDistance according to block：
The data structure BLOCK, BLOCK set up for description block feature include characterizing the beginning scan lines of block
Attribute StartSegment, characterize the attribute EndSegment of the ends scan lines of block, characterize the attribute that whether overturns
IsFlip, any one block is used as original block BlockCur in selecting block lists Blocks [K]；
（1-3-1）Original block BlockCur is stored in sequence block lists SortBlocks [K], respectively calculation block
The block of each block in list Blocks [K] and BlockCur apart from BlockDistance, by minimum
Block corresponding to BlockDistacne is used as arest neighbors block BlockNearest；
（1-3-2）BlockNearest is stored in SortBlocks [K], and is removed from block lists Blocks [K]
BlockCur, using BlockNearest as new BlockCurt；
（1-3-3）Repeat step（1-3-1）Extremely（1-3-2）Until only one in block lists Blocks [K]；
（1-4）The order for being stored in SortBlocks [K] according to block extracts the scan lines inside each block successively, extremely
This, completes the sequence of all scan lines.
3D printing generally obtains scan lines by the way of grid scanning, after scan lines are obtained, if not right
Scan lines carry out effective and reasonable sequence, then occur in print procedure it is more redirect, cause scan efficiency to reduce.
The present invention is that all scan lines are switched into principle with least hops to carry out subregion, and each block is comprising as far as possible more
All blocks after piecemeal, then are sorted by scan lines, so as to realize the efficient sequence of scan lines, and the scanning for obtaining
Path redirects less, and printing continuity degree is high.
Therefore, paths ordering of the present invention with blockette reduces jump distance, improves scan efficiency；Blockette
Paths ordering causes that scanning pattern integration degree is higher, and printing continuity degree is high, the characteristics of be favorably improved shaping strength.
Preferably, the step（1-3-1）Also comprise the following steps：
Setting any one block structure BLOCK includes two line segments of scan lines StartSegment and EndSegment
Structure, scan lines StartSegment includes left end point StartPoint and right endpoint StartOtherPoint, scan lines
EndSegment includes left end point EndPoint and right endpoint EndOtherPoint；Then setting BlockDistance is
Two the terminal Bs lockCur.EndPoint, BlockCur.EndOtherPoint of BlockCur respectively with block lists
Four terminal B lockOther.StartPoint of remaining block BlockOther in Blocks [K],
The distance of BlockOther.StartOtherPoint, BlockOther.EndPoint, BlockOther.EndOtherPoint
Minimum value；
The computational methods of BlockDistance are as follows：
BlockDistance = Min{
|BlockCur.EndPoint - BlockOther.StartPoint|,
|BlockCur.EndPoint - BlockOther.StartOtherPoint|,
|BlockCur.EndPoint - BlockOther.EndPoint |,
|BlockCur.EndPoint - BlockOther.EndOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.StartPoint|,
|BlockCur.EndOtherPoint- BlockOther.StartOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.EndPoint |,
|BlockCur.EndOtherPoint- BlockOther.EndOtherPoint| }。
Preferably, also comprising the following steps：
If the Segment for obtaining the BlockDistance of minimum is block structure BlockNearest
EndSegment, i.e.,
Max{|BlockCur.EndPoint - BlockOther.EndPoint |,|BlockCur.EndPoint -
BlockOther.EndOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.EndPoint |,
|BlockCur.EndOtherPoint- BlockOther.EndOtherPoint|} < Min{|
BlockCur.EndPoint - BlockOther.StartPoint|,
|BlockCur.EndPoint - BlockOther.StartOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.StartPoint|,|
BlockCur.EndOtherPoint-BlockOther.StartOtherPoint|}；
Then representing BlockNearest should be reversed to obtain the jump distance of minimum, even:
BlockNearest.IsFlip = True；
Step（1-4）Replaced by following steps：
The order for being stored in SortBlocks [K] according to block extracts the scan lines inside each block successively, wherein, tool
There is the scan lines backward inside the block of upset mark BlockNearest.IsFlip=True to extract, so far, complete
The sequence of all scan lines.
Typically according in the order extraction block structure BlockNearest of EndSegment after first StartSegment
Scan lines, when the upset mark that there is BlockNearest.IsFlip=True in block structure BlockNearest
When, it is necessary to extract the scan line in block structure BlockNearest according to the order of StartSegment after first EndSegment
Section.So sequence can make the jump distance between block minimum.
Therefore, the present invention has the advantages that：
（1）The paths ordering of blockette reduces jump distance, improves scan efficiency；
（2）The paths ordering of blockette causes that scanning pattern integration degree is higher, and printing continuity degree is high, helps to carry
Shaping strength high.
Brief description of the drawings
Fig. 1 is a kind of structural representation of the scan lines of object of the invention；
Fig. 2 is a kind of schematic diagram of OverlapDistance of the invention；
Fig. 3 is a kind of schematic diagram of TravelDistance of the invention；
Fig. 4 be it is of the invention be embodiment a kind of flow chart.
In figure：Block1 1、Block2 2、Block3、SegmentA 4、SegmentB.
Specific embodiment
The present invention will be further described with reference to the accompanying drawings and detailed description.
Embodiment as shown in Figure 4 is a kind of Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing, bag
Include following steps：
Step 100, the two-dimensional array of each scan lines is set up according to the scan lines for obtaining：
In advance by the profile of object input computer, obtain as shown in Figure 1 along Vertical Square using horizontal grid cutting
To all scan lines being arranged in order, following calculating process are carried out in a computer：
The data structure for setting each scan lines is SEGMENT, and SEGMENT includes characterizing the category of scan lines left end point
Property Point, characterize scan lines right endpoint attribute OtherPoint, characterize scan lines where block index attribute
BIndex；
3 block Block1 1, Block2 2, Block3 are provided with Fig. 1, scan lines are provided with each block
SEGMENT, every line segment is equipped with left end point Point and right endpoint OtherPoint.
It is M to set scan lines horizontal direction maximum number, and vertical direction maximum number is N, then will be positioned at vertical direction
The m articles scan lines of line n are stored as array Segments [n] [m], n ∈ N, m ∈ M；
Step 200, travels through all scan lines, according to scan lines Duplication OverlapRatio and jump distance
All scan lines are divided into K block BLOCK by TravelDistance：
Block lists as Blocks [K] are set, the initial value of maximum block index MaxBIndex is 0, the minimum weight of setting
Folded rate MinOverlapRatio and maximum jump are apart from MaxTravelDistance；
Step 210, sets current scan lines as Segments [n] [m], and the next line scan lines of current line are
Segments[n-1][:], Current Scan line segment Segments [n] [m] and all scan lines of next line are carried out respectively
Match somebody with somebody：
As illustrated in fig. 2, it is assumed that Segments [n] [m] is SegmentA, Segments [n-1] [:] in any bar scan line
Section is SegmentB, then calculate the overlap distance OverlapDistance of SegmentA and SegmentB, and utilize following formula
Calculate Duplication OverlapRatio and jump distance TravelDistance：
OverlapRatio = OverlapDistance / |SegmentB.Point -
SegmentB.OtherPoint |,
As shown in figure 3,
TravelDistance = Min{
| SegmentA.Point-SegmentB.Point |,
| SegmentA.Point-SegmentB.OtherPoint |,
| SegmentA.OtherPoint- SegmentB.Point |,
|SegmentA.OtherPoint- SegmentB.OtherPoint| }；
Setup parameter MinOverlapRatio and MaxTravelDistance；
To Segments [n-1] [:] in L bars scan lines sequentially calculate OverlapRatio with Segments [n] [m]
And TravelDistance,
If OverlapRatio>MinOverlapRatio, then be judged to matching；
If OverlapRatio≤MinOverlapRatio
And TravelDistance<MaxTravelDistance, then be judged to matching；
If OverlapRatio≤MinOverlapRatio
And TravelDistance >=MaxTravelDistance, is judged to mismatch；
When result of determination is for matching, then the BIndex of Segments [n] [m] is set to all scan lines of lastrow
Section in corresponding that scan lines Bindex, show to belong to same block, at the same terminate to Segments [n] [m]
With judgement；
When result of determination is to mismatch, then making the BIndex of Segments [n] [m] increases by 1, shows that this is one new
Block, while making MaxBIndex increase by 1；
After all scan lines traversal is completed, time zone is distributed by scan lines according to the BIndex of every scan lines
In block list Block [K]；
Step 300, sorts apart from BlockDistance according to block to each block：
The data structure BLOCK, BLOCK set up for description block feature include characterizing the beginning scan lines of block
Attribute StartSegment, characterize the EndSegment of the ends scan lines attribute of block, characterize the attribute that whether overturns
IsFlip, any one block is used as original block BlockCur in selecting block lists Blocks [K]；
Step 310, original block BlockCur is stored in sequence block lists SortBlocks [K], and area is calculated respectively
The block of each block in block list Blocks [K] and BlockCur apart from BlockDistance, by minimum
Block corresponding to BlockDistacne is used as arest neighbors block BlockNearest；
Setting any one block structure BLOCK includes two line segments of scan lines StartSegment and EndSegment
Structure, scan lines StartSegment includes left end point StartPoint and right endpoint StartOtherPoint, scan lines
EndSegment includes left end point EndPoint and right endpoint EndOtherPoint；Then setting BlockDistance is
Two the terminal Bs lockCur.EndPoint, BlockCur.EndOtherPoint of BlockCur respectively with block lists
Four terminal B lockOther.StartPoint of remaining block BlockOther in Blocks [K],
The distance of BlockOther.StartOtherPoint, BlockOther.EndPoint, BlockOther.EndOtherPoint
Minimum value；
The computational methods of BlockDistance are as follows：
BlockDistance = Min{
|BlockCur.EndPoint - BlockOther.StartPoint|,
|BlockCur.EndPoint - BlockOther.StartOtherPoint|,
|BlockCur.EndPoint - BlockOther.EndPoint |,
|BlockCur.EndPoint - BlockOther.EndOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.StartPoint|,
|BlockCur.EndOtherPoint- BlockOther.StartOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.EndPoint |,
|BlockCur.EndOtherPoint- BlockOther.EndOtherPoint| }；
Step 320, is stored in SortBlocks [K], and removed from block lists Blocks [K] by BlockNearest
BlockCur, using BlockNearest as new BlockCurt；
If the Segment for obtaining the BlockDistance of minimum is block structure BlockNearest
EndSegment, i.e.,
Max{|BlockCur.EndPoint - BlockOther.EndPoint |,|BlockCur.EndPoint -
BlockOther.EndOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.EndPoint |,
|BlockCur.EndOtherPoint- BlockOther.EndOtherPoint|} < Min{|
BlockCur.EndPoint - BlockOther.StartPoint|,
|BlockCur.EndPoint - BlockOther.StartOtherPoint|,
|BlockCur.EndOtherPoint- BlockOther.StartPoint|,|
BlockCur.EndOtherPoint-BlockOther.StartOtherPoint|}；
Then representing BlockNearest should be reversed to obtain the jump distance of minimum, even:
BlockNearest.IsFlip = True；
Step 330, repeat step 310 to 320 are until only one in block lists Blocks [K]；
Step 400, the order for being stored in SortBlocks [K] according to block extracts the scan line inside each block successively
Section, wherein, the scan lines backward inside the block with upset mark BlockNearest.IsFlip=True is extracted, extremely
This, completes the sequence of all scan lines.
It should be understood that the present embodiment is only illustrative of the invention and is not intended to limit the scope of the invention.In addition, it is to be understood that
Read after the content of instruction of the present invention, those skilled in the art can make various changes or modifications to the present invention, these etc.
Valency form equally falls within the application appended claims limited range.
Claims (3)
1. the Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of a kind of 3D printing, it is characterized in that, comprise the following steps：
(1-1) sets up the two-dimensional array of each scan lines：
Cut using horizontal grid, obtain all scan lines that object is vertically arranged in order, set each scan line
The data structure of section is SEGMENT, and SEGMENT includes characterizing the attribute Point of scan lines left end point, characterizes scan lines right
The attribute OtherPoint of end points, characterizes the attribute BIndex of block index where scan lines；
It is M to set scan lines horizontal direction maximum number, and vertical direction maximum number is N, then will be positioned at vertical direction line n
The m articles scan lines be stored as array Segments [n] [m], n ∈ N, m ∈ M；
(1-2) travels through all scan lines, according to scan lines Duplication OverlapRatio and jump distance
All scan lines are divided into K block BLOCK by TravelDistance：
Block lists as Blocks [K] are set, the initial value of maximum block index MaxBIndex is 0, sets minimum overlay rate
MinOverlapRatio and maximum jump are apart from MaxTravelDistance；
(1-2-1) sets current scan lines as Segments [n] [m], and the next line scan lines of current line are
Segments[n-1][：], Current Scan line segment Segments [n] [m] and all scan lines of next line are carried out respectively
Match somebody with somebody：
Assuming that Segments [n] [m] is SegmentA, Segments [n-1] [：] in any bar scan lines be SegmentB,
The overlap distance OverlapDistance of SegmentA and SegmentB is then calculated, and Duplication is calculated using following formula
OverlapRatio and jump distance TravelDistance：
OverlapRatio=OverlapDistance/ | SegmentB.Point-SegmentB.OtherPoint |,
TravelDistance=Min
| SegmentA.Point-SegmentB.Point |,
| SegmentA.Point-SegmentB.OtherPoint |,
| SegmentA.OtherPoint-SegmentB.Point |,
|SegmentA.OtherPoint-SegmentB.OtherPoint|}；
Wherein, SegmentA.Point represents the left end point of line segment SegmentA, and SegmentA.OtherPoint represents line segment
The right endpoint of SegmentA, SegmentB.Point represents the left end point of line segment SegmentB, SegmentB.OtherPoint tables
The right endpoint of timberline section SegmentB；
Setup parameter MinOverlapRatio and MaxTravelDistance；
To Segments [n-1] [：] in L bars scan lines sequentially calculate with the OverlapRatio of Segments [n] [m] and
TravelDistance,
If OverlapRatio ＞ MinOverlapRatio, it is judged to matching；
If OverlapRatio≤MinOverlapRatio
And TravelDistance ＜ MaxTravelDistance, then be judged to matching；
If OverlapRatio≤MinOverlapRatio
And TravelDistance >=MaxTravelDistance, is judged to mismatch；
When result of determination is for matching, then the BIndex of Segments [n] [m] is set in all scan lines of lastrow
The Bindex of corresponding that scan lines, shows to belong to same block, while terminating to sentence the matching of Segments [n] [m]
It is disconnected；
When result of determination is to mismatch, then making the BIndex of Segments [n] [m] increases by 1, shows that this is a new area
Block, while making MaxBIndex increase by 1；
After all scan lines traversal is completed, scan lines are distributed according to every BIndex of scan lines is arranged into block
In table Block [K]；
(1-3) sorts apart from BlockDistance according to block to each block：
The data structure BLOCK, BLOCK set up for description block feature include the attribute of the beginning scan lines for characterizing block
StartSegment, characterizes the attribute EndSegment of the end scan lines of block, the attribute IsFlip whether sign overturns,
Any one block is used as original block BlockCur in selected block lists Blocks [K]；
Be stored in original block BlockCur in sequence block lists SortBlocks [K] by (1-3-1), calculation block list respectively
The block of each block in Blocks [K] and BlockCur apart from BlockDistance, by minimum BlockDistacne institutes
Corresponding block is used as arest neighbors block BlockNearest；
BlockNearest is stored in SortBlocks [K] by (1-3-2), and is removed from block lists Blocks [K]
BlockCur, using BlockNearest as new BlockCurt；
(1-3-3) repeat step (1-3-1) to (1-3-2) is until only one in block lists Blocks [K]；
(1-4) extracts the scan lines inside each block according to the order that block is stored in SortBlocks [K] successively, so far,
Complete the sequence of all scan lines.
2. the Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing according to claim 1, it is characterized in that,
The step (1-3-1) also comprises the following steps：
Setting any one block structure BLOCK includes two line segment knots of scan lines StartSegment and EndSegment
Structure, scan lines StartSegment includes left end point StartPoint and right endpoint StartOtherPoint, scan lines
EndSegment includes left end point EndPoint and right endpoint EndOtherPoint；Then setting BlockDistance is
Two the terminal Bs lockCur.EndPoint, BlockCur.EndOtherPoint of BlockCur respectively with block lists
Four terminal B lockOther.StartPoint of remaining block BlockOther in Blocks [K],
The distance of BlockOther.StartOtherPoint, BlockOther.EndPoint, BlockOther.EndOtherPoint
Minimum value；
The computational methods of BlockDistance are as follows：
BlockDistance=Min
| BlockCur.EndPoint-BlockOther.StartPoint |,
| BlockCur.EndPoint-BlockOther.StartOtherPoint |,
| BlockCur.EndPoint-BlockOther.EndPoint |,
| BlockCur.EndPoint-BlockOther.EndOtherPoint |,
| BlockCur.EndOtherPoint-BlockOther.StartPoint |,
| BlockCur.EndOtherPoint-BlockOther.StartOtherPoint |,
| BlockCur.EndOtherPoint-BlockOther.EndPoint |,
|BlockCur.EndOtherPoint-BlockOther.EndOtherPoint|}；
Wherein, BlockOther.StartPoint represents the left end point of the line segment StartSegment in block BlockOther；
BlockOther.StartOtherPoint represents the right endpoint of the line segment StartSegment in block BlockOther；
BlockOther.EndPoint represents the left end point of the line segment EndSegment in block BlockOther；
BlockOther.EndOtherPoint represents the right endpoint of the line segment EndSegment in block BlockOther.
3. the Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing according to claim 2, it is characterized in that,
Also comprise the following steps：
If the Segment for obtaining the BlockDistance of minimum is the EndSegment of block structure BlockNearest, i.e.,
Max | BlockCur.EndPoint-BlockOther.EndPoint |, | BlockCur.EndPoint-
BlockOther.EndOtherPoint |,
| BlockCur.EndOtherPoint-BlockOther.EndPoint |,
| BlockCur.EndOtherPoint-BlockOther.EndOtherPoint | } ＜ Min |
BlockCur.EndPoint-BlockOther.StartPoint |,
| BlockCur.EndPoint-BlockOther.StartOtherPoint |,
| BlockCur.EndOtherPoint-BlockOther.StartPoint |, | BlockCur.EndOtherPoint-
BlockOther.StartOtherPoint|}；
Then representing BlockNearest should be reversed to obtain the jump distance of minimum, even：
The attribute BlockNearest.IsFlip=True of BlockNearest；
Step (1-4) is replaced by following steps：
The order for being stored in SortBlocks [K] according to block extracts the scan lines inside each block successively, wherein, with turning over
Turn the scan lines backward inside the block of mark BlockNearest.IsFlip=True to extract, so far, complete all sweeping
Retouch the sequence of line segment.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510155677.7A CN104890236B (en) | 2015-04-03 | 2015-04-03 | The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510155677.7A CN104890236B (en) | 2015-04-03 | 2015-04-03 | The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104890236A CN104890236A (en) | 2015-09-09 |
| CN104890236B true CN104890236B (en) | 2017-06-13 |
Family
ID=54023393
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510155677.7A Active CN104890236B (en) | 2015-04-03 | 2015-04-03 | The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104890236B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105710370B (en) * | 2016-03-03 | 2018-04-20 | 西安铂力特增材技术股份有限公司 | A kind of scan method for being used to successively manufacture three-dimensional body |
| US10754323B2 (en) | 2016-12-20 | 2020-08-25 | General Electric Company | Methods and systems for implementing distributed ledger manufacturing history |
| CN110001066B (en) * | 2019-05-22 | 2020-02-14 | 浙江大学 | Method for determining filling direction of minimum partition in three-dimensional printing |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104331555A (en) * | 2014-10-31 | 2015-02-04 | 河海大学常州校区 | Slicing processing method aiming at non-closed STL model with boundaries |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7233413B2 (en) * | 2002-11-22 | 2007-06-19 | E. I. Du Pont De Nemours And Company | Gamut description and visualization |
-
2015
- 2015-04-03 CN CN201510155677.7A patent/CN104890236B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104331555A (en) * | 2014-10-31 | 2015-02-04 | 河海大学常州校区 | Slicing processing method aiming at non-closed STL model with boundaries |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104890236A (en) | 2015-09-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103894608B (en) | A kind of 3 D-printing large spot scanning pattern generation method | |
| CN104626585B (en) | A kind of plane dividing method and device for SLA3D printers | |
| Zhang et al. | Two-dimensional placement optimization for multi-parts production in additive manufacturing | |
| CN106273446B (en) | A kind of slice path generating method and system for 3D printing | |
| CN104331555B (en) | A kind of sliced sheet processing method for being directed to the non-close STL models with border | |
| CN105750543B (en) | A kind of checkerboard type laser beam scan path planing method | |
| CN103823928B (en) | 3 D-printing part based on scanning biasing supports automatic generation method | |
| CN104890236B (en) | The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing | |
| CN106373184B (en) | A kind of 3 D-printing model puts required amount of support Method of fast estimating | |
| CN104850709B (en) | Building decoration engineering construction three-dimensional simulation method | |
| CN104385590B (en) | A kind of method that 3 D-printing system carries out product self-inspection | |
| CN108803621A (en) | A kind of steel rail welding line reconditioning robot path planning method | |
| CN1885349A (en) | Point cloud hole repairing method for three-dimensional scanning | |
| CN106925776A (en) | A kind of subregion scanning pattern generation method of control increasing material manufacturing stress deformation | |
| CN103823649A (en) | Three-dimensional printing uniform thickness shelling method based on slicing file | |
| CN109558646A (en) | A kind of multiaxis increasing material manufacturing molding sequence optimizing method | |
| CN104599267A (en) | Cutting track generating method and device | |
| CN105894021B (en) | A kind of matching process of the identical machining feature based on process knowledge | |
| CN108197627A (en) | A kind of method for extracting two-value graph outline along clockwise direction | |
| CN106182153B (en) | Ultrasonic micron precision processing and forming device | |
| CN109697303B (en) | Building brick paving scheme generation method for plane special-shaped area | |
| CN104281727A (en) | Method for designing tire die on basis of Excel and CAD (computer aided design) platform | |
| CN102968774B (en) | Computer-assisted mosaicing method for color patterns | |
| CN108763767A (en) | Big data quantity IGS industry pattern POLYGON conversion methods towards VR engines | |
| CN107187016A (en) | Three-dimensional printing device and three-dimensional column printing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 311258 No. 1398, Wenbin Road, Wenyan street, Xiaoshan District, Hangzhou, Zhejiang. Patentee after: First facing the three dimensional Polytron Technologies Inc Address before: 310000 layer 4899, times Avenue, Wenyan Town, Xiaoshan District, Hangzhou, Zhejiang. Patentee before: Hangzhou Shining 3D Technology Co., Ltd. |
|
| CP03 | Change of name, title or address |