CN113487666A - Intersection method and device of polygonal chain - Google Patents
Intersection method and device of polygonal chain Download PDFInfo
- Publication number
- CN113487666A CN113487666A CN202111046792.2A CN202111046792A CN113487666A CN 113487666 A CN113487666 A CN 113487666A CN 202111046792 A CN202111046792 A CN 202111046792A CN 113487666 A CN113487666 A CN 113487666A
- Authority
- CN
- China
- Prior art keywords
- chain
- monotone
- polygonal
- strict
- chains
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/60—Analysis of geometric attributes
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Geometry (AREA)
- Computer Vision & Pattern Recognition (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Image Analysis (AREA)
Abstract
The application provides an intersection method of a polygonal chain, which comprises the following steps: cutting the polygonal chain into at least one monotone chain; sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain; setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis, and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system; and setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, and scanning the strict monotone chain in sequence to obtain the intersection relation of the strict monotone chain. And rapidly judging the intersection relation of the polygonal chain by calculating and judging the projection repetitive relation of the polygonal chain on the abscissa axis. The application also provides an intersection device of the polygonal chain.
Description
Technical Field
The application relates to the field of spatial calculation processing, in particular to an intersection method of a polygonal chain. The application also provides an intersection device of the polygonal chain.
Background
In the current road fusion calculation scheme, the intersection problem is an important research direction. Currently, an image is scanned by first determining the intersection of a scan line and a polygon chain of a graph line, and determining the inside and outside of the image by determining the intersection. For example, when one scan line scans an image, it can be determined that the number of intersections of the scan line and the image is 4, and after the intersections are numbered A, B, C, D in sequence, it can be determined that the AB and CD line segments are intra-image, which also indicates that the polygon chain of the image has an intersection relationship. However, there is no method for rapidly determining the intersection relationship of the polygon chains.
Therefore, it is necessary to develop a method and an apparatus for intersecting a polygonal chain to solve at least one of the above technical problems.
Disclosure of Invention
In order to solve the above problem, an object of the present application is to provide a method for intersecting a polygonal chain, including:
cutting the polygonal chain into at least one monotone chain;
sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain;
setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis, and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system;
and setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, and scanning the strict monotone chain in sequence to obtain the intersection relation of the strict monotone chain.
Optionally, the determining multiple strictly monotonous chains of the polygonal chain according to the planar coordinate system includes:
rotating the polygonal chain to enable at least two extreme points of the polygonal chain to be the same as the distance between the transverse axis;
determining left and right extreme points and a monotone chain of the polygonal chain in the direction of the transverse axis;
and dividing the monotone chain into strict monotone chains according to the longitudinal axis of the plane coordinate system.
Optionally, the obtaining the intersection relationship of the strict monotone chain includes:
determining the horizontal axis coordinate of each demarcation point and each endpoint scanning line, and determining whether the projections of the adjacent strict monotone chains on the horizontal axis are overlapped or not according to the horizontal axis coordinate;
and if so, determining that the adjacent strict monotone chains intersect with the same scanning line.
Optionally, the polygonal chain is determined according to a connecting line of extreme points of the two-dimensional curve.
Optionally, the monotone chain is a group of line segments having overall monotonicity in a certain direction.
The present application further provides an intersection apparatus of polygonal chains, including:
the initial module is used for cutting the polygonal chain into at least one monotone chain;
the range module is used for sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain;
the dividing module is used for setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system;
and the judging module is used for setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, sequentially scanning the strict monotone chain and obtaining the intersection relation of the strict monotone chain.
Optionally, the dividing module further includes:
the rotating unit is used for rotating the polygonal chain to enable at least two extreme points of the polygonal chain to be the same as the distance between the transverse axis;
the determining unit is used for determining left and right extreme points and a monotone chain of the polygonal chain in the direction of the horizontal axis;
and the dividing unit is used for dividing the monotone chain into strict monotone chains according to the longitudinal axis of the plane coordinate system.
Optionally, the obtaining the intersection relationship of the strict monotone chain includes:
determining the horizontal axis coordinate of each demarcation point and each endpoint scanning line, and determining whether the projections of the adjacent strict monotone chains on the horizontal axis are overlapped or not according to the horizontal axis coordinate;
and if so, determining that the adjacent strict monotone chains intersect with the same scanning line.
Optionally, the polygonal chain is determined according to a connecting line of extreme points of the two-dimensional curve.
Optionally, the monotone chain is a group of line segments having overall monotonicity in a certain direction.
The beneficial effect of this application does:
the application provides an intersection method of a polygonal chain, which comprises the following steps: cutting the polygonal chain into at least one monotone chain; sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain; setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis, and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system; and setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, and scanning the strict monotone chain in sequence to obtain the intersection relation of the strict monotone chain. And rapidly judging the intersection relation of the polygonal chain by calculating and judging the projection repetitive relation of the polygonal chain on the abscissa axis.
Drawings
FIG. 1 is a flow chart of a method for intersection of polygonal chains in the present application;
FIG. 2 is a flow chart of strict monotone chain partitioning in the present application;
fig. 3 is a schematic diagram of an intersection device of the polygonal chain in the present application.
Detailed Description
In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present application, but the present application may be implemented in many ways other than those described herein, and it will be apparent to those skilled in the art that the present application may be practiced without departing from the spirit of the present application, and therefore the present application is not limited to the specific implementations disclosed below.
The embodiments described in the present application are only for illustrating the technical solutions of the present application, and some specific descriptions do not limit the scope of the technical solutions of the present application, and the specific descriptions include: name, code and illustration.
The application provides an intersection method of a polygonal chain, which comprises the following steps: cutting the polygonal chain into at least one monotone chain; sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain; setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis, and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system; and setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, and scanning the strict monotone chain in sequence to obtain the intersection relation of the strict monotone chain. And rapidly judging the intersection relation of the polygonal chain by calculating and judging the projection repetitive relation of the polygonal chain on the abscissa axis.
Fig. 1 is a flowchart of an intersection method of a polygon chain in the present application.
Referring to fig. 1, S101 cuts the polygonal chain into at least one monotone chain;
in this application, the polygonal chain is a polygonal chain established according to a polygonal shape of a spatial road, and then the polygonal chain is divided into at least one monotone chain. The polygonal chain is determined according to a connecting line of extreme points of the two-dimensional curve.
In the present application, the monotone chain is a group of line segments having an overall monotonicity in one determined direction, and the monotone chain allows line segments having an inverse monotonicity that does not affect the overall linear tendency. For example, A, B, C, D, the line segment AB and CD is upward, and if BC is downward and BC is downward does not affect the upward trend of the whole ABCD, the ABCD is called a monotonic chain.
S102, sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the polygon chain extreme point range;
after the monotonic chain is divided, an extreme point range needs to be found for the monotonic chain, and the extreme point range is the distance between monotonic extreme points. And when finding out all the extreme point ranges of the monotone chain, selecting the minimum extreme point range as the extreme point range of the monotone chain according to the size of the extreme point range.
Then, the extreme point range of each monotone chain is sorted from large to small, or from small to large. And after the sorting is finished, selecting the minimum extreme point range in the sequence, and setting the minimum extreme point range in the sequence as the extreme point range of the polygonal chain.
In this application, the extreme point range that can be selected as the polygon chain may be any one of the extreme point ranges in the sequence, and will not be described here.
S103, setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the horizontal axis direction, and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system;
it is mentioned above that an extreme point range has been determined for the polygon chain and then a scanning direction is selected from the extreme point range.
The scanning direction is a moving direction in which the polygon chain is scanned, and the scanning direction and the scanning line direction are perpendicular.
In this application, the scanning direction should be within the range of the extreme point, and then a line along the scanning direction is selected as the horizontal axis, i.e., the X axis, according to the actual polygon chain condition. The actual situation may be that the horizontal axis does not intersect the polygon chain, and the closest distance to the polygon chain is a preset value.
And after the transverse axis is determined, setting a longitudinal axis, namely a Y axis, which is perpendicular to the transverse axis at any time according to the relative position of the polygonal chain on the transverse axis.
Next, the monotone chain is strictly divided in a plane coordinate system composed of the X axis and the Y axis.
Fig. 2 is a flow chart of strict monotone chain partitioning in the present application.
As shown in figure 2 of the drawings,
s201, rotating the polygonal chain to enable at least two extreme points of the polygonal chain to be the same as the distance between the transverse axis;
s202, determining left and right extreme points and a monotone chain of the polygonal chain in the direction of the horizontal axis;
s203, dividing the monotone chain into strict monotone chains according to the longitudinal axis of the plane coordinate system.
S104, according to the demarcation point and the end point of the strict monotone chain, a scanning line perpendicular to the transverse axis is arranged, the strict monotone chain is scanned in sequence, and the intersection relation of the strict monotone chain is obtained.
The polygon chain is already arranged in a plane coordinate system, and the intersection relation judgment of the strict monotone chain is performed by wiring.
Firstly, setting scanning lines, and respectively setting a scanning line perpendicular to the X axis according to the dividing point and the end point of the strict monotone chain. Then, according to the scanning lines, the projection of the strict monotone chain on the X axis can be obtained, the horizontal axis coordinate of each dividing point and end point scanning line is determined, and whether the projection of the adjacent strict monotone chain on the horizontal axis is overlapped or not is determined according to the horizontal axis coordinate; and if so, determining that the adjacent strict monotone chains intersect with the same scanning line.
The judgment formula is as follows:
wherein, S is a judgment parameter,
is the coordinate value of the X axis of the two ends of the first chain of the adjacent strictly monotonous chains,
、
is the coordinate value of the two ends of the second strand of the adjacent strictly monotone strand on the X axis.
When S is less than or equal to 0, two adjacent strictly monotonic chains intersect, and vice versa.
The present application further provides an intersection apparatus of polygonal chains, including: an initial module 101, a range module 102, a dividing module 103 and a judging module 104.
Fig. 2 is a schematic diagram of an intersection device of the polygonal chain in the present application.
Referring to fig. 2, an initial module 101 is used for cutting a polygonal chain into at least one monotone chain;
in this application, the polygonal chain is a polygonal chain established according to a polygonal shape of a spatial road, and then the polygonal chain is divided into at least one monotone chain. The polygonal chain is determined according to a connecting line of extreme points of the two-dimensional curve.
In the present application, the monotone chain is a group of line segments having an overall monotonicity in one determined direction, and the monotone chain allows line segments having an inverse monotonicity that does not affect the overall linear tendency. For example, A, B, C, D, the line segment AB and CD is upward, and if BC is downward and BC is downward does not affect the upward trend of the whole ABCD, the ABCD is called a monotonic chain.
A range module 102, configured to sort the minimum extreme point range of each monotonic chain, and use the minimum extreme point range as an extreme point range of a polygonal chain;
after the monotonic chain is divided, an extreme point range needs to be found for the monotonic chain, and the extreme point range is the distance between monotonic extreme points. And when finding out all the extreme point ranges of the monotone chain, selecting the minimum extreme point range as the extreme point range of the monotone chain according to the size of the extreme point range.
Then, the extreme point range of each monotone chain is sorted from large to small, or from small to large. And after the sorting is finished, selecting the minimum extreme point range in the sequence, and setting the minimum extreme point range in the sequence as the extreme point range of the polygonal chain.
In this application, the extreme point range that can be selected as the polygon chain may be any one of the extreme point ranges in the sequence, and will not be described here.
The dividing module 103 is configured to set a plane coordinate system with the scanning direction determined by the extreme point range of the polygonal chain as a horizontal axis direction, and determine multiple strictly monotonous chains of the polygonal chain according to the plane coordinate system;
it is mentioned above that an extreme point range has been determined for the polygon chain and then a scanning direction is selected from the extreme point range.
The scanning direction is a moving direction in which the polygon chain is scanned, and the scanning direction and the scanning line direction are perpendicular.
In this application, the scanning direction should be within the range of the extreme point, and then a line along the scanning direction is selected as the horizontal axis, i.e., the X axis, according to the actual polygon chain condition. The actual situation may be that the horizontal axis does not intersect the polygon chain, and the closest distance to the polygon chain is a preset value.
And after the transverse axis is determined, setting a longitudinal axis, namely a Y axis, which is perpendicular to the transverse axis at any time according to the relative position of the polygonal chain on the transverse axis.
Next, the monotone chain is strictly divided in a plane coordinate system composed of the X axis and the Y axis.
In this application, the dividing module further includes:
the rotating unit is used for rotating the polygonal chain to enable at least two extreme points of the polygonal chain to be the same as the distance between the transverse axis;
the determining unit is used for determining left and right extreme points and a monotone chain of the polygonal chain in the direction of the transverse axis in the direction of the X axis;
and the dividing unit is used for further dividing the monotone chain along the Y axis to form a plurality of strict monotone chains, and dividing the monotone chains into the strict monotone chains.
And the judging module 104 is configured to set a scanning line perpendicular to the transverse axis according to the boundary point and the end point of the strict monotone chain, and sequentially scan the strict monotone chain to obtain an intersection relationship of the strict monotone chain.
The polygon chain is already arranged in a plane coordinate system, and the intersection relation judgment of the strict monotone chain is performed by wiring.
Firstly, setting scanning lines, and respectively setting a scanning line perpendicular to the X axis according to the dividing point and the end point of the strict monotone chain. Then, according to the scanning lines, the projection of the strict monotone chain on the X axis can be obtained, the horizontal axis coordinate of each dividing point and end point scanning line is determined, and whether the projection of the adjacent strict monotone chain on the horizontal axis is overlapped or not is determined according to the horizontal axis coordinate; and if so, determining that the adjacent strict monotone chains intersect with the same scanning line.
The judgment formula is as follows:
wherein, S is a judgment parameter,
is the coordinate value of the X axis of the two ends of the first chain of the adjacent strictly monotonous chains,
、
is the coordinate value of the two ends of the second strand of the adjacent strictly monotone strand on the X axis.
When S is less than or equal to 0, two adjacent strictly monotonic chains intersect, and vice versa.
Claims (10)
1. A method for intersecting a polygonal chain, comprising:
cutting the polygonal chain into at least one monotone chain;
sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain;
setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis, and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system;
and setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, and scanning the strict monotone chain in sequence to obtain the intersection relation of the strict monotone chain.
2. The method according to claim 1, wherein the determining the plurality of strictly monotonous chains of the polygonal chain according to the planar coordinate system comprises:
rotating the polygonal chain to enable at least two extreme points of the polygonal chain to be the same as the distance between the transverse axis;
determining left and right extreme points and a monotone chain of the polygonal chain in the direction of the transverse axis;
and dividing the monotone chain into strict monotone chains according to the longitudinal axis of the plane coordinate system.
3. The method for intersecting the polygonal chain according to claim 1, wherein the obtaining the intersection relationship of the strict monotone chain comprises:
determining the horizontal axis coordinate of each demarcation point and each endpoint scanning line, and determining whether the projections of the adjacent strict monotone chains on the horizontal axis are overlapped or not according to the horizontal axis coordinate;
and if so, determining that the adjacent strict monotone chains intersect with the same scanning line.
4. The method according to claim 1, wherein the polygon chains are determined according to a line connecting extreme points of a two-dimensional curve.
5. The method of claim 1, wherein the monotone chain is a set of line segments having an overall monotonicity in a specific direction.
6. An intersection apparatus of a polygonal chain, comprising:
the initial module is used for cutting the polygonal chain into at least one monotone chain;
the range module is used for sequencing the minimum extreme point range of each monotonic chain, and taking the minimum extreme point range as the extreme point range of the polygonal chain;
the dividing module is used for setting a plane coordinate system by taking the scanning direction determined by the extreme point range of the polygonal chain as the direction of a transverse axis and determining a plurality of strict monotone chains of the polygonal chain according to the plane coordinate system;
and the judging module is used for setting a scanning line perpendicular to the transverse axis according to the demarcation point and the end point of the strict monotone chain, sequentially scanning the strict monotone chain and obtaining the intersection relation of the strict monotone chain.
7. The apparatus for intersection of polygonal chains according to claim 6, wherein the dividing module further comprises:
the rotating unit is used for rotating the polygonal chain to enable at least two extreme points of the polygonal chain to be the same as the distance between the transverse axis;
the determining unit is used for determining left and right extreme points and a monotone chain of the polygonal chain in the direction of the horizontal axis;
and the dividing unit is used for dividing the monotone chain into strict monotone chains according to the longitudinal axis of the plane coordinate system.
8. The apparatus for intersecting the polygonal chain according to claim 6, wherein the obtaining the intersection relationship of the strict monotone chain comprises:
determining the horizontal axis coordinate of each demarcation point and each endpoint scanning line, and determining whether the projections of the adjacent strict monotone chains on the horizontal axis are overlapped or not according to the horizontal axis coordinate;
and if so, determining that the adjacent strict monotone chains intersect with the same scanning line.
9. The apparatus according to claim 6, wherein the polygon chains are determined according to the line connecting extreme points of the two-dimensional curve.
10. The apparatus for intersection of polygonal chains according to claim 6, wherein said monotonicity chain is a group of line segments having an overall monotonicity in a certain direction.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111046792.2A CN113487666B (en) | 2021-09-08 | 2021-09-08 | Intersection method and device of polygonal chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111046792.2A CN113487666B (en) | 2021-09-08 | 2021-09-08 | Intersection method and device of polygonal chain |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113487666A true CN113487666A (en) | 2021-10-08 |
| CN113487666B CN113487666B (en) | 2021-11-23 |
Family
ID=77946674
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111046792.2A Active CN113487666B (en) | 2021-09-08 | 2021-09-08 | Intersection method and device of polygonal chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113487666B (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107239508A (en) * | 2017-05-15 | 2017-10-10 | 电子科技大学 | One kind is used for geographical two-dimensional vector data abbreviation and transmission method |
| CN109000646A (en) * | 2018-04-25 | 2018-12-14 | 深圳臻迪信息技术有限公司 | Unmanned boat paths planning method and system based on concave polygon scanning area |
| CN112200886A (en) * | 2020-09-30 | 2021-01-08 | 苏州源卓光电科技有限公司 | Filling method of vector graphics |
-
2021
- 2021-09-08 CN CN202111046792.2A patent/CN113487666B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107239508A (en) * | 2017-05-15 | 2017-10-10 | 电子科技大学 | One kind is used for geographical two-dimensional vector data abbreviation and transmission method |
| CN109000646A (en) * | 2018-04-25 | 2018-12-14 | 深圳臻迪信息技术有限公司 | Unmanned boat paths planning method and system based on concave polygon scanning area |
| CN112200886A (en) * | 2020-09-30 | 2021-01-08 | 苏州源卓光电科技有限公司 | Filling method of vector graphics |
Non-Patent Citations (3)
| Title |
|---|
| SANG C. PARK 等: "Polygonal chain intersection", 《COMPUTERS & GRAPHICS》 * |
| 陈占龙 等: "基于单调链和STR 树的简单要素模型多边形叠置分析算法", 《测绘学报》 * |
| 陈正鸣 等: "多边形链求交的改进算法", 《计算机辅助设计与图形学学报》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113487666B (en) | 2021-11-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Wu | Adaptive split-and-merge segmentation based on piecewise least-square approximation | |
| CN109994038B (en) | Method and device for determining interest points in irregular area and electronic equipment | |
| CA3036558C (en) | Device and method for improving route planning computing devices | |
| CN1191352A (en) | Method and apparatus for adaptive nonlinear projective rendering | |
| CN112861201B (en) | 3D printing support area generation method based on support point expansion fusion | |
| CN1157060C (en) | Image interpolation system and image interpolocation method | |
| CN110796066B (en) | Lane line group construction method and device | |
| CN113953685B (en) | Planning method for laser cutting path of planar plate | |
| CN113487666B (en) | Intersection method and device of polygonal chain | |
| JP2800404B2 (en) | Polygon division method and apparatus | |
| CN106204719A (en) | Magnanimity model real-time scheduling method in three-dimensional scenic based on two-dimensional neighbourhood retrieval | |
| CN111462119A (en) | Wide and thick plate shearing stock layout method based on machine vision | |
| CN1975786A (en) | Progressive lattice generating method based on inverse loop subdivision | |
| CN117340277A (en) | Dual-optical system wind-shielding partition scanning method and device and additive manufacturing equipment | |
| CN104890236B (en) | The Stereo Lithography Apparatus Rapid Prototyping scanning pattern sort method of 3D printing | |
| CN110493853B (en) | Sequencing method for high-speed rail private network base stations | |
| CN111047617B (en) | Rectangle recognition optimization method, device and equipment | |
| CN116309118A (en) | Tunnel point cloud denoising method and system based on ray method | |
| US20130238985A1 (en) | Methods and devices for eliminating cracks within pages | |
| CN114444185A (en) | In-situ labeling identification method and device and electronic equipment | |
| CN112819074A (en) | Loss function optimization method, device and equipment for target detection model | |
| JP2005222138A (en) | Apparatus, method and program for cluster analysis using k-means method, and recording medium recording the same program | |
| JP4595045B2 (en) | Linear deformation apparatus and linear approximation method for deformation deformation | |
| CN101093584A (en) | Method and device for creating thick line | |
| CN111179375A (en) | Method and device for automatically generating outline graph of building bearing platform and computer storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 3015, 3 / F, 6 Chuangye Road, Shangdi Information Industry base, Haidian District, Beijing 100085 Patentee after: Yijing Zhilian (Suzhou) Technology Co.,Ltd. Address before: 3015, 3 / F, 6 Chuangye Road, Shangdi Information Industry base, Haidian District, Beijing 100085 Patentee before: Yijing Zhilian (Beijing) Technology Co.,Ltd. |