[go: up one dir, main page]

CN107784079A - A kind of magnanimity static object management method under space coordinates - Google Patents

A kind of magnanimity static object management method under space coordinates Download PDF

Info

Publication number
CN107784079A
CN107784079A CN201710895323.5A CN201710895323A CN107784079A CN 107784079 A CN107784079 A CN 107784079A CN 201710895323 A CN201710895323 A CN 201710895323A CN 107784079 A CN107784079 A CN 107784079A
Authority
CN
China
Prior art keywords
node
data
spatial
target
lng
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
Application number
CN201710895323.5A
Other languages
Chinese (zh)
Inventor
李彭伟
李亚钊
王玉珠
吴青松
郑伟
丁及堃
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
CETC 28 Research Institute
Original Assignee
CETC 28 Research Institute
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by CETC 28 Research Institute filed Critical CETC 28 Research Institute
Priority to CN201710895323.5A priority Critical patent/CN107784079A/en
Publication of CN107784079A publication Critical patent/CN107784079A/en
Pending legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29Geographical information databases
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/445Program loading or initiating
    • G06F9/44521Dynamic linking or loading; Link editing at or after load time, e.g. Java class loading
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/50Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5016Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2209/00Indexing scheme relating to G06F9/00
    • G06F2209/50Indexing scheme relating to G06F9/50
    • G06F2209/5018Thread allocation

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Software Systems (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Remote Sensing (AREA)
  • Data Mining & Analysis (AREA)
  • Processing Or Creating Images (AREA)

Abstract

The invention discloses the magnanimity static object management method under a kind of space coordinates, static object of this method based on spatial scene tree management magnanimity, cutting control is carried out to spatial scene tree simultaneously, plus-minus counting processing is carried out to the data in node according to the observability of spatial scene tree node, and dynamic plus unloading are carried out to data by multithreading offline access technology.This method has higher recall precision, solve the problems, such as in plane scene to object height, bounding box processing it is difficult, effectively solve the problems such as magnanimity static object EMS memory occupation is big, display management is difficult, efficiency is low under space coordinates.

Description

A kind of magnanimity static object management method under space coordinates
Technical field
The present invention relates to the magnanimity target display management method under CyberSpace coordinate system, more particularly to a kind of space to sit Magnanimity static object management method under mark system.
Background technology
Current various GIS-Geographic Information System with emulation platform, the use to static object engender capacity it is big, when Effect is high, the requirement that delay is small, EMS memory occupation is low.As the landmark data in GIS-Geographic Information System is ten hundreds of, space galaxy management In it is even more hundreds of millions of.The static object data of these magnanimity how are efficiently managed, have become the key of measurement system Technology, traditional linear regulation control, two dimensional surface scene management etc. is all increasingly unable to meet demand, such as travel time in linear regulation control It is long, serious image efficiency;Two dimensional surface scene management can not then solve the height problem of target.
The content of the invention
Goal of the invention:For problem above, the present invention proposes the magnanimity static object manager under a kind of space coordinates Method, it is effective to solve the problems such as magnanimity static object EMS memory occupation is big, display management is difficult, efficiency is low under space coordinates.
Technical scheme:To realize the purpose of the present invention, the technical solution adopted in the present invention is:Under a kind of space coordinates Magnanimity static object management method, comprise the following steps:
(1) the static object point of input is standardized, forms the static object data of standard;
(2) spatial scene tree is created, static object data is traveled through, adds data in suitable node, as node is deposited Data are then being deployed to the node, new node is otherwise being created and data is deployed to the node;
(3) cutting control is carried out according to current observation parameters on space scene tree, the data in invisible node is carried out Subtract reference count operation, the data in visible node are carried out plus reference count operates;
(4) start processed offline thread, the data in spatial scene tree count using multithreading and unloaded with adding Management is carried, data of the reference count in scene less than 0 are discharged, the data quoted in scene more than 0 are loaded.
Beneficial effect:Compared with prior art, method advantage disclosed by the invention is:1st, managed by spatial scene tree The static object data of magnanimity, there is higher recall precision;2nd, solve in plane scene to object height, bounding box processing The problem of difficult;3rd, it is whether visible to object count progress add-subtract control based on scenario node, while realized using multithreading The dynamic of target data adds unloading, and the EMS memory occupation amount of system is effectively reduced on the premise of actual use is not influenceed.
Brief description of the drawings
Fig. 1 is the workflow diagram of the present invention;
Fig. 2 is the spatial scene tree structure schematic diagram of the present invention;
Fig. 3 is that regarding for the present invention cuts body space nodes cutting schematic diagram.
Embodiment
Technical scheme is further described with reference to the accompanying drawings and examples.
As shown in figure 1, the magnanimity static object management method under the space coordinates of the present invention comprises the following steps that:
(1) longitude and latitude, bounding box processing are carried out to the static object of input, forms standard compliant static object data.
N number of static object point is sequentially input, and target point is standardized, major parameter includes longitude and latitude, height Degree, bounding box, visible level etc..Static object data structure expression after note standardization is PointStruct:
PointStructi={ Lng, Lat, Alt, BoxSize, MinLevel, MaxLevel, Ref }
Wherein, PointStructiI-th of target point is represented, Lng represents the longitude of the target, and Lat represents the target Latitude, Alt represent the height of the target, and BoxSize represents the bounding box size of the target, and MinLevel represents minimum visible layer Level, MaxLevel represent the visible level of highest, usually MinLvel >=0, and MaxLevel≤20, Ref represent that the target quotes meter Number, is initially 0.
(2) spatial scene tree is created, travels through magnanimity static object data list, according to position and bounding box by data in sky Between search in scene tree and specify node, add data in suitable node.Data are deployed to the section if node is present Point, otherwise create new node and data are deployed to the node.
First, it is divided into thing two spaces four directions body node from global range by the earth, obtains following two node regions:
The Eastern Hemisphere node:
SpacialNodeEast=Level=0, and 0 °≤Lng≤180 °, -90 °≤Lat≤90 °, NodeSize= WorldRadius}
The Western Hemisphere node:
SpacialNodeEast=Level=0, and -180 °≤Lng≤0 °, -90 °≤Lat≤90 °, NodeSize= WorldRadius}
Above-mentioned formula meaning representation is that the Eastern Hemisphere longitude range arrives 180 degree for 0 at the 0th layer, and latitude scope is -90 to 90 Degree, the Western Hemisphere longitude range are -180 to 0 degree, and latitude is spent to 90 degree for -90, and height of node is earth hemisphere WorldRadius, Typically it is taken as 6378137 meters.
With Level increase, space tetragonal body size of node is the 1/4 of last layer node, and node is still WorldRadius。
Then, i-th of target PointStruct in static data list is traveled throughi, according to its longitude and latitude scope and bounding box Determine which root node it should be deployed to.
Finally, search level number is equal to PointStruct downwards successivelyi.MaxLevel node, will if node is present PointStructiThe node is deployed to, otherwise creates the node.
Establishment process is expressed as:
(a) assume that the 0th layer of the Eastern Hemisphere space tetragonal body range of nodes is 0 °≤Lng≤180 °, -90 °≤Lat≤90 °, NodeSize=WorldRadius.
(b) then the Eastern Hemisphere in the 1st split layer into four spaces four directions body node Node1、Node2、Node3、Node4, it is empty Between region be respectively:
Node1=Level=1, and 0 °≤Lng≤90 °, 0 °≤Lat≤90 °, NodeSize=WorldRadius }
Node2=Level=1, and 90 °≤Lng≤180 °, 0 °≤Lat≤90 °, NodeSize=WorldRadius }
Node3=Level=1, and 0 °≤Lng≤90 °, -90 °≤Lat≤0 °, NodeSize=WorldRadius }
Node4=Level=1, and 90 °≤Lng≤180 °, -90 °≤Lat≤0 °, NodeSize=WorldRadius }
(c) by that analogy, each node continues to be split into 4 nodes in next layer, as shown in Fig. 2 and node size all For earth radius, by the fission process, an incomplete spatial scene tree is finally constructed.
(3) cutting control is carried out according to current observation parameters on space scene tree, the data in invisible node is carried out Subtract reference count operation, the data in visible node are carried out plus reference count operates;
The equal representation space coordinate of definition space data structure GVector3={ X, Y, Z }, X, Y, Z, unit is rice.
Definition space node NodeiBounding box be VexBoxi={ P1、P2、P3、P4、P5、P6、P7、P8, P1~P8It is The data of GVector3 types.
The data structure in definition space face is Plane={ a, b, c, d }, then the four of range of observation section body ViewFrustum It is made up of six faces that type is Plane:
ViewFrustum={ PFront, PBack, PLeft, PRight, PTop, PBottom};
Each point in VexBox is done whether regarding an internal judgement is cut, then and if only if meet following condition when, Pi Internal regarding cutting:
Pfront.a*Pi.x+Pfront.b*Pi.y+Pfront.c*Pi.z+Pfront.d≥0
Pback.a*Pi.x+Pback.b*Pi.y+Pback.c*Pi.z+Pback.d≥0
PLeft.a*Pi.x+PLeft.b*Pi.y+PLeft.c*Pi.z+PLeft.d≥0
PRight.a*Pi.x+PRight.b*Pi.y+PRight.c*Pi.z+PRight.d≥0
PTop.a*Pi.x+PTop.b*Pi.y+PTop.c*Pi.z+PTop.d≥0
PBottom.a*Pi.x+PBottom.b*Pi.y+PBottom.c*Pi.z+PBottom.d≥0
When have in VexBox a point regarding cut it is internal when, then it represents that the node is visible, owns to the intra-node administration Target data carries out plus an operation, otherwise carries out subtracting one operation to all target datas of intra-node administration, as shown in Figure 3.
(4) start processed offline thread, the data in spatial scene tree count using multithreading and unloaded with adding Management is carried, data of the reference count in scene less than 0 are discharged, the data quoted in scene more than 0 are loaded.

Claims (5)

1.一种空间坐标系下的海量静态目标管理方法,其特征在于:包括如下步骤:1. a massive static object management method under a space coordinate system, is characterized in that: comprise the steps: (1)对输入的静态目标点进行标准化处理,形成标准的静态目标数据;(1) Standardize the input static target points to form standard static target data; (2)创建空间场景树,遍历静态目标数据,将数据添加到合适的节点中,如节点存在则将数据部署到该节点,否则创建新节点并将数据部署到该节点;(2) Create a spatial scene tree, traverse the static target data, add the data to the appropriate node, if the node exists, deploy the data to the node, otherwise create a new node and deploy the data to the node; (3)根据当前观察参数对空间场景树进行裁剪控制,对不可见节点内的数据进行减引用计数操作,对可见节点内的数据进行加引用计数操作;(3) According to the current observation parameters, the spatial scene tree is clipped and controlled, and the reference counting operation is performed on the data in the invisible nodes, and the reference counting operation is performed on the data in the visible nodes; (4)启动离线处理线程,利用多线程技术对空间场景树内的数据进行计数与加卸载管理,对场景内引用计数小于0的数据进行释放,对场景内引用大于0的数据进行加载。(4) Start the offline processing thread, use multi-threading technology to count and load and unload the data in the spatial scene tree, release the data with a reference count less than 0 in the scene, and load the data with a reference count greater than 0 in the scene. 2.根据权利要求1所述的空间坐标系下的海量静态目标管理方法,其特征在于:所述步骤(1)中,标准的静态目标数据结构表达式为:2. the massive static target management method under the spatial coordinate system according to claim 1, is characterized in that: in described step (1), the static target data structure expression of standard is: PointStructi={Lng,Lat,Alt,BoxSize,MinLevel,MaxLevel,Ref}PointStruct i = {Lng, Lat, Alt, BoxSize, MinLevel, MaxLevel, Ref} 其中,PointStructi表示第i个目标点,Lng表示该目标的经度,Lat表示该目标的纬度,Alt表示该目标的高度,BoxSize表示该目标的包围盒大小,MinLevel表示最低可见层级,MaxLevel表示最高可见层级,Ref表示该目标引用计数。Among them, PointStruct i represents the i-th target point, Lng represents the longitude of the target, Lat represents the latitude of the target, Alt represents the height of the target, BoxSize represents the bounding box size of the target, MinLevel represents the lowest visible level, and MaxLevel represents the highest Visible level, Ref represents the target reference count. 3.根据权利要求2所述的空间坐标系下的海量静态目标管理方法,其特征在于:所述步骤(2)中,创建空间场景树包括步骤:3. the mass static object management method under the space coordinate system according to claim 2, is characterized in that: in described step (2), creating space scene tree comprises the step: (1)将地球分为东西两个空间四方体节点,得到如下两个节点区域:(1) Divide the earth into two spatial quadrilateral nodes in the east and west, and obtain the following two node areas: 东半球节点:Eastern Hemisphere Node: SpacialNodeEast={Level=0,0°≤Lng≤180°,-90°≤Lat≤90°,NodeSize=WorldRadius}SpacialNode East ={Level=0, 0°≤Lng≤180°, -90°≤Lat≤90°, NodeSize=WorldRadius} 西半球节点:Western Hemisphere Node: SpacialNodeEast={Level=0,-180°≤Lng≤0°,-90°≤Lat≤90°,NodeSize=WorldRadius};SpacialNode East = {Level=0, -180°≤Lng≤0°, -90°≤Lat≤90°, NodeSize=WorldRadius}; (2)东半球第1层分裂成四个空间四方体节点Node1、Node2、Node3、Node4,其空间区域分别为:(2) The first layer of the eastern hemisphere is split into four spatial quadrilateral nodes Node 1 , Node 2 , Node 3 , and Node 4 , and their spatial regions are respectively: Node1={Level=1,0°≤Lng≤90°,0°≤Lat≤90°,NodeSize=WorldRadius}Node 1 ={Level=1, 0°≤Lng≤90°, 0°≤Lat≤90°, NodeSize=WorldRadius} Node2={Level=1,90°≤Lng≤180°,0°≤Lat≤90°,NodeSize=WorldRadius}Node 2 ={Level=1, 90°≤Lng≤180°, 0°≤Lat≤90°, NodeSize=WorldRadius} Node3={Level=1,0°≤Lng≤90°,-90°≤Lat≤0°,NodeSize=WorldRadius}Node 3 ={Level=1, 0°≤Lng≤90°, -90°≤Lat≤0°, NodeSize=WorldRadius} Node4={Level=1,90°≤Lng≤180°,-90°≤Lat≤0°,NodeSize=WorldRadius};Node 4 ={Level=1, 90°≤Lng≤180°, -90°≤Lat≤0°, NodeSize=WorldRadius}; 西半球以此类推;Western Hemisphere and so on; (3)以此类推,每个节点在下一层继续分裂为4个节点,空间四方体节点的大小为上一层节点的1/4,经过该分裂过程,构建空间场景树。(3) By analogy, each node continues to be split into 4 nodes in the next layer, and the size of the spatial quadrilateral node is 1/4 of the node in the previous layer. After the splitting process, the spatial scene tree is constructed. 4.根据权利要求3所述的空间坐标系下的海量静态目标管理方法,其特征在于:所述步骤(2)中,遍历静态目标数据,根据经纬度范围和包围盒大小确定应该部署到的节点;搜索层号等于PointStructi.MaxLevel的节点,如果节点存在则将PointStructi部署到该节点,否则创建该节点。4. The massive static object management method under the spatial coordinate system according to claim 3, characterized in that: in the step (2), the static object data is traversed, and the node to be deployed is determined according to the range of latitude and longitude and the size of the bounding box ;Search for the node whose layer number is equal to PointStruct i .MaxLevel, if the node exists, deploy PointStruct i to the node, otherwise create the node. 5.根据权利要求4所述的空间坐标系下的海量静态目标管理方法,其特征在于:所述步骤(3)中空间场景树裁剪方法如下:5. the massive static object management method under the spatial coordinate system according to claim 4, is characterized in that: in the described step (3), the spatial scene tree clipping method is as follows: 定义空间数据结构GVector3={X、Y、Z},X、Y、Z均表示空间坐标;Define spatial data structure GVector3={X, Y, Z}, X, Y, Z all represent spatial coordinates; 定义空间节点Nodei的包围盒为VexBoxi={P1、P2、P3、P4、P5、P6、P7、P8},P1~P8为GVector3类型的数据;Define the bounding box of the spatial node Node i as VexBox i = {P 1 , P 2 , P 3 , P 4 , P 5 , P 6 , P 7 , P 8 }, and P 1 ~ P 8 are data of type GVector3; 定义空间面的数据结构为Plane={a,b,c,d},则观察范围的四截体ViewFrustum由类型为Plane的六个面构成:Define the data structure of the space plane as Plane={a,b,c,d}, then the tetrahedron ViewFrustum of the observation range is composed of six planes of type Plane: ViewFrustum={PFront,PBack,PLeft,PRight,PTop,PBottom};ViewFrustum={P Front , P Back , P Left , P Right , P Top , P Bottom }; 对VexBox中的每个点做是否在视截体内的判断,则当且仅当满足以下条件时,Pi在视截体内:Make a judgment on whether each point in the VexBox is in the view frustum, then P i is in the view frustum if and only if the following conditions are met: Pfront.a*Pi.x+Pfront.b*Pi.y+Pfront.c*Pi.z+Pfront.d≥0P front .a*P i .x+P front .b*P i .y+P front .c*P i .z+P front .d≥0 Pback.a*Pi.x+Pback.b*Pi.y+Pback.c*Pi.z+Pback.d≥0P back .a*P i .x+P back .b*P i .y+P back .c*P i .z+P back .d≥0 PLeft.a*Pi.x+PLeft.b*Pi.y+PLeft.c*Pi.z+PLeft.d≥0P Left .a*P i .x+P Left .b*P i .y+P Left .c*P i .z+P Left .d≥0 PRight.a*Pi.x+PRight.b*Pi.y+PRight.c*Pi.z+PRight.d≥0P Right .a*P i .x+P Right .b*P i .y+P Right .c*P i .z+P Right .d≥0 PTop.a*Pi.x+PTop.b*Pi.y+PTop.c*Pi.z+PTop.d≥0P Top .a*P i .x+P Top .b*P i .y+P Top .c*P i .z+P Top .d≥0 PBottom.a*Pi.x+PBottom.b*Pi.y+PBottom.c*Pi.z+PBottom.d≥0P Bottom .a*P i .x+P Bottom .b*P i .y+P Bottom .c*P i .z+P Bottom .d≥0 当VexBox中有一个点在视截体内时,则表示该节点可见,对该节点内部署的所有目标数据进行加一操作,否则对该节点内部署的所有目标数据进行减一操作。When there is a point in the VexBox within the viewport, it means that the node is visible, and an operation is performed on all target data deployed in the node, otherwise, a subtraction operation is performed on all target data deployed in the node.
CN201710895323.5A 2017-09-28 2017-09-28 A kind of magnanimity static object management method under space coordinates Pending CN107784079A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710895323.5A CN107784079A (en) 2017-09-28 2017-09-28 A kind of magnanimity static object management method under space coordinates

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710895323.5A CN107784079A (en) 2017-09-28 2017-09-28 A kind of magnanimity static object management method under space coordinates

Publications (1)

Publication Number Publication Date
CN107784079A true CN107784079A (en) 2018-03-09

Family

ID=61434178

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710895323.5A Pending CN107784079A (en) 2017-09-28 2017-09-28 A kind of magnanimity static object management method under space coordinates

Country Status (1)

Country Link
CN (1) CN107784079A (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6664975B1 (en) * 2000-05-23 2003-12-16 Microsoft Corporation Cheap well-behaved affine transformation of bounding spheres
CN101145245A (en) * 2007-10-17 2008-03-19 北京航空航天大学 A Scene Visibility Cropping Method Based on Non-Uniform Space Partitioning
CN101281654A (en) * 2008-05-20 2008-10-08 上海大学 A large-scale complex 3D scene processing method based on octree

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6664975B1 (en) * 2000-05-23 2003-12-16 Microsoft Corporation Cheap well-behaved affine transformation of bounding spheres
CN101145245A (en) * 2007-10-17 2008-03-19 北京航空航天大学 A Scene Visibility Cropping Method Based on Non-Uniform Space Partitioning
CN101281654A (en) * 2008-05-20 2008-10-08 上海大学 A large-scale complex 3D scene processing method based on octree

Similar Documents

Publication Publication Date Title
CN110990516B (en) Map data processing method, device and server
WO2020098531A1 (en) Object loading method, device, storage medium, and electronic device
JP6243045B2 (en) Graph data query method and apparatus
CN113190515A (en) Heterogeneous parallel computing-based urban mass point cloud coordinate transformation method
CN103377222B (en) Method and device for generating map tiles
US10217291B2 (en) Designing a modeled volume represented by dexels
CN103839222B (en) A kind of grid based on boundary topology search model by different level turns vector parallel system
CN110633282A (en) A method and tool for multi-level 3D meshing of airspace resources
CN103700060B (en) A kind of polygonal quick visualization method of magnanimity arbitrary shape
CN115526996A (en) Power transmission and transformation project geological distribution map drawing method and system based on multi-source data
Guo et al. An efficient tile-pyramids building method for fast visualization of massive geospatial raster datasets
CN114691691A (en) Geohash-based spatial data processing method and device and electronic equipment
CN104715036B (en) The computational methods of the faces GIS element geometrical information based on figure complexity
KR101487454B1 (en) method for parallel processing of LOD image
CN113449052A (en) Method for establishing spatial index, method and device for querying spatial region
CN103136782A (en) Three-dimensional model map dynamic rendering method and device
CN107784079A (en) A kind of magnanimity static object management method under space coordinates
CN112184900A (en) Method and device for determining elevation data and storage medium
CN114155332A (en) Rendering method and device of terrain tile data, electronic equipment and storage medium
CN104484404B (en) One kind improves geographical raster data document handling method in distributed file system
CN119075304A (en) Virtual scene rendering method, device, electronic device and storage medium
US9183435B2 (en) Feature generalization using topological model
WO2024250541A1 (en) Map segmentation method and apparatus, and electronic device and storage medium
CN117407727A (en) Vector similarity determining method and vector searching method
CN103679806A (en) Self-adaptive visual shell generation 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
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20180309