CN115100231A - Method and device for determining region boundary - Google Patents
Method and device for determining region boundary Download PDFInfo
- Publication number
- CN115100231A CN115100231A CN202210830300.7A CN202210830300A CN115100231A CN 115100231 A CN115100231 A CN 115100231A CN 202210830300 A CN202210830300 A CN 202210830300A CN 115100231 A CN115100231 A CN 115100231A
- Authority
- CN
- China
- Prior art keywords
- resident
- residence
- point
- sequence
- boundary
- 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
- 238000000034 method Methods 0.000 title claims abstract description 46
- 230000002776 aggregation Effects 0.000 claims abstract description 95
- 238000004220 aggregation Methods 0.000 claims abstract description 95
- 238000012545 processing Methods 0.000 claims description 11
- 238000004590 computer program Methods 0.000 claims description 9
- 238000001514 detection method Methods 0.000 claims description 8
- 238000012216 screening Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 18
- 238000004891 communication Methods 0.000 description 8
- 230000006870 function Effects 0.000 description 8
- 239000000383 hazardous chemical Substances 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 239000000126 substance Substances 0.000 description 5
- 238000004364 calculation method Methods 0.000 description 4
- 238000007726 management method Methods 0.000 description 4
- 230000003287 optical effect Effects 0.000 description 4
- 230000008901 benefit Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000005856 abnormality Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 101150029755 park gene Proteins 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000005070 sampling Methods 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000013439 planning Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/181—Segmentation; Edge detection involving edge growing; involving edge linking
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G06T5/70—
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/13—Edge detection
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/10—Segmentation; Edge detection
- G06T7/187—Segmentation; Edge detection involving region growing; involving region merging; involving connected component labelling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/20—Analysis of motion
- G06T7/246—Analysis of motion using feature-based methods, e.g. the tracking of corners or segments
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T7/00—Image analysis
- G06T7/70—Determining position or orientation of objects or cameras
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10016—Video; Image sequence
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/20—Special algorithmic details
- G06T2207/20092—Interactive image processing based on input by user
- G06T2207/20104—Interactive definition of region of interest [ROI]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/30—Subject of image; Context of image processing
- G06T2207/30241—Trajectory
Abstract
The invention discloses a method and a device for determining a regional boundary, and relates to the technical field of intelligent cities. One embodiment of the method comprises: detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time; selecting a resident sequence in a specified time period from the resident sequences according to the resident time; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area; and according to the boundary of the gathering area, carrying out boundary combination on the gathering area to obtain an area boundary. The method and the device not only realize accurate determination of the boundary of the area, but also are not limited by the type and the scale of the point of interest (POI), and can be more widely applied to the determination of the boundary of various functional areas.
Description
Technical Field
The invention relates to the technical field of intelligent cities, in particular to the technical field of urban area management, and specifically relates to a method and a device for determining a regional boundary.
Background
Urbanization is one of the prime forces for promoting social progress and economic development, and with the fine development of cities, functional areas of the cities are identified by using points of Interest (POI) on a map, so that better decision analysis can be provided for future planning of the cities, and convenience can be provided for persuasion and management of daily trips of residents. Although the POI is marked as a point in a city, the POI does not exist in an objective world in the form of a point, and the geometric boundary information of the POI is a plane of interest AOI (area of interest), which is a polygonal closed area surrounded by GPS longitude and latitude points. The existing method for determining the AOI of the urban regional boundary generally determines the regional boundary by using a clustering or semantic segmentation mode of vehicle check-in, a traffic network and remote sensing data.
In the process of implementing the invention, the inventor finds that the following problems exist in the prior art:
the spatial range of a fine-grained city functional area cannot be obtained, the detection error of the spatial range of densely distributed POI is large, the granularity of the obtained city functional area is too large, the interaction between the functional areas cannot be accurately described, and the application to the city functional area is not facilitated; for POIs with large differences in types and scales, the functional areas of cities cannot be well determined.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for determining a region boundary, where a dwell point sequence is obtained based on trajectory data, a boundary of a gathering region of a target object is obtained through position information of the dwell point sequence within a period of time, and the boundary of the gathering region is merged to obtain a region boundary, so that not only is accurate determination of the region boundary achieved, but also the method and the apparatus are not limited to the type and scale of a POI, and can be more widely applied to determining boundaries of various functional regions in a city.
To achieve the object, according to an aspect of an embodiment of the present invention, there is provided a method for determining a boundary of an area, including:
detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time;
selecting a resident sequence in a specified time period from the resident sequences according to the resident time;
determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area;
and according to the boundary of the aggregation area, carrying out boundary combination on the aggregation area to obtain an area boundary.
Optionally, before performing the dwell point detection according to the trajectory data, the method further includes: and carrying out smooth denoising processing on the track data, and updating the track data according to the processed track data.
Optionally, performing dwell point detection according to the trajectory data, and obtaining a dwell sequence of the target object includes: acquiring a set area radius; and taking the track point with the stay time exceeding a set time threshold value in the area radius range as a stay point, and obtaining the stay sequence of the target object according to the track data of the target object staying at the stay point.
Optionally, the parking sequence further comprises: the system comprises a resident target object identifier and a resident point identifier corresponding to the resident target object identifier, wherein the resident point identifier is used for uniquely identifying a resident point; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area, including:
step 1, a first residence point is taken out from a selected residence sequence and added into a first residence point set, and a first residence target object identification corresponding to the first residence point is obtained;
step 2, drawing a circle by taking the first resident point as a circle center and a set area radius as a radius to obtain a second resident point which is included in the circle and corresponds to the first resident target object identifier, and adding the second resident point to the first resident point set;
step 3, iteratively executing the step 2 for each second residing point in the first residing point set until the obtained circle does not include the residing point corresponding to the first residing target object identifier;
step 4, constructing a first external polygon according to the first resident point set, and adding resident points corresponding to a second resident target object identifier which is not the first resident target object identifier and is included in the first external polygon into a second resident point set;
step 5, the second residence point set is used as a selected residence sequence, the steps 1 to 4 are executed on the second residence point set, and the obtained second external polygon and the first external polygon are merged to obtain a merged external polygon;
and 6, updating the selected resident sequence, repeatedly executing the steps 1 to 5 until the resident sequence is empty, and taking each obtained merged circumscribed polygon as the boundary of the aggregation area corresponding to the merged circumscribed polygon.
Optionally, the step 5 includes: the second resident point set is used as the selected resident sequence, the steps 1 to 4 are executed on the second resident point set, and the second resident point set is updated; merging the updated second resident point set and the first resident point set to obtain a merged resident point set; and constructing a circumscribed polygon according to the combined resident point set to obtain a combined circumscribed polygon.
Optionally, performing boundary merging on the aggregation area according to the boundary of the aggregation area, including: according to the boundaries of the gathering areas, the distances between every two gathering areas are calculated respectively; and carrying out boundary merging on the aggregation areas with the distances smaller than the set merging distance threshold.
Optionally, performing boundary merging on the aggregation area according to the boundary of the aggregation area, including: taking each aggregation area as a node, and constructing an unauthorized undirected graph; calculating the distance between every two nodes; adding edges between two nodes with the distance smaller than a set merging distance threshold value in the unauthorized digraph to construct a communicated subgraph; and carrying out boundary combination on the nodes corresponding to the connected subgraphs.
Optionally, determining an aggregation area of the target object according to a residence point position included in the selected residence sequence includes: and converting the position of the residence point into a spatial index, and determining the gathering area of the target object according to the spatial index included in the selected residence sequence.
According to a second aspect of the embodiments of the present invention, there is provided an apparatus for determining a boundary of an area, including:
the residence sequence acquisition module is used for detecting residence points according to the track data to obtain a residence sequence of the target object, and the residence sequence comprises residence point positions and residence time;
the resident sequence screening module is used for selecting a resident sequence in a specified time period from the resident sequences according to the resident time;
the aggregation region acquisition module is used for determining an aggregation region of the target object according to the residence point position included in the selected residence sequence and generating a boundary of the aggregation region;
and the region boundary acquisition module is used for carrying out boundary combination on the aggregation regions according to the boundaries of the aggregation regions to obtain region boundaries.
According to a third aspect of the embodiments of the present invention, there is provided an electronic device for determining a boundary of an area, including:
one or more processors;
a storage device for storing one or more programs,
when the one or more programs are executed by the one or more processors, the one or more processors are caused to implement the method provided by the first aspect of the embodiments of the present invention.
According to a fourth aspect of embodiments of the present invention, there is provided a computer readable medium, on which a computer program is stored, which when executed by a processor, implements the method provided by the first aspect of embodiments of the present invention.
One embodiment of the invention has the following advantages or benefits: detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time; selecting a resident sequence in a specified time period from the resident sequences according to the resident time; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area; according to the technical scheme, the boundary of the aggregation region is merged according to the boundary of the aggregation region to obtain the region boundary, the resident point sequence is obtained based on the track data, the boundary of the aggregation region of the target object is obtained through the position information of the resident point sequence within a period of time, the boundary of the aggregation region is merged to obtain the region boundary, the region boundary is accurately determined and is not limited by the type and scale of the POI, and the method and the device can be widely applied to determining the boundary of various functional regions.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic view of a main flow of a region boundary determination method according to an embodiment of the present invention;
FIG. 2 is a first dwell point selection schematic of an embodiment of the invention;
FIG. 3 is a schematic diagram of a second dwell point acquisition of an embodiment of the present invention;
FIG. 4 is a residence point selection schematic of vehicle identification A in accordance with an embodiment of the present invention;
FIG. 5 is a schematic diagram of a first circumscribed polygon of an embodiment of the present invention;
FIG. 6 is a schematic diagram illustrating the selection of a dwell point using a second set of dwell points as a selected dwell sequence according to an embodiment of the present invention;
FIG. 7 is a diagram illustrating the result of merging bounding polygons in accordance with an embodiment of the present invention;
fig. 8 is a schematic diagram of main blocks of an area boundary determination apparatus according to an embodiment of the present invention;
FIG. 9 is an exemplary system architecture diagram in which embodiments of the present invention may be applied;
fig. 10 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
The current method for determining the regional boundary can not obtain the spatial range of fine-grained urban functional regions, has large detection error of the spatial range of densely distributed POI, obtains the interaction between the urban functional regions which has overlarge granularity and can not accurately describe the functional regions, and is not beneficial to the application of the urban functional regions; for POI with large differences in types and scales, urban functional area determination cannot be well carried out, and actual application cannot be well met.
In order to solve the above problems in the prior art, the present invention provides a method for determining a region boundary, which obtains a dwell point sequence based on trajectory data, obtains a boundary of a gathering region of a target object through position information of the dwell point sequence within a period of time, and combines the boundaries of the gathering region to obtain a region boundary.
In the description of the embodiments of the present invention, the terms and their meanings are as follows:
POI: the Point of Interest refers to any Point of non-geographic significance on the electronic map, and can be a house, a shop, a cell gate or a bus station;
and AOI, Area of Interest (ORE) surface refers to an Interest surface in an electronic map, and is used for expressing regional geographic entities in the map.
Fig. 1 is a schematic diagram of a main flow of a method for determining a region boundary according to an embodiment of the present invention, and as shown in fig. 1, the method for determining a region boundary according to an embodiment of the present invention includes steps S101 to S104 as follows.
Step S101, detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time.
Specifically, in a scenario where the boundary of the functional area of the city is determined, the determination of the boundary of the area may obtain an original data source through a running track of some target objects with functional purpose, for example, a mobile phone with a special application function, and may represent the distribution of a certain special functional area in the city according to the action track data of a mobile phone user; hazardous chemical vehicles for transporting hazardous chemicals, the vehicle trajectory data of which travel can characterize the functional area distribution in cities associated with hazardous chemicals. And taking the track data as a data source of the area boundary, and acquiring a resident point sequence which is valuable for determining the functional area boundary and comprises longitude and latitude position information of the resident point and resident starting and leaving time through resident point detection.
According to an embodiment of the present invention, before performing the resident point detection according to the track data, the method further includes: and carrying out smooth denoising processing on the track data, and updating the track data according to the processed track data.
Specifically, in the process of acquiring the trajectory data, due to the abnormality of the equipment and the information loss in the transmission process, data deviation and abnormality are caused, and in order to make the trajectory data more smooth and more in line with the distribution of the current state, noise points in the trajectory data need to be eliminated and corrected by combining the time-space attribute and the objective rule of the trajectory data, smooth denoising processing is performed, and the initial trajectory data is updated according to the processed trajectory data.
According to another embodiment of the present invention, the detecting the staying point according to the trajectory data to obtain the staying sequence of the target object includes: acquiring a set area radius; and taking the track point with the stay time exceeding a set time threshold value in the area radius range as a stay point, and obtaining the stay sequence of the target object according to the track data of the target object staying at the stay point.
Specifically, the target object may be a physical object with a moving property, such as a mobile phone and a hazardous chemical substance vehicle as mentioned above, in this embodiment, the vehicle for transporting the hazardous chemical substance is mainly taken as an example, when the vehicle stays in a specified area for a time longer than a preset threshold, the vehicle is defined to stay in the area, the vehicle at least includes a delivery location and a receiving location during a complete transportation process, in an embodiment of the present invention, the radius of the area is usually set to 20 meters, and the time threshold may take a value between 20 minutes and 30 minutes. The track data usually includes information such as vehicle ID, sampling time, and latitude and longitude positions of the vehicle at the time of sampling, and according to this, the radius of the area is set to R; according to the data information of the vehicle track, in the area range of the radius R, track points with the stopping time exceeding a set time threshold value are used as stopping points, and the track data are converted into structural data including a vehicle ID, longitude and latitude positions of the stopping points, stopping starting time, stopping ending time and the like, so that a stopping sequence of the vehicle is obtained.
By detecting the parking point meeting the parking requirement from the track data based on the vehicle destination parking, an effective data source for representing the geographic functional area related to the vehicle can be obtained.
And S102, selecting a resident sequence in a specified time period from the resident sequences according to the resident time.
Specifically, the trajectory data is continuously updated, based on the residence sequence, vehicle residence information in a period of time is selected to determine the region boundary, and according to the residence time of the vehicles in the residence sequence, the residence sequence in the designated period of time is selected from the residence information, and the residence sequence including the residence points in the designated period of time and corresponding spatial distribution is used as a direct data source for determining the region boundary.
Step S103, determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area.
According to an embodiment of the invention, the park sequence further comprises: the system comprises a resident target object identifier and a resident point identifier corresponding to the resident target object identifier, wherein the resident point identifier is used for uniquely identifying a resident point; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area, including:
step 1, a first residence point is taken out from a selected residence sequence and added into a first residence point set, and a first residence target object identification corresponding to the first residence point is obtained;
step 2, drawing a circle by taking the first resident point as a circle center and a set area radius as a radius to obtain a second resident point which is included in the circle and corresponds to the first resident target object identifier, and adding the second resident point to the first resident point set;
step 3, iteratively executing the step 2 for each second residing point in the first residing point set until the obtained circle does not include the residing point corresponding to the first residing target object identifier;
step 4, constructing a first external polygon according to the first resident point set, and adding resident points corresponding to a second resident target object identifier which is not the first resident target object identifier and is included in the first external polygon into a second resident point set;
step 5, the second residence point set is used as a selected residence sequence, the steps 1 to 4 are executed on the second residence point set, and the obtained second external polygon and the first external polygon are merged to obtain a merged external polygon;
and 6, updating the selected resident sequence, repeatedly executing the steps 1 to 5 until the resident sequence is empty, and taking each obtained merged circumscribed polygon as the boundary of the aggregation area corresponding to the merged circumscribed polygon.
Specifically, under the scene that the target object is a hazardous chemical substance vehicle, the resident target object identifier is a vehicle identifier, the selected resident sequence comprises resident point information of a plurality of vehicles, resident points in the resident sequence are randomly selected to obtain a corresponding vehicle identifier, a vehicle gathering area which is the same as the vehicle identifier is determined, and a boundary B of the area of the vehicle identifier A is generated; traversing the resident points of other vehicles except A in the B by a similar method, generating a boundary Br of the area of the relevant vehicle identification, and combining the Br and the B to obtain a boundary Bp of the complete area of the A; traversing other unvisited resident points in the resident sequence by a similar method for acquiring the Bp to obtain a boundary set of all functional regions of the resident sequence.
Illustratively, taking the parking sequence D of three vehicles with vehicle identifications A, B, C as an example, the method for determining the boundary AOI of a specific area is as follows:
step 1, for a residence sequence D, randomly selecting a first residence point from the D, wherein the residence point is marked as PA 1 Mixing PA 1 Added to the first set of anchor points Z1, i.e., Z1 ═ { PA } 1 And recording the first resident vehicle identifier as A.
FIG. 2 is a first dwell point selection scheme, wherein PA is shown, in accordance with an embodiment of the present invention 1 To PA 9 、PB 1 To PB 3 And PC 1 To PC 3 Respectively representing the parking points of the vehicle identifications A, B and C in the parking sequence D, and selectingTaking PA 1 Is the first dwell point.
Step 2, using PA 1 Setting a radius R of the area as a circle center, drawing a circle by taking the radius as the radius, recording the resident points marked as A of all vehicles in the circular area as second resident points, adding the second resident points into the first resident point set Z1, and regarding a circle center resident point PA 1 Has already been added in step 1, so it is no longer necessary to add the center PA 1 。
FIG. 3 is a diagram of a second dwell point acquisition, denoted PA, according to an embodiment of the invention 1 Drawing a circle with the circle center R as a radius, wherein a parking point with the vehicle identifier A in the circular area is a second parking point, and the second parking point is PA in the figure 2 And PA 4 。
Step 3, according to step 2, taking fig. 3 as an example, when the first set of stagnation points Z1 ═ PA 1 ；PA 2 ；PA 4 H, adding a second dwell point PA to the first dwell point set 2 And PA 4 Step 2 is iteratively performed until there are no more dwell points within the circular area for the vehicle identified as a.
FIG. 4 is a schematic representation of the parking spot selection for the vehicle identification A, respectively PA, according to an embodiment of the present invention 2 And PA 4 Using R as radius as circle center, searching the resident point of the vehicle identification A in the circular area to obtain a second resident point PA 8 、PA 3 、PA 5 、PA 6 、PA 7 。
Step 4, according to step 3 and fig. 4, it can be known that the first stagnation point set Z1 ═ { PA ═ s 1 ；PA 2 ；PA 4 ；PA 8 ；PA 3 ；PA 5 ；PA 6 ；PA 7 A first circumscribed polygon is constructed according to the first dwell point set, fig. 5 is a schematic view of the first circumscribed polygon according to the embodiment of the present invention, and in fig. 5, the dwell points PB including the vehicle identifiers B and C in the circumscribed polygon can be seen 1 、PB 2 And PC 2 Adding the residing point corresponding to the second residing vehicle identification which is not the first residing vehicle identification and is included in the first circumscribed polygon to the second residing point set to obtain a second residing point set Z2 ═ PB 1 ；PB 2 ；PC 2 }。
And 5, taking the second residence point set Z2 as the selected residence sequence, repeatedly executing the steps 1 to 4 to obtain a second circumscribed polygon, and merging the second circumscribed polygon and the first circumscribed polygon to obtain a merged circumscribed polygon, namely a complete functional area boundary AOI.
Fig. 6 is a schematic diagram of selecting a dwell point according to the embodiment of the present invention, where the dwell sequence is selected from the second dwell point set, and the above steps 1 to 3 are repeatedly performed to obtain Z2 ═ PB 1 ；PB 2 ；PC 2 ；PC 1 ；PB 3 }。
It should be noted that, when there is an unvisited dwell point in the polygon, the above steps 1 to 4 are repeatedly executed according to step 5, with the unvisited dwell point as the selected dwell sequence, and the polygons are merged until there is no unvisited dwell point in the polygon.
FIG. 7 is a diagram illustrating the result of merging circumscribed polygons obtained by merging the first circumscribed polygon of FIG. 5 with the second circumscribed polygon obtained from the second set of vertices Z2 of FIG. 6 according to an embodiment of the present invention.
And 6, according to the accessed and selected residence points of the residence sequence D, repeatedly executing the steps 1 to 5 for the residence points of other vehicle identifications which are not accessed until all the residence points in the residence sequence D are traversed, and taking the combined circumscribed polygon related to the obtained other vehicle identifications as the boundary of the aggregation area of the corresponding vehicle to obtain the set of the boundaries of the aggregation areas of all the vehicles in the selected residence sequence D.
According to an embodiment of the present invention, the step 5 includes: the second resident point set is used as a selected resident sequence, the steps 1 to 4 are executed on the second resident point set, and the second resident point set is updated; merging the updated second resident point set with the first resident point set to obtain a merged resident point set; and constructing a circumscribed polygon according to the combined resident point set to obtain a combined circumscribed polygon.
Specifically, for the second circumscribed polygon obtained by performing the steps 1 to 4, there is usually a coincidence with the first circumscribed polygon, and the polygons may be merged by adopting a method of merging the residing point sets, and the second residing point set is updated according to the steps 1 to 4; establishing a merging and residing point set for merging the updated second residing point set and the first residing point set; and constructing a circumscribed polygon according to the distribution of the resident points in the combined resident point set to obtain the combined circumscribed polygon.
By the method for determining the boundary of the gathering area, the situation that POIs of the same type are densely distributed can be effectively solved, for example, a large number of chemical industry related enterprises are distributed in a chemical industry park, and all residence points of an area in a certain range are collected together to obtain a polygonal area through residence points of different time dimensions of the same vehicle; all the residence points in the area can be regarded as residence points belonging to the same POI range, and construction and combination of related polygons are carried out; in addition, the newly-added resident points can expand the original polygon, and the polygon area is obtained as a partial spatial range of the current POI through continuous iteration until the stability is reached.
Through the method for determining the boundary of the aggregation area of the target object, the appropriate area radius and the merging distance threshold can be set according to POIs of different types and scales, so that the determination of the boundary of the city function area suitable for the POIs of different types and scales is realized.
According to another embodiment of the present invention, determining the aggregation area of the target object according to the location of the residence point included in the selected residence sequence includes: and converting the position of the residence point into a spatial index, and determining an aggregation area of the target object according to the spatial index included in the selected residence sequence.
Specifically, in view of frequent spatial relationship calculation among the multiple residence points, in order to reduce calculation complexity and reduce operation time, a rectangular spatial index may be established according to the residence point position information, and after the preliminary selection is completed according to the spatial index included in the selected residence sequence by combining the radius R, the aggregation area of the target object is determined by accurate calculation; or a spatial index of enough data can be established according to the position of the residence point, the position of the residence point is converted into the spatial index, and the gathering area of the target object is determined according to the spatial index included in the selected residence sequence, so that the vehicle gathering area within the tolerance precision range is obtained.
The spatial index can effectively reduce the calculation complexity and improve the determination efficiency of the aggregation area.
And step S104, carrying out boundary combination on the aggregation areas according to the boundaries of the aggregation areas to obtain area boundaries.
Specifically, the area of the POI may be obtained preliminarily through the acquisition of the aggregation areas, and since the scale and the spatial shape of the POI are different and different functional areas may be divided in the spatial range of the POI, the distance determination and the merging need to be performed on the multiple aggregation areas, so as to finally obtain the area boundary.
According to an embodiment of the present invention, performing boundary merging on the aggregation area according to the boundary of the aggregation area includes: according to the boundaries of the gathering areas, the distances between every two gathering areas are calculated respectively; and carrying out boundary merging on the aggregation areas with the distances smaller than the set merging distance threshold.
Specifically, according to the actual distribution of the urban functional areas, when the minimum distance between the aggregation areas of the target object is smaller than the merging distance threshold, it can be considered as belonging to one urban functional area, and the merging processing can be performed, so that the shortest distance between the boundaries is determined according to the boundaries of the aggregation areas, and when the distance is smaller than the set merging distance threshold, the boundaries of the aggregation areas in a short distance are merged to obtain the area boundary.
According to another embodiment of the present invention, performing boundary merging on the aggregation areas according to the boundaries of the aggregation areas includes: taking each aggregation area as a node, and constructing an unauthorized undirected graph; calculating the distance between every two nodes; adding edges between two nodes with the distance smaller than a set merging distance threshold value in the unauthorized digraph to construct a communicated subgraph; and carrying out boundary combination on the nodes corresponding to the connected subgraphs.
Specifically, each obtained aggregation area is used as a node, and an unweighted undirected graph G is constructed; respectively calculating the distance d between every two nodes; adding edges between the two nodes to construct a connected subgraph under the condition that d is smaller than a set merging distance threshold distance; and combining the polygons corresponding to all the communication sub-graphs in the G to obtain the region boundary.
Fig. 8 is a schematic diagram of main blocks of an area boundary determination apparatus according to an embodiment of the present invention. As shown in fig. 8, the apparatus 800 for determining a region boundary mainly includes a resident sequence acquiring module 801, a resident sequence screening module 802, an aggregation region acquiring module 803, and a region boundary acquiring module 804.
A residence sequence obtaining module 801, configured to perform residence point detection according to the trajectory data to obtain a residence sequence of the target object, where the residence sequence includes a residence point position and residence time;
a resident sequence screening module 802, configured to select a resident sequence in a specified time period from the resident sequences according to the residence time;
an aggregation region obtaining module 803, configured to determine an aggregation region of the target object according to a residence point position included in the selected residence sequence, and generate a region boundary of the aggregation region;
and the area boundary acquiring module 804 is configured to perform boundary merging on the aggregation areas according to the boundaries of the aggregation areas to obtain area boundaries.
In particular, the device 800 for determining the region boundary further comprises a denoising module (not shown in the figure) for: and before detecting the resident points according to the track data, carrying out smooth denoising processing on the track data, and updating the track data according to the processed track data.
Specifically, the resident sequence acquiring module 801 may further be configured to: acquiring a set area radius; and taking the track point with the stay time exceeding a set time threshold value in the area radius range as a stay point, and obtaining the stay sequence of the target object according to the track data of the target object staying at the stay point.
Specifically, the parking sequence further comprises: the system comprises a resident target object identifier and a resident point identifier corresponding to the resident target object identifier, wherein the resident point identifier is used for uniquely identifying a resident point; the aggregation area obtaining module 803 may further be configured to: a first residence point is taken out from the selected residence sequence and added into a first residence point set, and a first residence target object identifier corresponding to the first residence point is obtained; drawing a circle by taking the first resident point as a circle center and a set area radius as a radius to obtain a second resident point which is included in the circle and corresponds to the first resident target object identifier, and adding the second resident point into the first resident point set; iteratively executing the step 2 for each second residing point in the first residing point set until the obtained circle does not include the residing point corresponding to the first residing target object identifier; constructing a first external polygon according to the first resident point set, and adding resident points corresponding to a second resident target object identification which is not the first resident target object identification and is included in the first external polygon into a second resident point set; the second dwell point set is used as a selected dwell sequence, the steps 1 to 4 are carried out on the second dwell point set, and the obtained second circumscribed polygon and the first circumscribed polygon are combined to obtain a combined circumscribed polygon; and updating the selected resident sequence, repeatedly executing the steps 1 to 5 until the resident sequence is empty, and taking each obtained merged circumscribed polygon as the boundary of the aggregation area corresponding to the merged circumscribed polygon.
Specifically, the aggregation area obtaining module 803 is further configured to: the second resident point set is used as the selected resident sequence, the steps 1 to 4 are executed on the second resident point set, and the second resident point set is updated; merging the updated second resident point set and the first resident point set to obtain a merged resident point set; and constructing a circumscribed polygon according to the combined resident point set to obtain a combined circumscribed polygon.
Specifically, the region boundary obtaining module 804 may be further configured to: according to the boundaries of the gathering areas, the distances between every two gathering areas are calculated respectively; and carrying out boundary merging on the aggregation areas with the distances smaller than the set merging distance threshold.
Specifically, the region boundary obtaining module 804 may be further configured to: taking each aggregation area as a node, and constructing an unauthorized undirected graph; calculating the distance between every two nodes; adding edges between two nodes with the distance smaller than a set merging distance threshold value in the unauthorized digraph to construct a communicated subgraph; and carrying out boundary combination on the nodes corresponding to the connected subgraphs.
Specifically, the aggregation area obtaining module 803 may further be configured to: and converting the position of the residence point into a spatial index, and determining an aggregation area of the target object according to the spatial index included in the selected residence sequence.
Fig. 9 is an exemplary system architecture diagram in which embodiments of the present invention may be employed.
As shown in fig. 9, the system architecture 900 may include end devices 901, 902, 903, a network 904, and a server 905. Network 904 is the medium used to provide communication links between terminal devices 901, 902, 903 and server 905. Network 904 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 901, 902, 903 to interact with a server 905 over a network 904 to receive or send messages or the like. The terminal devices 901, 902, 903 may have installed thereon various communication client applications, such as an application for determining a zone boundary, etc. (for example only).
The terminal devices 901, 902, 903 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 905 may be a server providing various services, such as a background management server (for example only) providing support for the determination of zone boundaries by users using the terminal devices 901, 902, 903. The background management server can detect the residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises the residence point position and residence time; selecting a residence sequence in a specified time period from the residence sequences according to the residence time; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area; according to the boundary of the aggregation area, the aggregation area is subjected to boundary combination to obtain area boundary and other processing, and a processing result (such as boundary data and the like, which are only examples) is fed back to the terminal equipment.
It should be noted that the method for determining the area boundary provided by the embodiment of the present invention is generally executed by the server 905, and accordingly, the apparatus for determining the area boundary is generally disposed in the server 905.
It should be understood that the number of terminal devices, networks, and servers in fig. 9 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 10, a block diagram of a computer system 1000 suitable for use with a terminal device or server implementing embodiments of the present invention is shown. The terminal device or the server shown in fig. 10 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 10, the computer system 1000 includes a Central Processing Unit (CPU)1001 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)1002 or a program loaded from a storage section 1008 into a Random Access Memory (RAM) 1003. In the RAM 1003, various programs and data necessary for the operation of the system 1000 are also stored. The CPU 1001, ROM 1002, and RAM 1003 are connected to each other via a bus 1004. An input/output (I/O) interface 1005 is also connected to bus 1004.
The following components are connected to the I/O interface 1005: an input section 1006 including a keyboard, a mouse, and the like; an output section 1007 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 1008 including a hard disk and the like; and a communication section 1009 including a network interface card such as a LAN card, a modem, or the like. The communication section 1009 performs communication processing via a network such as the internet. The driver 1010 is also connected to the I/O interface 1005 as necessary. A removable medium 1011 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 1010 as necessary, so that a computer program read out therefrom is mounted into the storage section 1008 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication part 1009 and/or installed from the removable medium 1011. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 1001.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present invention may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor comprising: the device comprises a resident sequence acquisition module, a resident sequence screening module, an aggregation region acquisition module and a region boundary acquisition module.
The names of these modules do not form a definition of the module itself under certain circumstances, for example, the area boundary acquiring module may also be described as "a module for performing boundary merging on the aggregation areas according to the boundaries of the aggregation areas to obtain area boundaries".
In another aspect, the present invention also provides a computer-readable medium, which may be contained in the apparatus described in the embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by an apparatus, cause the apparatus to comprise: detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time; selecting a resident sequence in a specified time period from the resident sequences according to the resident time; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area; and according to the boundary of the gathering area, carrying out boundary combination on the gathering area to obtain an area boundary.
According to the technical scheme of the embodiment of the invention, the method has the following advantages or beneficial effects: detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time; selecting a resident sequence in a specified time period from the resident sequences according to the resident time; determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area; according to the technical scheme, the boundary of the gathering area is merged according to the boundary of the gathering area to obtain the area boundary, the resident point sequence is obtained based on the track data, the boundary of the gathering area of the target object is obtained through the position information of the resident point sequence within a period of time, the boundary of the gathering area is merged to obtain the area boundary, the area boundary is accurately determined, the POI type and the POI scale are not limited, and the method and the device can be widely applied to determining the boundary of various functional areas of a city.
The specific embodiments are not to be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (11)
1. A method for determining a boundary of a region, comprising:
detecting a residence point according to the track data to obtain a residence sequence of the target object, wherein the residence sequence comprises a residence point position and residence time;
selecting a resident sequence in a specified time period from the resident sequences according to the resident time;
determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area;
and according to the boundary of the gathering area, carrying out boundary combination on the gathering area to obtain an area boundary.
2. The method of claim 1, prior to performing the dwell point detection based on the trajectory data, further comprising:
and carrying out smooth denoising processing on the track data, and updating the track data according to the processed track data.
3. The method according to claim 1 or 2,
detecting a residence point according to the track data, and obtaining a residence sequence of the target object comprises the following steps:
acquiring a set area radius;
and taking the track point with the stay time exceeding a set time threshold value in the area radius range as a stay point, and obtaining the stay sequence of the target object according to the track data of the target object staying at the stay point.
4. The method of claim 1, wherein the parking sequence further comprises: the system comprises a resident target object identifier and a resident point identifier corresponding to the resident target object identifier, wherein the resident point identifier is used for uniquely identifying a resident point;
determining an aggregation area of the target object according to the residence point position included in the selected residence sequence, and generating a boundary of the aggregation area, including:
step 1, a first residence point is taken out from a selected residence sequence and added into a first residence point set, and a first residence target object identification corresponding to the first residence point is obtained;
step 2, drawing a circle by taking the first resident point as a circle center and a set area radius as a radius to obtain a second resident point which is included in the circle and corresponds to the first resident target object identifier, and adding the second resident point into the first resident point set;
step 3, iteratively executing the step 2 for each second residing point in the first residing point set until the obtained circle does not include the residing point corresponding to the first residing target object identifier;
step 4, constructing a first external polygon according to the first resident point set, and adding resident points corresponding to a second resident target object identifier which is not the first resident target object identifier and is included in the first external polygon into a second resident point set;
step 5, the second residence point set is used as a selected residence sequence, the steps 1 to 4 are executed on the second residence point set, and the obtained second external polygon and the first external polygon are merged to obtain a merged external polygon;
and 6, updating the selected resident sequence, repeatedly executing the steps 1 to 5 until the resident sequence is empty, and taking each obtained merged circumscribed polygon as the boundary of the aggregation area corresponding to the merged circumscribed polygon.
5. The method according to claim 4, wherein the step 5 comprises:
the second resident point set is used as the selected resident sequence, the steps 1 to 4 are executed on the second resident point set, and the second resident point set is updated;
merging the updated second resident point set with the first resident point set to obtain a merged resident point set;
and constructing a circumscribed polygon according to the combined resident point set to obtain a combined circumscribed polygon.
6. The method according to claim 1, wherein performing boundary merging on the aggregation region according to the boundary of the aggregation region comprises:
according to the boundaries of the gathering areas, the distance between every two gathering areas is calculated;
and carrying out boundary merging on the aggregation areas with the distances smaller than the set merging distance threshold.
7. The method according to claim 1 or 6, wherein performing boundary merging on the aggregation areas according to the boundaries of the aggregation areas comprises:
taking each aggregation area as a node, and constructing an unauthorized undirected graph;
calculating the distance between every two nodes;
adding edges between two nodes with the distance smaller than a set merging distance threshold value in the unweighted undirected graph to construct a communicated subgraph;
and carrying out boundary combination on the nodes corresponding to the connected subgraphs.
8. The method of claim 1, wherein determining the aggregation area of the target object according to the location of the residence point included in the selected residence sequence comprises:
and converting the position of the residence point into a spatial index, and determining an aggregation area of the target object according to the spatial index included in the selected residence sequence.
9. An apparatus for determining a boundary of a region, comprising:
the residence sequence acquisition module is used for detecting residence points according to the track data to obtain a residence sequence of the target object, and the residence sequence comprises residence point positions and residence time;
the resident sequence screening module is used for selecting a resident sequence in a specified time period from the resident sequences according to the resident time;
the aggregation region acquisition module is used for determining an aggregation region of the target object according to the residence point position included in the selected residence sequence and generating a boundary of the aggregation region;
and the region boundary acquisition module is used for carrying out boundary combination on the aggregation regions according to the boundaries of the aggregation regions to obtain region boundaries.
10. A mobile electronic device terminal, comprising:
one or more processors;
a storage device to store one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-8.
11. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210830300.7A CN115100231A (en) | 2022-07-15 | 2022-07-15 | Method and device for determining region boundary |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210830300.7A CN115100231A (en) | 2022-07-15 | 2022-07-15 | Method and device for determining region boundary |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115100231A true CN115100231A (en) | 2022-09-23 |
Family
ID=83296362
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210830300.7A Pending CN115100231A (en) | 2022-07-15 | 2022-07-15 | Method and device for determining region boundary |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115100231A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116911511A (en) * | 2023-09-14 | 2023-10-20 | 中建三局信息科技有限公司 | Commercial concrete transportation vehicle real-time management method, device, equipment and storage medium |
-
2022
- 2022-07-15 CN CN202210830300.7A patent/CN115100231A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116911511A (en) * | 2023-09-14 | 2023-10-20 | 中建三局信息科技有限公司 | Commercial concrete transportation vehicle real-time management method, device, equipment and storage medium |
| CN116911511B (en) * | 2023-09-14 | 2023-12-12 | 中建三局信息科技有限公司 | Commercial concrete transportation vehicle real-time management method, device, equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109376761B (en) | Address identification and longitude and latitude mining method and device thereof | |
| CN110533055B (en) | Point cloud data processing method and device | |
| US20150088417A1 (en) | System and Method for Dynamic Path Optimization | |
| WO2022227303A1 (en) | Information processing method and apparatus, computer device, and storage medium | |
| CN112033420A (en) | Lane map construction method and device | |
| CN111311193B (en) | Method and device for configuring public service resources | |
| CN114003613A (en) | High-precision map lane line updating method and device, electronic equipment and storage medium | |
| CN115100231A (en) | Method and device for determining region boundary | |
| US20230137263A1 (en) | Method and apparatus for generating structured trajectories from geospatial observations | |
| CN114519061A (en) | Map data updating method, device, electronic equipment and medium | |
| CN117079148B (en) | Urban functional area identification method, device, equipment and medium | |
| CN117171288B (en) | Grid map analysis method, device, equipment and medium | |
| CN112988933A (en) | Method and device for managing address information | |
| CN115830578B (en) | Article inspection method and device and electronic equipment | |
| CN116561240A (en) | Electronic map processing method, related device and medium | |
| CN114820960B (en) | Method, device, equipment and medium for constructing map | |
| CN112256811B (en) | Map information representation method and device based on map structure | |
| Yap et al. | A Global Feature-Rich Network Dataset of Cities and Dashboard for Comprehensive Urban Analyses | |
| CN113008246B (en) | Map matching method and device | |
| CN114814802A (en) | Positioning method and device | |
| CN114944056B (en) | Traffic reachability calculation method and device | |
| CN115115944B (en) | Map data checking method and device, electronic equipment and medium | |
| CN110633334A (en) | Method and device for acquiring information | |
| CN114199227B (en) | Navigation path planning method and device | |
| CN112396081A (en) | Data fusion method and device |
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 |