CN102750553A - Recognizing method of wall plane profile - Google Patents
Recognizing method of wall plane profile Download PDFInfo
- Publication number
- CN102750553A CN102750553A CN2012102156250A CN201210215625A CN102750553A CN 102750553 A CN102750553 A CN 102750553A CN 2012102156250 A CN2012102156250 A CN 2012102156250A CN 201210215625 A CN201210215625 A CN 201210215625A CN 102750553 A CN102750553 A CN 102750553A
- Authority
- CN
- China
- Prior art keywords
- profile
- mli
- line
- line segment
- summit
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 42
- 101100409308 Neurospora crassa (strain ATCC 24698 / 74-OR23-1A / CBS 708.71 / DSM 1257 / FGSC 987) adv-1 gene Proteins 0.000 claims description 21
- 101150004094 PRO2 gene Proteins 0.000 claims description 21
- 238000003780 insertion Methods 0.000 claims description 6
- 230000037431 insertion Effects 0.000 claims description 6
- 241001269238 Data Species 0.000 claims description 3
- 230000001154 acute effect Effects 0.000 claims description 3
- 238000012217 deletion Methods 0.000 claims description 3
- 230000037430 deletion Effects 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 3
- 230000008707 rearrangement Effects 0.000 claims description 3
- 238000011160 research Methods 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 239000004020 conductor Substances 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000009408 flooring Methods 0.000 description 2
- 238000005457 optimization Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- GRNHLFULJDXJKR-UHFFFAOYSA-N 3-(2-sulfanylethyl)-1h-quinazoline-2,4-dione Chemical compound C1=CC=C2C(=O)N(CCS)C(=O)NC2=C1 GRNHLFULJDXJKR-UHFFFAOYSA-N 0.000 description 1
- CDBYLPFSWZWCQE-UHFFFAOYSA-L Sodium Carbonate Chemical compound [Na+].[Na+].[O-]C([O-])=O CDBYLPFSWZWCQE-UHFFFAOYSA-L 0.000 description 1
- 238000004458 analytical method Methods 0.000 description 1
- 238000006243 chemical reaction Methods 0.000 description 1
- 230000019771 cognition Effects 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003909 pattern recognition Methods 0.000 description 1
- 230000035515 penetration Effects 0.000 description 1
- 235000020004 porter Nutrition 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
Images
Landscapes
- Image Analysis (AREA)
Abstract
The invention discloses a recognizing method of wall plane profile. The recognizing method comprises the following steps that all line segment data in a given building plane graph is read, and line segments are stored in a line segment number group V1; all the line segments in the V1 are traversed, two different line segments conforming to alternative profile edge conditions are marked and identified and are set as alternative profile edges, and in addition, the two line segments are used as one alternative profile to be stored in an alternative profile number group Vcc; the profile centerline of each alternative profile in the Vcc is calculated, and the centerlines are stored in a number group Vml; the Vml is traversed, and any two different centerlines mli and mlj (i is not equal to j) are optimized; and the wall plane profile is reduced according to the optimized centerlines and the corresponding width. When the technical scheme disclosed by the invention is adopted, the wall plane profile in the building plane graph can be accurately recognized under the conditions that the axial line information is lacked, and the conditions that a large amount of line segments are overlapped and partially overlapped are allowed.
Description
Technical field
The present invention relates to pattern-recognition and cad technique field, relate in particular to a kind of recognition methods of wall plane profile.
Background technology
Both at home and abroad scientific research institution for architectural drawing understand with the research of rebuilding since the initial stage nineties, it belongs to a sub-problem of technical documentation analysis field.Similar sub-problem also comprises MECH plot identification and three-view diagram reconstruction, circuit diagram identification etc.By contrast, start late, remain in many problem demanding prompt solutions to the research of architectural drawing.
The WALKTHRU project of UC Berkeley is to introduce the first mega project of vector architectural plan content understanding and three-dimensional reconstruction.In order to solve by CAD architectural plan reconstruction of three-dimensional model oversize problem consuming time, people such as Lewis [Lewis 1998] develop a prototype system BMG (Building Model Generator).This system is input with the architectural plan of AutoCAD DXF form, sets door, window, body of wall, room and corridor information in the automatic output drawing content according to the user, and can generate the three-dimensional scene models of buildings automatically.BMG is point of penetration with the room number; The closed polygon that surrounds each room number is identified as the flooring profile in this room; Carry out the connection in room through the opening between the flooring profile (Porter) then, the parallel relative part of two the room profiles that link to each other is exactly this wall contour that surrounds this room.People such as Lewis use this system successfully to rebuild the Soda auditorium three-dimensional model of UC Berkeley and are applied among the fire preview simulation system CFAST.Yet the deficiency of BMG also is conspicuous, and the body of wall, door, doorjamb, window, reveal post and the room number that are mainly reflected among the input plane figure all must be stored in the different figure layers, and the title of each figure layer all defines in advance.If given planimetric map does not satisfy these requirements, then need to use BMG after the satisfied constraint of manual amendment.
People such as Park [Park 2004] propose a kind of main wall body plane profile recognition methods based on the size marking extended line.This method is at first discerned the size marking line in the given planimetric map; The hypothesis that must pass through wall contour according to size marking line or its extended line then; Calculate line segment vertical with the size marking line in the certain distance scope as the wall contour line; At last according to wall contour be the rule of closed figures calculate all with it before all line segments of linking to each other of body of wall outline lines, the closed contour that obtains then is the face profile of main wall body.People's such as Park method is simply effective, only can discern global level or vertical wall contour but mention in the literary composition, and this method line segment of requiring to form wall contour closure that is connected with each other.These constraints cause the less stable of this method, and the common noise of drawing data promptly can influence the accuracy of method.
People such as Lu Tong [road logical 2005] [Lu 2005b] further investigate the content understanding problem of vector format architectural drawing; Proposition from growing model of cognition (Self-Incremental Axis-Net-based Hierarchical Recognition), is called for short the SINEHIR model based on the hierarchy type of axle net.This model serves as the identification starting point with the axis symbol, and at first the closed contour of identification encirclement crossing point of axes is the post face profile, is designated as kind of a child node.Enumerate out all kinds that kind of child node links to each other with wall contour then, it is right to calculate the parallel lines that satisfy these connection types, is designated as the seed section.The type that the last wall contour of enumerating according to paper is connected with each other, it is right to calculate the parallel lines that link to each other with the seed section, is designated as expanding section.Seed section and expanding section profile that all identify are the wall plane profile.This method is that this paper author thinks the best wall plane profile recognition methods of having delivered at present to have higher accuracy.But its stability has much room for improvement, and possibly reduce the recognition accuracy of this method when for example drawing lacks axis information or has more overlapping line segment.
This method has higher wall contour identification accuracy, but still has two shortcomings:
The first, when lacking axis symbol information in the architectural plan of handling, this method can't be discerned kind of a child node, thereby can't accomplish the identification of wall contour.So just limit it and can't use house type figure common in practical application, and the architectural plan that has lacked segment axis information, cause the scope of application of this method to be dwindled.
The second, when wall contour line segment in the architectural plan of handling exists a large amount of overlappingly when overlapping, the recognition accuracy of this method will obviously descend.This is because this method is directly discerned through the annexation of wall contour line segment, and the overlapping of line segment can influence this annexation with overlapping.In practical application,, generate overlapping and partly overlapping line segment through regular meeting in the drawing owing to reasons such as illustrator's human factor or drawing format conversion.For this type drawing, the stability of this method may reduce, and recognition accuracy possibly significantly descend.
Summary of the invention
The objective of the invention is to propose a kind of recognition methods of wall plane profile,, accurately discern the wall plane profile in the architectural plan in order to lacking axis information and allowing to exist under the overlapping and partly overlapping situation of a large amount of line segments.
For reaching this purpose, the present invention adopts following technical scheme:
A kind of recognition methods of wall plane profile, this method comprises:
Read all segment datas in the given architectural plan and these line segments are stored among the line segment array V1;
All line segments among the traversal V1 with two that satisfy alternative silhouette edge condition line segment mark signs inequality, are set to alternative silhouette edge, and these two line segments are stored among the alternative profile array Vcc as an alternative profile;
Calculate the profile center line of each the alternative profile among the Vcc, these center lines are stored among the array Vml;
Traversal Vml is to wherein wantonly two different center line mli and mlj (i ≠ j) be optimized;
According to center line after optimizing and corresponding width reduction wall plane profile.
Coordinate and a type identification of two end points of every line segment storage among the said V1, the sign of all line segments is " common line segment " when initial; If stored the data of multi-line section type in the drawing, the summit of then storing according to every multi-line section is divided into many common line segments with it and stores among the V1; If stored the data of piece/insertion type in the drawing, then with storing among the V1 after line segment in each piece/insertion and of the method processing of multi-line section data according to the front.
Said alternative silhouette edge condition includes but not limited to: be designated " the common line segment " that has a line segment in two line segments at least; Article two, line segment is parallel; Article two, the distance between the line segment is in given range; Article two, line segment satisfies mutual projection proportion requirement; Article two, the line segment that does not have in parallel other in the middle of the line segment.
Said two line segments satisfy mutual projection proportion requirement, judge according to following steps:
A1 remembers that respectively the starting point of line segment l1 and line segment l2 and terminal point are s1, e1, s2 and e2; Calculating through s1 and straight line vertical with l2 and the intersection point of line segment l2, is s1_l2 if this intersection point on line segment l2, is then remembered this intersection point; And calculating e1_l2, s2_l1 and e2_l2;
A2 if obtain s1_l2 and e1_l2, then makes pro1=s1_l2, pro2=e1_l2, execution in step A8;
A3 if obtain s1_l2 and s2_l1, then makes pro1=s1_l2, pro2=s2_l1, execution in step A8;
A4 if obtain s1_l2 and e2_11, then makes pro1=s1_l2, pro2=e2_l1, execution in step A8;
A5 if obtain s2_l1 and e2_l1, then makes pro1=s2_l1, pro2=e2_l1, execution in step A8;
A6 if obtain s2_l1 and e1_l2, then makes pro1=s2_l1, pro2=e1_l2, execution in step A8;
A7 if obtain e2_l1 and e1_l2, then makes pro1=e2_l1, pro2=e1_l2, execution in step A8;
A8, calculate pro1 and pro2 apart from d, if among d and l1 and the l2 than the ratio of the line segment length of lacking greater than 1/3, think that then l1 and l2 satisfy mutual projection proportion requirement, return success; Otherwise, return failure.
The profile center line of each the alternative profile among the said calculating Vcc is stored in these center lines among the array Vml, comprising:
The starting point of two parallel silhouette edge line segments and terminal point about readjusting; If the x coordinate figure of terminal point then exchanges starting point and terminal point less than the x coordinate figure of starting point; If the x coordinate figure of starting point and terminal point equates,, then exchange starting point and terminal point if judge the y coordinate figure of the y coordinate figure of terminal point less than starting point;
Calculate the mid point of left side silhouette edge starting point and right lateral contours limit starting point, be designated as ms; In like manner, calculate the center line of left and right sides terminal point, be designated as me;
The line segment that connection ms and me obtain is the corresponding center line ml of profile, and these center lines are stored among the array Vml.
Said traversal Vml, to wherein wantonly two different center line mli and mlj (i ≠ j) be optimized comprises:
If mli and mlj are overlapping fully, then the corresponding profile of deletion from Vcc is deleted mlj then from Vml;
If mli and mlj are overlapped, then revising mlj is that mli is at the apex coordinate that overlaps an end at the apex coordinate that overlaps an end;
If mli and mlj intersect, and mli or mlj existence and the summit of intersection point distance less than threshold value th, the coordinate of then revising said summit is the coordinate of intersection point;
If mli and mljj are non-intersect, but mli and mlj exist distance that a summit satisfies these two summits less than threshold value th respectively, and then revising the corresponding apex coordinate of mlj is the coordinate of mli corresponding vertex;
If mli and mlj are non-intersect, but mli exist a summit to the distance of mlj less than threshold value th, then revising the corresponding apex coordinate of mli is the coordinate of mli and mlj extending line intersection point; In like manner, similar calculating is done on the summit of mlj.
Said according to center line after optimizing and corresponding width reduction wall plane profile, comprising:
Traversal Vml, calculate each bar center line mli as follows:
B1 calculates other center lines that link to each other with mli, and these center lines that link to each other are stored among the Vcml.If Vcml is empty, execution in step B2 then, otherwise execution in step B3;
B2, the starting point si that calculates mli is along the direction vertical with the mli summit behind both sides skew wi/2 respectively, and two summits of this that obtains are respectively lsi and rsi; Wherein wi is the distance between two corresponding parallel silhouette edges of mli; The terminal point ei of mli done similarly calculate lei and rei; Connect the rectangle that si, lsi, lei, ei, rei and rsi obtain successively and be the corresponding wall plane profile ci of mli, ci is in array Vc in storage;
B3 adds among the Vcml mli to back to the Vcml rearrangement, sorts from small to large according to the angle of every center line among the Vcml and X axle forward;
B4, traversal Vcml, the center line cmli that each bar is linked to each other carries out the corresponding relation calculating on center line annexation and profile renewal summit, reduction wall plane profile.
The corresponding relation that the said center line cmli that each bar is linked to each other carries out center line annexation and profile renewal summit calculates, and comprising:
B41 is if i is the subscript of last element of array, then j=0; Otherwise j=i+1; If cmli is parallel with cmlj, execution in step B42 then, otherwise execution in step B43;
B42 through the summit that calculates the rectangle correspondence like step B2, uses the corresponding summit of annexation in these vertex update tables 1 then;
B43, the corresponding relation that upgrades the summit according to center line annexation and profile finds two corresponding inner side edges of annexation, calculates the intersection point of two inner side edges, upgrades the corresponding summit of annexation in the corresponding relation on center line annexation and profile renewal summit again.
The corresponding relation that said center line annexation and profile upgrade the summit comprises:
Center line annexation: si connects sj, and si connects ej, and ei connects sj, and ei connects ej;
Profile upgrades summit: lsi and rsj, lsi and lej, rei and rsj, rei and lej;
Profile inner side edge: lefti and rightj, lefti and leftj, righti and rightj, righti and leftj.
Saidly judge whether two line segments are parallel, comprising:
Judge that whether two acute angle angles between the line segment are less than 5 degree or pre-set threshold.
Technical scheme of the present invention; Annexation through the profile center line; But not directly use the annexation of contour edge line segment to carry out the identification of wall plane profile; The interference that the drawing middle conductor overlaps and partially overlaps and bring is removed in connection optimization through to the profile center line, through the center line after optimizing and the contour edge of range recovery body of wall, but not directly uses the contour edge line segment in the drawing.Adopted technical scheme of the present invention,, can accurately discern the wall plane profile in the architectural plan lacking axis information and allowing to exist under the overlapping and partly overlapping situation of a large amount of line segments.
Description of drawings
Fig. 1 is the recognition methods principle flow chart of wall plane profile in the specific embodiment of the invention.
Embodiment
Further specify technical scheme of the present invention below in conjunction with accompanying drawing and through embodiment.
In the technical scheme of the present invention, the input data are architectural plans of vector format, for example the drawing file of AutoCADDWG/DXF form; Output is the A set of wall face profile, and each profile is one group of closed line segment.
As shown in Figure 1, the recognition methods principle flow chart of the wall plane profile that provides for the embodiment of the invention, wherein,
Among the V1 coordinate and a type identification of two end points of every line segment storage, the sign of all line segments is " common line segment " when initial.If stored the data of multi-line section type (POLYLINE) in the drawing, the summit of then storing according to every multi-line section is divided into many common line segments with it and stores among the V1.If stored the data of piece/insertion type (BLOCK/INSERT) in the drawing, then with storing among the V1 after line segment in each piece/insertion and of the method processing of multi-line section data according to the front.
Alternative silhouette edge condition includes but not limited to: be designated " the common line segment " that has a line segment in two line segments at least; Article two, line segment is parallel; Article two, the distance between the line segment is in given range; Article two, line segment satisfies mutual projection proportion requirement; Article two, the line segment that does not have in parallel other in the middle of the line segment.
Article two, line segment satisfies mutual projection proportion requirement, judges according to following steps:
A1 remembers that respectively the starting point of line segment l1 and line segment l2 and terminal point are s1, e1, s2 and e2; Calculating through s1 and straight line vertical with l2 and the intersection point of line segment l2, is s1_l2 if this intersection point on line segment l2, is then remembered this intersection point; And calculating e1_l2, s2_l1 and e2_l2;
A2 if obtain s1_l2 and e1_l2, then makes pro1=s1_l2, pro2=e1_l2, execution in step A8;
A3 if obtain s1_l2 and s2_l1, then makes pro1=s1_l2, pro2=s2_l1, execution in step A8;
A4 if obtain s1_l2 and e2_l1, then makes pro1=s1_l2, pro2=e2_l1, execution in step A8;
A5 if obtain s2_l1 and e2_l1, then makes pro1=s2_l1, pro2=e2_l1, execution in step A8;
A6 if obtain s2_l1 and e1_l2, then makes pro1=s2_l1, pro2=e1_l2, execution in step A8;
A7 if obtain e2_l1 and e1_l2, then makes pro1=e2_l1, pro2=e1_l2, execution in step A8;
A8, calculate pro1 and pro2 apart from d, if among d and l1 and the l2 than the ratio of the line segment length of lacking greater than 1/3, think that then l1 and l2 satisfy mutual projection proportion requirement, return success; Otherwise, return failure.
The starting point of two parallel silhouette edge line segments and terminal point about readjusting; If the x coordinate figure of terminal point then exchanges starting point and terminal point less than the x coordinate figure of starting point; If the x coordinate figure of starting point and terminal point equates,, then exchange starting point and terminal point if judge the y coordinate figure of the y coordinate figure of terminal point less than starting point;
Calculate the mid point of left side silhouette edge starting point and right lateral contours limit starting point, be designated as ms; In like manner, calculate the center line of left and right sides terminal point, be designated as me;
The line segment that connection ms and me obtain is the corresponding center line ml of profile, and these center lines are stored among the array Vml.
If mli and mlj are overlapping fully, then the corresponding profile of deletion from Vcc is deleted mlj then from Vml;
If mli and mlj are overlapped, then revising mlj is that mli is at the apex coordinate that overlaps an end at the apex coordinate that overlaps an end;
If mli and mlj intersect, and mli or mlj existence and the summit of intersection point distance less than threshold value th, the coordinate of then revising said summit is the coordinate of intersection point;
If mli and mlj are non-intersect, but mli and mlj exist distance that a summit satisfies these two summits less than threshold value th respectively, and then revising the corresponding apex coordinate of mlj is the coordinate of mli corresponding vertex;
If mli and mlj are non-intersect, but mli exist a summit to the distance of mlj less than threshold value th, then revising the corresponding apex coordinate of mli is the coordinate of mli and mlj extending line intersection point; In like manner, similar calculating is done on the summit of mlj.
Traversal Vml, calculate each bar center line mli as follows:
B1 calculates other center lines that link to each other with mli, and these center lines that link to each other are stored among the Vcml.If Vcml is empty, execution in step B2 then, otherwise execution in step B3;
B2, the starting point si that calculates mli is along the direction vertical with the mli summit behind both sides skew wi/2 respectively, and two summits of this that obtains are respectively lsi and rsi; Wherein wi is the distance between two corresponding parallel silhouette edges of mli; The terminal point ei of mli done similarly calculate lei and rei; Connect the rectangle that si, lsi, lei, ei, rei and rsi obtain successively and be the corresponding wall plane profile ci of mli, ci is in array Vc in storage;
B3 adds among the Vcml mli to back to the Vcml rearrangement, sorts from small to large according to the angle of every center line among the Vcml and X axle forward;
B4, traversal Vcml, the center line cmli that each bar is linked to each other carries out the corresponding relation calculating on center line annexation and profile renewal summit, reduction wall plane profile.
Special, the center line cmli that each bar is linked to each other carries out the corresponding relation calculating on center line annexation and profile renewal summit, comprising:
B41 is if i is the subscript of last element of array, then j=0; Otherwise j=i+1; If cmli is parallel with cmli, execution in step B42 then, otherwise execution in step B43;
B42 through the summit that calculates the rectangle correspondence like step B2, uses the corresponding summit of annexation in these vertex update tables 1 then;
B43; Find two corresponding inner side edges of annexation according to the center line annexation with the corresponding relation that profile upgrades the summit; Calculate the intersection point of two inner side edges, again with the corresponding summit of annexation in the corresponding relation on method renewal center line annexation that changes intersection point and profile renewal summit.
The corresponding relation that center line annexation and profile upgrade the summit comprises:
Center line annexation: si connects sj, and si connects ej, and ei connects sj, and ei connects ej;
Profile upgrades summit: lsi and rsj, lsi and lej, rei and rsj, rei and lej;
Profile inner side edge: lefti and rightj, lefti and leftj, righti and rightj, righti and leftj.
Specifically referring to table one.
Table one
| The center line annexation | Profile upgrades the summit | The profile inner side edge |
| Si connects sj | Lsi and rsj | Lefti and rightj |
| Si connects ej | Lsi and lej | Lefti and leftj |
| Ei connects sj | Rei and rsj | Righti and rightj |
| Ei connects ej | Rei and lej | Righti and leftj |
Special, in the foregoing description, judge whether parallel can replacing with judges that whether two acute angle angles between the line segment are less than 5 degree or certain given threshold value to two line segments.
Threshold value th in the aforementioned calculation can replace with a plurality of threshold values, and different threshold values is to different calculation procedures.
In sum; The technical scheme of the embodiment of the invention; Through the annexation of profile center line, but not directly use the annexation of contour edge line segment to carry out the identification of wall plane profile, remove the interference that the drawing middle conductor overlaps and partially overlaps and bring through connection optimization to the profile center line; Through the center line after optimizing and the contour edge of range recovery body of wall, but not directly use the contour edge line segment in the drawing.Adopted technical scheme of the present invention,, can accurately discern the wall plane profile in the architectural plan lacking axis information and allowing to exist under the overlapping and partly overlapping situation of a large amount of line segments.
The above; Be merely the preferable embodiment of the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with this technological people in the technical scope that the present invention disclosed; The variation that can expect easily or replacement all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of claim.
Claims (10)
1. the recognition methods of a wall plane profile is characterized in that, this method comprises:
Read all segment datas in the given architectural plan and these line segments are stored among the line segment array V1;
All line segments among the traversal V1 with two that satisfy alternative silhouette edge condition line segment mark signs inequality, are set to alternative silhouette edge, and these two line segments are stored among the alternative profile array Vcc as an alternative profile;
Calculate the profile center line of each the alternative profile among the Vcc, these center lines are stored among the array Vml;
Traversal Vml is to wherein wantonly two different center line mli and mlj (i ≠ j) be optimized;
According to center line after optimizing and corresponding width reduction wall plane profile.
2. the method for claim 1 is characterized in that, coordinate and a type identification of two end points of every line segment storage among the said V1, and the sign of all line segments is " common line segment " when initial; If stored the data of multi-line section type in the drawing, the summit of then storing according to every multi-line section is divided into many common line segments with it and stores among the V1; If stored the data of piece/insertion type in the drawing, then with storing among the V1 after line segment in each piece/insertion and of the method processing of multi-line section data according to the front.
3. the method for claim 1 is characterized in that, said alternative silhouette edge condition includes but not limited to: be designated " the common line segment " that has a line segment in two line segments at least; Article two, line segment is parallel; Article two, the distance between the line segment is in given range; Article two, line segment satisfies mutual projection proportion requirement; Article two, the line segment that does not have in parallel other in the middle of the line segment.
4. method as claimed in claim 3 is characterized in that, said two line segments satisfy mutual projection proportion requirement, judge according to following steps:
A1 remembers that respectively the starting point of line segment l1 and line segment l2 and terminal point are sl, e1, s2 and e2; Calculating through s1 and straight line vertical with l2 and the intersection point of line segment l2, is s1_l2 if this intersection point on line segment l2, is then remembered this intersection point; And calculating e1_l2, s2_l1 and e2_l2;
A2 if obtain s1_l2 and e1_l2, then makes pro1=s1_l2, pro2=e1_l2, execution in step A8;
A3 if obtain s1_l2 and s2_l1, then makes pro1=s1_l2, pro2=s2_l1, execution in step A8;
A4 if obtain s1_l2 and e2_l1, then makes pro1=s1_l2, pro2=e2_l1, execution in step A8;
A5 if obtain s2_l1 and e2_l1, then makes pro1=s2_l1, pro2=e2_l1, execution in step A8;
A6 if obtain s2_l1 and e1_l2, then makes pro1=s2_l1, pro2=e1_l2, execution in step A8;
A7 if obtain e2_l1 and e1_l2, then makes pro1=e2_l1, pro2=e1_l2, execution in step A8;
A8, calculate pro1 and pro2 apart from d, if among d and l1 and the l2 than the ratio of the line segment length of lacking greater than 1/3, think that then l1 and l2 satisfy mutual projection proportion requirement, return success; Otherwise, return failure.
5. the method for claim 1 is characterized in that, the profile center line of each the alternative profile among the said calculating Vcc is stored in these center lines among the array Vml, comprising:
The starting point of two parallel silhouette edge line segments and terminal point about readjusting; If the x coordinate figure of terminal point then exchanges starting point and terminal point less than the x coordinate figure of starting point; If the x coordinate figure of starting point and terminal point equates,, then exchange starting point and terminal point if judge the y coordinate figure of the y coordinate figure of terminal point less than starting point;
Calculate the mid point of left side silhouette edge starting point and right lateral contours limit starting point, be designated as ms; In like manner, calculate the center line of left and right sides terminal point, be designated as me;
The line segment that connection ms and me obtain is the corresponding center line ml of profile, and these center lines are stored among the array Vml.
6. the method for claim 1 is characterized in that, said traversal Vml, to wherein wantonly two different center line mli and mlj (i ≠ j) be optimized comprises:
If mli and mlj are overlapping fully, then the corresponding profile of deletion from Vcc is deleted mlj then from Vml;
If mli and mlj are overlapped, then revising mlj is that mli is at the apex coordinate that overlaps an end at the apex coordinate that overlaps an end;
If mli and mlj intersect, and mli or mlj existence and the summit of intersection point distance less than threshold value th, the coordinate of then revising said summit is the coordinate of intersection point;
If mli and mlj are non-intersect, but mli and mlj exist distance that a summit satisfies these two summits less than threshold value th respectively, and then revising the corresponding apex coordinate of mlj is the coordinate of mli corresponding vertex;
If mli and mlj are non-intersect, but mli exist a summit to the distance of mlj less than threshold value th, then revising the corresponding apex coordinate of mli is the coordinate of mli and mlj extending line intersection point; In like manner, similar calculating is done on the summit of mlj.
7. the method for claim 1 is characterized in that, and is said according to center line after optimizing and corresponding width reduction wall plane profile, comprising:
Traversal Vml, calculate each bar center line mli as follows:
B1 calculates other center lines that link to each other with mli, and these center lines that link to each other are stored among the Vcml.If Vcml is empty, execution in step B2 then, otherwise execution in step B3;
B2, the starting point si that calculates mli is along the direction vertical with the mli summit behind both sides skew wi/2 respectively, and two summits of this that obtains are respectively lsi and rsi; Wherein wi is the distance between two corresponding parallel silhouette edges of mli; The terminal point ei of mli done similarly calculate lei and rei; Connect the rectangle that si, lsi, lei, ei, rei and rsi obtain successively and be the corresponding wall plane profile ci of mli, ci is in array Vc in storage;
B3 adds among the Vcml mli to back to the Vcml rearrangement, sorts from small to large according to the angle of every center line among the Vcml and X axle forward;
B4, traversal Vcml, the center line cmli that each bar is linked to each other carries out the corresponding relation calculating on center line annexation and profile renewal summit, reduction wall plane profile.
8. method as claimed in claim 7 is characterized in that, the corresponding relation that the said center line cmli that each bar is linked to each other carries out center line annexation and profile renewal summit calculates, and comprising:
B41 is if i is the subscript of last element of array, then j=0; Otherwise j=i+1; If cmli is parallel with cmlj, execution in step B42 then, otherwise execution in step B43;
B42 through the summit that calculates the rectangle correspondence like step B2, uses the corresponding summit of annexation in these vertex update tables 1 then;
B43, the corresponding relation that upgrades the summit according to center line annexation and profile finds two corresponding inner side edges of annexation, calculates the intersection point of two inner side edges, upgrades the corresponding summit of annexation in the corresponding relation on center line annexation and profile renewal summit again.
9. method as claimed in claim 8 is characterized in that, the corresponding relation that said center line annexation and profile upgrade the summit comprises:
Center line annexation: si connects sj, and si connects ej, and ei connects sj, and ei connects ej;
Profile upgrades summit: lsi and rsj, lsi and lej, rei and rsj, rei and lej;
Profile inner side edge: lefti and rightj, lefti and leftj, righti and rightj, righti and leftj.
10. like claim 3,5,7,8 or 9 arbitrary described methods, it is characterized in that saidly judge whether two line segments are parallel, comprising:
Judge that whether two acute angle angles between the line segment are less than 5 degree or pre-set threshold.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210215625.0A CN102750553B (en) | 2012-06-28 | 2012-06-28 | Recognizing method of wall plane profile |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210215625.0A CN102750553B (en) | 2012-06-28 | 2012-06-28 | Recognizing method of wall plane profile |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102750553A true CN102750553A (en) | 2012-10-24 |
| CN102750553B CN102750553B (en) | 2015-06-17 |
Family
ID=47030718
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210215625.0A Expired - Fee Related CN102750553B (en) | 2012-06-28 | 2012-06-28 | Recognizing method of wall plane profile |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102750553B (en) |
Cited By (19)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103971098A (en) * | 2014-05-19 | 2014-08-06 | 北京明兰网络科技有限公司 | Method for recognizing wall in house type image and method for automatically correcting length ratio of house type image |
| CN104346798A (en) * | 2013-08-01 | 2015-02-11 | 深圳中兴力维技术有限公司 | Object delineation polygonal approximation method and device thereof |
| CN104732192A (en) * | 2013-12-23 | 2015-06-24 | 中国移动通信集团设计院有限公司 | Method and device for recognizing walls on architecture drawing |
| CN106156438A (en) * | 2016-07-12 | 2016-11-23 | 杭州群核信息技术有限公司 | Body of wall recognition methods and device |
| CN108133116A (en) * | 2018-01-15 | 2018-06-08 | 北京居然设计家家居连锁集团有限公司 | CAD floor plan wall thickness automatic identifying methods and system |
| CN108268743A (en) * | 2018-02-09 | 2018-07-10 | 广州大学 | Well automatic identifying method and system based on architectural drawing |
| CN108763606A (en) * | 2018-03-12 | 2018-11-06 | 江苏艾佳家居用品有限公司 | A kind of floor plan element extraction method and system based on machine vision |
| CN108763813A (en) * | 2018-06-08 | 2018-11-06 | 杭州群核信息技术有限公司 | It is a kind of to identify the method and apparatus for copying wall in figure based on deep learning |
| CN108961152A (en) * | 2018-05-30 | 2018-12-07 | 链家网（北京）科技有限公司 | Plane house type drawing generating method and device |
| CN109658415A (en) * | 2018-12-27 | 2019-04-19 | 福建省晨曦信息科技股份有限公司 | A kind of drawing dividing method, electronic equipment and storage medium |
| CN109670469A (en) * | 2018-12-27 | 2019-04-23 | 福建省晨曦信息科技股份有限公司 | A kind of axis net generation method, electronic equipment and storage medium |
| CN109753918A (en) * | 2018-12-29 | 2019-05-14 | 江苏艾佳家居用品有限公司 | Wall recognition methods and system in a kind of floor plan |
| CN109881898A (en) * | 2019-02-21 | 2019-06-14 | 深圳市建筑设计研究总院有限公司 | A kind of assembled modification method of high level conjoined structure |
| CN110334390A (en) * | 2019-05-22 | 2019-10-15 | 郑州轻工业学院 | Exterior wall recognition methods, device, storage medium and processor in CAD |
| CN111127357A (en) * | 2019-12-18 | 2020-05-08 | 北京城市网邻信息技术有限公司 | House type graph processing method, system, device and computer readable storage medium |
| CN111179375A (en) * | 2019-12-17 | 2020-05-19 | 深圳市华阳国际工程设计股份有限公司 | Method and device for automatically generating outline graph of building bearing platform and computer storage medium |
| CN112926392A (en) * | 2021-01-26 | 2021-06-08 | 杭州聚秀科技有限公司 | Building plane drawing room identification method based on contour screening |
| CN114444173A (en) * | 2021-12-31 | 2022-05-06 | 万翼科技有限公司 | Wall line extraction method and device, electronic equipment and storage medium |
| CN114491741A (en) * | 2021-12-31 | 2022-05-13 | 万翼科技有限公司 | Wall line extraction method and device, electronic equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040070585A1 (en) * | 2000-11-13 | 2004-04-15 | Wolfgang Papiernik | Method and system for reconstructing a surface |
| CN101144710A (en) * | 2007-10-17 | 2008-03-19 | 南京大学 | Automatic calculation method for global coordinate system under multiple-association engineering chart environment |
| CN101533525A (en) * | 2008-03-12 | 2009-09-16 | 中国科学院计算技术研究所 | Method for analyzing the overlay of point and face |
-
2012
- 2012-06-28 CN CN201210215625.0A patent/CN102750553B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040070585A1 (en) * | 2000-11-13 | 2004-04-15 | Wolfgang Papiernik | Method and system for reconstructing a surface |
| CN101144710A (en) * | 2007-10-17 | 2008-03-19 | 南京大学 | Automatic calculation method for global coordinate system under multiple-association engineering chart environment |
| CN101533525A (en) * | 2008-03-12 | 2009-09-16 | 中国科学院计算技术研究所 | Method for analyzing the overlay of point and face |
Non-Patent Citations (1)
| Title |
|---|
| 何小权等: "《计算机辅助配模设计》", 《青岛海洋大学学报》 * |
Cited By (30)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104346798B (en) * | 2013-08-01 | 2019-01-11 | 深圳力维智联技术有限公司 | Objective contour Polygonal Approximation and its device |
| CN104346798A (en) * | 2013-08-01 | 2015-02-11 | 深圳中兴力维技术有限公司 | Object delineation polygonal approximation method and device thereof |
| CN104732192A (en) * | 2013-12-23 | 2015-06-24 | 中国移动通信集团设计院有限公司 | Method and device for recognizing walls on architecture drawing |
| CN104732192B (en) * | 2013-12-23 | 2018-02-23 | 中国移动通信集团设计院有限公司 | A kind of architectural drawing wall recognition methods and device |
| CN103971098B (en) * | 2014-05-19 | 2017-05-10 | 北京明兰网络科技有限公司 | Method for recognizing wall in house type image and method for automatically correcting length ratio of house type image |
| CN103971098A (en) * | 2014-05-19 | 2014-08-06 | 北京明兰网络科技有限公司 | Method for recognizing wall in house type image and method for automatically correcting length ratio of house type image |
| CN106156438A (en) * | 2016-07-12 | 2016-11-23 | 杭州群核信息技术有限公司 | Body of wall recognition methods and device |
| CN108133116A (en) * | 2018-01-15 | 2018-06-08 | 北京居然设计家家居连锁集团有限公司 | CAD floor plan wall thickness automatic identifying methods and system |
| CN108133116B (en) * | 2018-01-15 | 2021-08-24 | 躺平设计家(北京)科技有限公司 | Method and system for automatically identifying wall thickness of CAD house type graph |
| CN108268743A (en) * | 2018-02-09 | 2018-07-10 | 广州大学 | Well automatic identifying method and system based on architectural drawing |
| CN108268743B (en) * | 2018-02-09 | 2021-02-02 | 广州大学 | Well automatic identification method and system based on building drawings |
| CN108763606A (en) * | 2018-03-12 | 2018-11-06 | 江苏艾佳家居用品有限公司 | A kind of floor plan element extraction method and system based on machine vision |
| CN108961152A (en) * | 2018-05-30 | 2018-12-07 | 链家网（北京）科技有限公司 | Plane house type drawing generating method and device |
| CN108763813B (en) * | 2018-06-08 | 2022-11-15 | 杭州群核信息技术有限公司 | Method and device for identifying wall in copy picture based on deep learning |
| CN108763813A (en) * | 2018-06-08 | 2018-11-06 | 杭州群核信息技术有限公司 | It is a kind of to identify the method and apparatus for copying wall in figure based on deep learning |
| CN109658415A (en) * | 2018-12-27 | 2019-04-19 | 福建省晨曦信息科技股份有限公司 | A kind of drawing dividing method, electronic equipment and storage medium |
| CN109670469A (en) * | 2018-12-27 | 2019-04-23 | 福建省晨曦信息科技股份有限公司 | A kind of axis net generation method, electronic equipment and storage medium |
| CN109670469B (en) * | 2018-12-27 | 2022-11-15 | 福建晨曦信息科技集团股份有限公司 | Axle network generation method, electronic device and storage medium |
| CN109753918A (en) * | 2018-12-29 | 2019-05-14 | 江苏艾佳家居用品有限公司 | Wall recognition methods and system in a kind of floor plan |
| CN109881898B (en) * | 2019-02-21 | 2021-06-25 | 深圳市建筑设计研究总院有限公司 | Splicing and correcting method for high-rise connected structure |
| CN109881898A (en) * | 2019-02-21 | 2019-06-14 | 深圳市建筑设计研究总院有限公司 | A kind of assembled modification method of high level conjoined structure |
| CN110334390B (en) * | 2019-05-22 | 2020-07-24 | 郑州轻工业学院 | Method and device for identifying outer wall in computer-aided design (CAD), storage medium and processor |
| CN110334390A (en) * | 2019-05-22 | 2019-10-15 | 郑州轻工业学院 | Exterior wall recognition methods, device, storage medium and processor in CAD |
| CN111179375A (en) * | 2019-12-17 | 2020-05-19 | 深圳市华阳国际工程设计股份有限公司 | Method and device for automatically generating outline graph of building bearing platform and computer storage medium |
| CN111179375B (en) * | 2019-12-17 | 2023-12-01 | 深圳市华阳国际工程设计股份有限公司 | Automatic generation method and device of contour graph of building bearing platform and computer storage medium |
| CN111127357B (en) * | 2019-12-18 | 2021-05-04 | 北京城市网邻信息技术有限公司 | House type graph processing method, system, device and computer readable storage medium |
| CN111127357A (en) * | 2019-12-18 | 2020-05-08 | 北京城市网邻信息技术有限公司 | House type graph processing method, system, device and computer readable storage medium |
| CN112926392A (en) * | 2021-01-26 | 2021-06-08 | 杭州聚秀科技有限公司 | Building plane drawing room identification method based on contour screening |
| CN114444173A (en) * | 2021-12-31 | 2022-05-06 | 万翼科技有限公司 | Wall line extraction method and device, electronic equipment and storage medium |
| CN114491741A (en) * | 2021-12-31 | 2022-05-13 | 万翼科技有限公司 | Wall line extraction method and device, electronic equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102750553B (en) | 2015-06-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102750553A (en) | Recognizing method of wall plane profile | |
| CN110992490B (en) | Method for automatically extracting indoor map based on CAD building plan | |
| CN108536923B (en) | Indoor topological map generation method and system based on building CAD (computer-aided design) map | |
| CN111429563A (en) | Pipeline three-dimensional reconstruction method, system, medium and equipment based on deep learning | |
| CN108305289B (en) | Three-dimensional model symmetry characteristic detection method and system based on least square method | |
| CN104679846A (en) | Method and system for describing building information modeling by utilizing XML (X Exrensible Markup Language) formatted data | |
| CN104392482A (en) | Substation engineering project three-dimensional calculation quantity model generation system and method | |
| CN101446999B (en) | Automatic checking method for dimension line marking error in engineering drawing | |
| CN107992036A (en) | Transport Vehicle paths planning method, device and storage medium in a kind of intelligent parking garage | |
| CN102938064B (en) | Park structure extraction method based on LiDAR data and ortho-images | |
| CN102867076A (en) | BIM (Building Information Modeling)-based metro comprehensive pipeline clearance detection method | |
| Horna et al. | Consistency constraints and 3D building reconstruction | |
| CN101286241A (en) | Three-dimensional architecture rapid modelling approach based on stereopair | |
| CN102799714A (en) | Method for extracting data of integrated pipeline of metro based on Auto computer-aided design (CAD) drawing | |
| CN102682476B (en) | The boolean operation method of triangle grid data and system thereof | |
| CN111046459A (en) | Building model image design method based on 3D software | |
| CN103065009B (en) | Intelligent design system and method of traffic sign lines | |
| CN105975655A (en) | BIM-based parametric modeling method for imitated Tang and Song dynasty ancient building special-shaped roof tiles | |
| CN108427693A (en) | A method of BIM model datas are stored and give third party software system | |
| CN105468809A (en) | Subway station wiring system and subway plane design method | |
| CN102810215A (en) | Method for generating three-dimensional railway center line | |
| Lu et al. | 3D reconstruction of detailed buildings from architectural drawings | |
| CN111915720B (en) | Automatic conversion method from building Mesh model to CityGML model | |
| CN101551916A (en) | Method and system of three-dimensional scene modeling based on ontology | |
| CN116756808B (en) | Railway line shape optimization method and device, electronic equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150617 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |