CN102982562A - Method for judging whether target point is positioned inside polygon area - Google Patents
Method for judging whether target point is positioned inside polygon area Download PDFInfo
- Publication number
- CN102982562A CN102982562A CN2012103986102A CN201210398610A CN102982562A CN 102982562 A CN102982562 A CN 102982562A CN 2012103986102 A CN2012103986102 A CN 2012103986102A CN 201210398610 A CN201210398610 A CN 201210398610A CN 102982562 A CN102982562 A CN 102982562A
- Authority
- CN
- China
- Prior art keywords
- impact point
- polygon
- point
- polygonal region
- 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.)
- Pending
Links
Images
Landscapes
- Image Analysis (AREA)
- Image Generation (AREA)
Abstract
The invention discloses a method for judging whether a target point is positioned inside a polygon area. The method comprises the following steps: S1 defining a formation rule, wherein the target point is P0, all vertexes of a polygon are sequentially connected in a clockwise direction so as to form the polygon, and the vertexes are sequentially P1, P2, P3, ..., Pi-1, Pi+1, ..., Pn; S2 looking through all sides, wherein if the target point P0 is in a normal projection range of one side, the minimum distance, and the corresponding side or vertex can be recorded, if the target point P0 is closest to the side, any one convex Pi of two convexes can be chosen, and if the target point P0 is closest to the convex, the convex can be chosen as Pi and a direction horizontally at the right of a Pi point can be an X forward direction; S3 calculating angles; and S4 judging the position of the point by calculating the relation among three angles. The judging method is simple in step, fast in calculating speed, and capable of accurately judging whether the point is inside the polygon.
Description
Technical field
Computer graphics techniques and computing machine geometric techniques field particularly a kind ofly judge whether impact point is positioned at the method for polygonal region inside.
Background technology
Whether point is positioned at the judgement of polygon is calculated, and is a basic problem in the computational geometry, and the method for this respect has a wide range of applications in various fields such as computer graphics, fuzzy diagnosis, Geographic Information System.
The method whether traditional decision-point is positioned at polygon has following several:
Area-method: the triangle area that polygonal all limits and impact point form and whether equal total area of a polygon, if equal, then in inside.Otherwise externally.This method calculated amount is larger, and the main calculating of using is to look into to take advantage of.
Angle and method: judge all limits and impact point angle and, if angle and be 360 degree is then inner at polygon.Calculated amount specific area method is slightly little, uses mainly to be dot product and to ask mould to calculate.
The injection collimation method.From the impact point ray that goes out to carry out the coffin upon burial, judge the intersection point number on this ray and all limits.If the odd number intersection point is arranged, illustrate then that in inside if the even number intersection point is arranged, then explanation externally.The method exists more special circumstances to process, as through summit or overlapping etc. with the sideline.
A kind of decision method is disclosed in Chinese patent CN200710121506.8, it carries out protruding subdivision to polygon first, and setting up binary tree, to manage these chimbs capable, then, coordinate position according to tested measuring point, the binary tree of setting up is investigated, to find convex polygon corresponding to a leaf node of this binary tree, detected again this point and whether be positioned at this protruding distortion; This method has identical complexity in various aspects such as polygonal pretreated time, space requirement and judgement calculating
There is following problem in prior art:
1, the determination methods step is complicated, loaded down with trivial details, simple and easy not;
2, space requirement is larger, computing velocity is slower;
3, the accuracy in polygon is not high for judging point.
Summary of the invention
In order to overcome the defective of prior art, the invention discloses and a kind ofly judge whether impact point is positioned at the method for polygonal region inside, this localization method determination methods calculated amount is little, and accuracy is high, is easy to realize.
The invention discloses following technical scheme:
A kind ofly judge that whether impact point is positioned at the method for polygonal region inside, comprises the steps:
S1: the constructing definitions rule: impact point is P0, and each summit of polygon is followed successively by P1 in a clockwise direction, P2, and P3 ..., Pi-1, Pi, Pi+1 ..., Pn;
S2: travel through all limits, if impact point P0 then calculates the distance B 0i on impact point P0 and this limit in the normal direction drop shadow spread on limit, otherwise calculate the minor increment D0i on impact point P0 and two summits, this limit, record minor increment, and corresponding limit or summit; If impact point P0 is nearest apart from the limit, select so in two summits any one for Pi, if impact point is nearest apart from the summit, so take this summit as Pi; Simultaneously take Pi point level to the right as the X forward;
S3: calculate angle
A) A
I1=∠ XPiPi-1, A
I1For PiX centered by Pi, be rotated clockwise to P
1P
I-1Formed angle;
B) A
I2=∠ XPiPi+1, A
I2For PiX centered by Pi, be rotated clockwise to the formed angle of PiPi+1;
C) A
I0=∠ XP
iP
0, A
I0For PiX centered by Pi, be rotated clockwise to PiP
0Formed angle;
S4: the position of coming judging point by calculating three relations between the angle
If a) A
I1A
I2, and A
I1A
I0A
I2, then impact point P0 is in polygonal region, otherwise outside polygonal region;
B) if A
I1＜A
I2, and A
I0＜A
I1Or A
I0A
I2, then impact point P0 is in polygonal region, otherwise outside polygonal region;
C) A
I1=A
I0Or A
I2=A
I0, then be judged to be on the polygon sideline.
Preferably, describedly judge whether impact point is positioned at the method for polygonal region inside, also comprise S5: if polygon is middle hollow out or is annular, this polygon comprises outer ring polygon and inner ring polygon, it is inner at the outer ring polygon then to satisfy impact point P0, and impact point P0 is at the inner ring outside of polygon, otherwise impact point P0 is outside polygonal region.
Preferably, describedly judge whether impact point is positioned at the method for polygonal region inside, if there is several vertex distances P0 to equate that can choosing wherein, any summit is Pi among its S2.
Preferably, describedly judge whether impact point is positioned at the method for polygonal region inside, if there is several back gauges P0 to equate among its S2, can choosing wherein arbitrarily, any summit on limit is Pi.Compared with prior art, beneficial effect of the present invention is as follows:
1, the method step simple operations is convenient;
2, little, the fast computational speed of space requirement amount;
3, the accuracy in polygon is high for judging point.
Description of drawings
Fig. 1 is the structural representation of specific embodiment of the invention determination methods;
Fig. 2 a is the synoptic diagram of the specific embodiment of the invention one impact point in convex polygon;
Fig. 2 b is the synoptic diagram of the specific embodiment of the invention one impact point in concave polygon;
Fig. 2 c is the synoptic diagram of the specific embodiment of the invention one impact point in the wedge shape concave edge shape;
Fig. 2 d is the synoptic diagram of the specific embodiment of the invention one impact point outside convex polygon;
Fig. 2 e is the synoptic diagram of the specific embodiment of the invention one impact point outside concave polygon;
Fig. 2 f is the synoptic diagram of the specific embodiment of the invention one impact point outside the wedge shape concave edge shape;
Fig. 3 a is the synoptic diagram of the specific embodiment of the invention two impact points in convex polygon;
Fig. 3 b is the synoptic diagram of the specific embodiment of the invention two impact points in concave polygon;
Fig. 3 c is the synoptic diagram of the specific embodiment of the invention two impact points in the wedge shape concave edge shape;
Fig. 3 d is the synoptic diagram of the specific embodiment of the invention two impact points outside convex polygon;
Fig. 3 e is the synoptic diagram of the specific embodiment of the invention two impact points outside concave polygon;
Fig. 3 f is the synoptic diagram of the specific embodiment of the invention two impact points outside the wedge shape concave edge shape;
Fig. 4 a is the synoptic diagram of the specific embodiment of the invention three impact points on convex polygon;
Fig. 4 b is the synoptic diagram of the specific embodiment of the invention three impact points on concave polygon;
Fig. 4 c is the synoptic diagram of the specific embodiment of the invention three impact points on the wedge shape concave edge shape;
Fig. 5 is the synoptic diagram of the specific embodiment of the invention four impact points in special polygon;
Embodiment:
The invention provides and a kind ofly judge that whether impact point is positioned at the method for polygonal region inside, such as Fig. 1, comprises the steps:
A kind ofly judge whether impact point is positioned at the method for polygonal region inside, it is characterized in that, comprises the steps:
S1: the constructing definitions rule: impact point is P0, and each summit of polygon is followed successively by P1 in a clockwise direction, P2, and P3 ..., Pi-1, Pi, Pi+1 ..., Pn;
S2: travel through all limits, if impact point P0 then calculates the distance B 0i on impact point P0 and this limit in the normal direction drop shadow spread on limit, otherwise calculate the minor increment D0i on impact point P0 and two summits, this limit, record minor increment, and corresponding limit or summit; If impact point P0 is nearest apart from the limit, select so in two summits any one for Pi, if impact point is nearest apart from the summit, so take this summit as Pi; Simultaneously take Pi point level to the right as the X forward;
S3: calculate angle
A) A
I1=∠ XPiPi-1, A
I1For PiX centered by Pi, be rotated clockwise to P
1P
I-1Formed angle;
B) A
I2=∠ XPiPi+1, A
I2For PiX centered by Pi, be rotated clockwise to the formed angle of PiPi+1;
C) A
I0=∠ XP
iP
0, A
I0For PiX centered by Pi, be rotated clockwise to PiP
0Formed angle;
S4: the position of coming judging point by calculating three relations between the angle
If a) A
I1A
I2, and A
I1A
I0A
I2, then impact point P0 is in polygonal region, otherwise outside polygonal region;
B) if A
I1＜A
I2, and A
I0＜A
I1Or A
I0A
I2, then impact point P0 is in polygonal region, otherwise outside polygonal region;
C) A
I1=A
I0Or A
I2=A
I0, then be judged to be on the polygon sideline;
If polygon is middle hollow out or is annular, this polygon comprises outer ring polygon and inner ring polygon, and it is inner at the outer ring polygon then to satisfy impact point P0, and impact point P0 is at the inner ring outside of polygon, otherwise impact point P0 is outside polygonal region.
If there is several vertex distances P0 to equate among the described S2, wherein any apex horizontal is to the right for there being several back gauges P0 to equate among X forward or the S2 if can choose, and can choosing wherein arbitrarily, any summit on limit is Pi.
The present invention will be further described with specific embodiment by reference to the accompanying drawings in the below:
Embodiment one
Such as Fig. 2 a, P2 is from the nearest point of impact point P0, and level is to the right the X forward, and in the direction of the clock, then: P2 to the angle of a upper reference point P1 is: A
I1The implication of=∠ XP2P1(∠ XP2P1 be P2X centered by P2, be rotated clockwise to the formed angle of P2P1, below the angle implication the same, repeat no more), P2 to the angle of next reference point P3 is: A
I2=∠ XP2P3; P2 to the angle of P0 is: A
I0=∠ XP2P0
Can find out above-mentioned three angle: A from Fig. 2 a
I1A
I2, and A
I1A
I0A
I2So impact point P0 is in polygonal region; For concave polygon also applicable this decision condition, such as Fig. 2 b; In like manner the wedge shape concave edge shape also adapts to this decision condition, such as Fig. 2 c.
Such as Fig. 2 d, P2 is from the nearest point of impact point P0, and level is to the right the X forward, and then: P2 to the angle of a upper reference point P1 is: A
I1=∠ XP2P1; P2 to the angle of next reference point P3 is: A
I2=∠ XP2P3; And P2 to the angle of P0 is: A
I0=∠ XP2P0.
Can find out above-mentioned three angle: A from Fig. 2 d
I1A
I2, and A
I0A
I1A
I2So impact point P0 is outside polygonal region; For concave polygon also applicable this decision condition, such as Fig. 2 e; In like manner also adapt to this decision condition for the wedge shape concave edge shape, such as Fig. 2 f.
Embodiment two
Such as Fig. 3 a, P4 is from the nearest point of impact point P0, and level is to the right the X forward, and in the direction of the clock, then P4 to the angle of a upper reference point P3 is: A
I1=∠ XP4P3; P4 to the angle of next reference point P5 is: A
I2=∠ XP4P5; P4 to the angle of P0 is: A
I0=∠ XP4P0.
Can find out above-mentioned three angle: A from Fig. 3 a
I1＜A
I2, and A
I0A
I2So impact point P0 is in polygonal region.For concave polygon also applicable this decision condition, such as Fig. 3 b; In like manner also be applicable to the wedge shape concave edge shape, such as Fig. 3 c.
Such as Fig. 3 d, P4 is from the nearest point of impact point P0, and level is to the right the X forward, and in the direction of the clock, then P4 to the angle of a upper reference point P3 is: A
I1=∠ XP4P3; P4 to the angle of next reference point P5 is: A
I2=∠ XP4P5; And P4 to the angle of P0 is: A
I0=∠ XP4P0
Can find out above-mentioned three angle: A from Fig. 3 d
I1＜A
I2, and A
I1＜A
I0＜A
I2So impact point P0 is outside polygonal region; For concave polygon also applicable this decision condition, such as Fig. 3 e; In like manner also be suitable for the wedge shape concave edge shape, such as Fig. 3 f.
Embodiment three
Such as Fig. 4 a, suppose P2 from the nearest point of impact point P0, level is to the right the X forward, in the direction of the clock, then P2 to the angle of a upper reference point P1 is: A
I1=∠ XP2P1; P2 to the angle of next reference point P3 is: A
I2=∠ XP2P3; P2 to the angle of P0 is: A
I0=∠ XP2P0.
Can find out above-mentioned three angle: A from Fig. 4 a
I1A
I2, and A
I0=A
I1So impact point P0 is on the polygon sideline; For concave polygon also applicable this decision condition, such as Fig. 4 b; In like manner also be applicable to the wedge shape concave edge shape, such as Fig. 4 c.
Embodiment four
Such as Fig. 5, this is particular example, polygon is middle hollow out or annular, annular can be considered as two nested combinations of the polygon that varies in size, so judge that impact point P0 is whether in annular, need meet the following conditions: impact point P0 is inner at the outer ring polygon, and impact point P0 is at the inner ring outside of polygon.
Such as Fig. 5, distance objective point P0 nearest summit in outer ring is P6, so A
I1=∠ XP6P5; A
I2=∠ XP6P1; A
I0=∠ XP6P0.
As seen from the figure, A
I1＜A
I2, and A
I0＜A
I1, according to decision condition 2, impact point is inner at the great circle polygonal region.
The nearest summit of inner ring distance objective point P0 is P5 ', so A
I1 '=∠ X ' P5 ' P4 '; A
I2 '=∠ X ' P5 ' P1 '; A
I0 '=∠ X ' P5 ' P0 '.
As seen from the figure, A
I1 '＜A
I2 ', and A
I1 '＜A
I0 '＜A
I2 ', according to decision condition 2, impact point is outside at the ringlet polygonal region.
Comprehensive above situation can judge that impact point P0 is inner in annular region.
The preferred embodiment of the present invention just is used for helping to set forth the present invention.Preferred embodiment does not have all details of detailed descriptionthe, does not limit this invention yet and only is described embodiment.Obviously, according to the content of this instructions, can make many modifications and variations.These embodiment are chosen and specifically described to this instructions, is in order to explain better principle of the present invention and practical application, thereby the technical field technician can utilize the present invention well under making.The present invention only is subjected to the restriction of claims and four corner and equivalent.
Claims (4)
1. judge whether impact point is positioned at the method for polygonal region inside, it is characterized in that, comprises the steps: for one kind
S1: the constructing definitions rule: impact point is P0, and each summit of polygon is followed successively by P1 in a clockwise direction, P2, and P3 ..., Pi-1, Pi, Pi+1 ..., Pn;
S2: travel through all limits, if impact point P0 then calculates the distance B 0i on impact point P0 and this limit in the normal direction drop shadow spread on limit, otherwise calculate the minor increment D0i on impact point P0 and two summits, this limit, record minor increment, and corresponding limit or summit; If impact point P0 is nearest apart from the limit, select so in two summits any one for Pi, if impact point is nearest apart from the summit, so take this summit as Pi; Simultaneously take Pi point level to the right as the X forward;
S3: calculate angle
A) A
I1=∠ XPiPi-1, A
I1For PiX centered by Pi, be rotated clockwise to P
1P
I-1Formed angle;
B) A
I2=∠ XPiPi+1, A
I2For PiX centered by Pi, be rotated clockwise to the formed angle of PiPi+1;
C) A
I0=∠ XP
iP
0, A
I0For PiX centered by Pi, be rotated clockwise to PiP
0Formed angle;
S4: the position of coming judging point by calculating three relations between the angle
If a) A
I1A
I2, and A
I1A
I0A
I2, then impact point P0 is in polygonal region, otherwise outside polygonal region;
B) if A
I1＜A
I2, and A
I0＜A
I1Or A
I0A
I2, then impact point P0 is in polygonal region, otherwise outside polygonal region;
C) A
I1=A
I0Or A
I2=A
I0, then be judged to be on the polygon sideline.
2. the method for polygonal region according to claim 1 inside, it is characterized in that, also comprise S5: if polygon is middle hollow out or is annular, this polygon comprises outer ring polygon and inner ring polygon, it is inner at the outer ring polygon then to satisfy impact point P0, and impact point P0 is at the inner ring outside of polygon, otherwise impact point P0 is outside polygonal region.
3. the method for polygonal region according to claim 1 inside is characterized in that, if there is several vertex distances P0 to equate that can choosing wherein, any summit is Pi among the described S2.
4. the method for polygonal region according to claim 1 inside is characterized in that, if there is several back gauges P0 to equate among the described S2, can choosing wherein arbitrarily, any summit on limit is Pi.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103986102A CN102982562A (en) | 2012-10-19 | 2012-10-19 | Method for judging whether target point is positioned inside polygon area |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012103986102A CN102982562A (en) | 2012-10-19 | 2012-10-19 | Method for judging whether target point is positioned inside polygon area |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102982562A true CN102982562A (en) | 2013-03-20 |
Family
ID=47856503
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012103986102A Pending CN102982562A (en) | 2012-10-19 | 2012-10-19 | Method for judging whether target point is positioned inside polygon area |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102982562A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104575081A (en) * | 2014-12-08 | 2015-04-29 | 深圳市广和通实业发展有限公司 | Method for detecting entrance of vehicle into polygonal electronic fence region |
| CN105590333A (en) * | 2015-11-28 | 2016-05-18 | 中国石油大学(华东) | Method for determination of point-surface topological relation on the basis of delta-shaped region equation |
| CN105787968A (en) * | 2016-03-22 | 2016-07-20 | 北京建飞无限科技有限公司 | Polygon convex/concave point identification method and device |
| CN107562895A (en) * | 2017-09-06 | 2018-01-09 | 上海享骑电动车服务有限公司 | Geography fence |
| CN107610455A (en) * | 2017-09-06 | 2018-01-19 | 上海享骑电动车服务有限公司 | Fence |
| CN107884795A (en) * | 2016-09-30 | 2018-04-06 | 厦门雅迅网络股份有限公司 | The determination methods and its system in the disengaging region based on GPS |
| CN108076436A (en) * | 2017-11-16 | 2018-05-25 | 中国联合网络通信集团有限公司 | A kind of method and the network equipment of definite relative position |
| CN109238282A (en) * | 2018-07-26 | 2019-01-18 | 平安科技（深圳）有限公司 | A kind of position finding and detection method of robot, equipment and computer-readable medium |
| CN110159348A (en) * | 2019-05-28 | 2019-08-23 | 肥城矿业集团梁宝寺能源有限责任公司 | Erosion control area personnel security management system and management method |
| CN110427944A (en) * | 2019-09-06 | 2019-11-08 | 重庆紫光华山智安科技有限公司 | Acquisition methods, device, equipment and the storage medium of car plate detection data |
| CN110569445A (en) * | 2019-08-29 | 2019-12-13 | 湖北工业大学 | position-based neighbor detection method in social network |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102270233A (en) * | 2011-07-29 | 2011-12-07 | 中国航天科技集团公司第五研究院第五一三研究所 | Searching method for convex hull |
| CN102360509A (en) * | 2011-10-19 | 2012-02-22 | 浙江大学 | Method for judging space position relation of point and polygon by using maximum slope ray algorithm |
-
2012
- 2012-10-19 CN CN2012103986102A patent/CN102982562A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102270233A (en) * | 2011-07-29 | 2011-12-07 | 中国航天科技集团公司第五研究院第五一三研究所 | Searching method for convex hull |
| CN102360509A (en) * | 2011-10-19 | 2012-02-22 | 浙江大学 | Method for judging space position relation of point and polygon by using maximum slope ray algorithm |
Non-Patent Citations (2)
| Title |
|---|
| 丁健等: "基于边方向角长度表示的多边形方向、凹凸性及点包含算法", 《计算机辅助设计与图形学学报》, vol. 17, no. 6, 30 June 2005 (2005-06-30) * |
| 王晨等: "一种判断点和多边形包含关系的有效方法", 《计算机应用与软件》, vol. 22, no. 4, 30 April 2005 (2005-04-30) * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104575081A (en) * | 2014-12-08 | 2015-04-29 | 深圳市广和通实业发展有限公司 | Method for detecting entrance of vehicle into polygonal electronic fence region |
| CN104575081B (en) * | 2014-12-08 | 2018-01-09 | 深圳市广和通无线股份有限公司 | Vehicle enters the detection method in polygon fence region |
| CN105590333A (en) * | 2015-11-28 | 2016-05-18 | 中国石油大学(华东) | Method for determination of point-surface topological relation on the basis of delta-shaped region equation |
| CN105787968A (en) * | 2016-03-22 | 2016-07-20 | 北京建飞无限科技有限公司 | Polygon convex/concave point identification method and device |
| CN107884795A (en) * | 2016-09-30 | 2018-04-06 | 厦门雅迅网络股份有限公司 | The determination methods and its system in the disengaging region based on GPS |
| CN107884795B (en) * | 2016-09-30 | 2021-06-29 | 厦门雅迅网络股份有限公司 | Method and system for judging entering and exiting areas based on GPS |
| CN107562895A (en) * | 2017-09-06 | 2018-01-09 | 上海享骑电动车服务有限公司 | Geography fence |
| CN107610455A (en) * | 2017-09-06 | 2018-01-19 | 上海享骑电动车服务有限公司 | Fence |
| CN108076436A (en) * | 2017-11-16 | 2018-05-25 | 中国联合网络通信集团有限公司 | A kind of method and the network equipment of definite relative position |
| CN108076436B (en) * | 2017-11-16 | 2020-04-07 | 中国联合网络通信集团有限公司 | Method for determining relative position and network equipment |
| CN109238282A (en) * | 2018-07-26 | 2019-01-18 | 平安科技（深圳）有限公司 | A kind of position finding and detection method of robot, equipment and computer-readable medium |
| CN110159348A (en) * | 2019-05-28 | 2019-08-23 | 肥城矿业集团梁宝寺能源有限责任公司 | Erosion control area personnel security management system and management method |
| CN110569445A (en) * | 2019-08-29 | 2019-12-13 | 湖北工业大学 | position-based neighbor detection method in social network |
| CN110427944A (en) * | 2019-09-06 | 2019-11-08 | 重庆紫光华山智安科技有限公司 | Acquisition methods, device, equipment and the storage medium of car plate detection data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102982562A (en) | Method for judging whether target point is positioned inside polygon area | |
| CN108195377B (en) | Reflector matching algorithm based on triangular perimeter matching | |
| CN102155940B (en) | Solid target for binocular vision positioning and tracking system | |
| US20120261199A1 (en) | Hierarchical sensing method | |
| CN101615305B (en) | Method and device for detecting collision | |
| CN104299244A (en) | Obstacle detection method and device based on monocular camera | |
| CN109376383B (en) | Explosion view generation method based on collision detection | |
| CN104317772B (en) | A kind of Monte Carlo PARTICLE TRANSPORT FROM fast geometric disposal route based on space lattice segmentation | |
| EP2708847A1 (en) | Method, system and program for generating three-dimensional model | |
| CN105467370A (en) | Cross-range scaling method for precession object ISAR image of composite bistatic radar | |
| JP6185385B2 (en) | Spatial structure estimation apparatus, spatial structure estimation method, and spatial structure estimation program | |
| CN105893384A (en) | Method for establishing electronic fence in three-dimensional space | |
| CN103761739A (en) | Image registration method based on half energy optimization | |
| CN103337091A (en) | Flexible scene continuous collision detection method based on thickness | |
| CN105374037A (en) | Checkerboard angular point automatic screening method of corner detection | |
| CN105787081A (en) | Radiation platform correlation method based on radiation source space positions | |
| CN107238835B (en) | Formation target point navigation anti-crossing association method | |
| CN101114379A (en) | Method for judging point whether or not situated in polygon | |
| CN103942444A (en) | Parity 1-norm unequal length sequence similarity metric algorithm based on DTW | |
| CN104050641A (en) | Centralized multi-sensor column target particle filtering algorithm based on shape and direction descriptors | |
| CN104105197A (en) | Iteration method for processing node overturn ambiguity in wireless sensor network node location | |
| CN103940432A (en) | Posture determination method of star sensor | |
| CN113203424B (en) | Multi-sensor data fusion method and device and related equipment | |
| CN113340247B (en) | Continuous collision detection method for vehicle body contact type three-coordinate measurement | |
| CN107246863B (en) | Irregular section tunnel inner wall image projection expansion 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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20130320 |
|
| RJ01 | Rejection of invention patent application after publication |