CN116340368B - Cache optimization method for BIM data visualization - Google Patents

Cache optimization method for BIM data visualization Download PDF

Info

Publication number
CN116340368B
CN116340368B CN202310623994.1A CN202310623994A CN116340368B CN 116340368 B CN116340368 B CN 116340368B CN 202310623994 A CN202310623994 A CN 202310623994A CN 116340368 B CN116340368 B CN 116340368B
Authority
CN
China
Prior art keywords
data
vector data
degree
cache
section
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.)
Active
Application number
CN202310623994.1A
Other languages
Chinese (zh)
Other versions
CN116340368A (en
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.)
Art1001 Network Technology Beijing Co ltd
Original Assignee
Art1001 Network Technology Beijing Co ltd
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 Art1001 Network Technology Beijing Co ltd filed Critical Art1001 Network Technology Beijing Co ltd
Priority to CN202310623994.1A priority Critical patent/CN116340368B/en
Publication of CN116340368A publication Critical patent/CN116340368A/en
Application granted granted Critical
Publication of CN116340368B publication Critical patent/CN116340368B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2455—Query execution
    • G06F16/24552—Database cache management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
    • G06F16/56—Information retrieval; Database structures therefor; File system structures therefor of still image data having vectorial format
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F30/00—Computer-aided design [CAD]
    • G06F30/10—Geometric CAD
    • G06F30/13—Architectural design, e.g. computer-aided architectural design [CAAD] related to design of buildings, bridges, landscapes, production plants or roads
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • Geometry (AREA)
  • General Engineering & Computer Science (AREA)
  • Computer Hardware Design (AREA)
  • Data Mining & Analysis (AREA)
  • Architecture (AREA)
  • Civil Engineering (AREA)
  • Computational Linguistics (AREA)
  • Structural Engineering (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Mathematical Optimization (AREA)
  • Pure & Applied Mathematics (AREA)
  • Evolutionary Computation (AREA)
  • Image Generation (AREA)

Abstract

The invention relates to the field of data processing, in particular to a cache optimization method for BIM data visualization, which comprises the following steps: collecting vector data, obtaining the vector data repetition degree of every two section positions according to the types and time intervals of the vector data of the section positions and the number of times the vector data is displayed at the section positions, merging adjacent section positions according to the vector data repetition degree of every two section positions, obtaining the cache consistency degree of the current vector data according to the sum of the display times of all section positions in the cache label, the time intervals of all adjacent two displays in the cache label and the vector data types contained in the cache label, and classifying and caching according to the cache consistency degree of the current vector data. The invention obtains the cache consistency degree of the vector data by using a data processing technology, so that the vector data is better classified and cached, and the visualization of the vector data at the section position is improved.

Description

Cache optimization method for BIM data visualization
Technical Field
The invention relates to the field of data processing, in particular to a cache optimization method for BIM data visualization.
Background
BIM is a building information model, is a new tool for architecture, engineering and civil engineering, and mainly takes a three-dimensional design graph with building properties. The BIM data has a visual effect related to the data, namely the visual function of the data, such as visual display of the profile information can be performed by drawing hatching in the presented planar image, wherein the visual display process relates to reading of the BIM data, and in order to improve the visual reading speed, buffer optimization is required for the BIM data.
The cache of the BIM data mainly aims at the contained vector data and attribute data, the attribute data corresponds to the vector data, and the cache is generally used for respectively caching the vector data and the attribute data mainly according to the corresponding relation between the vector data and the attribute data. However, in the visual display of the section graphic information, the corresponding vector data and the corresponding attribute data need to be read, at this time, the corresponding partial vector data needs to be read from all the vector data, and then the partial reading is continued in all the attribute data through the corresponding relationship between the vector data and the attribute data. At this time, the overall buffer memory of the vector data and the attribute data directly results in lower reading rate of the profile data, thereby being unfavorable for the visual display rate of the profile.
Disclosure of Invention
The invention provides a cache optimization method for BIM data visualization, which aims to solve the existing problems.
The invention discloses a cache optimization method for BIM data visualization, which adopts the following technical scheme:
an embodiment of the present invention provides a cache optimization method for BIM data visualization, including the steps of:
BIM graphic data are collected, and vector data and attribute data for section position display are obtained;
obtaining the influence degree of repeated display of a single section position according to the variety number of vector data of the section position and the time interval of adjacent two displays of the section position in the historical data, and marking the influence degree as a first degree;
the non-repeated vector data in any two section positions are recorded as non-repeated vector data, and the influence degree of the non-repeated data in any two section positions on the data repetition is recorded as a second degree according to the number of the non-repeated vector data, the number of other section positions through which all the non-repeated vector data pass and the display times of each section position;
obtaining the vector data repetition degree of any two section positions according to the number of non-repeated vector data types corresponding to any two section positions, the adjacent display time interval in any two section positions, the first degree and the second degree, and marking the vector data repetition degree as a third degree;
combining the section positions according to the third degree and a preset threshold value to obtain a cache tag;
obtaining the cache consistency degree of the current vector data in any one cache tag according to the sum of the showing times of the current vector data in all section positions in any one cache tag, the average value of the time intervals of all adjacent showing times in any one cache tag and the vector data types contained in any one cache tag, and marking the cache consistency degree as a fourth degree;
classifying the cache tags of the current vector data according to the fourth degree;
and classifying and storing according to the cache tag types of all the vector data, so that the visualization of the profile data is facilitated.
Further, the specific obtaining method of the first degree is as follows:
the formula for the first degree is:
wherein the method comprises the steps ofShow the extent of influence of repeated presentation of the ith cross-sectional position,/->Represents the number of types of the repetition vector data in the ith section position and the jth section position, K represents the total number of all section positions,/or->Number of data types of i-th section position vector of the mark,/->Representing the ith section bitThe vector data time interval of two adjacent displays in the history data is set at +.>Showing the number of times the history data of the i-th section position is displayed.
Further, the specific obtaining method of the second degree is as follows:
the formula for the second degree is:
wherein representsInfluence of non-repeated data in the ith and jth profile positions on the data repetition, +.>Representing the number of vector data not repeated in the ith section position and the jth section position, of>Representing no duplication +.>The number of other section positions through which the u-th non-repeating vector data of the individual vector data passes,/->Representing no duplication +.>The number of times the ith non-repeating data in the individual vector data is presented at the passing ith cross-sectional position.
Further, the specific obtaining method of the third degree is as follows:
wherein the method comprises the steps ofRepresenting the degree of repetition of vector data between the ith and jth profile positions, +.>Represents the number of non-repetition of vector data types corresponding to the ith section position and the jth section position,/->Representing the time interval between all i-th and j-th profile positions in the history and the adjacent presentation in the j-th profile position,/for each of the i-th and j-th profile positions>And->Showing the number of times of presentation of the ith section position and the jth section position, respectively, +.>Show the extent of influence of repeated presentation of the ith cross-sectional position,/->Representing the extent of influence of repeated presentation of the jth cross-sectional position,/->I.e. the extent to which non-duplicate data in two profile positions affects the duplication of data.
Further, the specific acquisition method for combining the section positions is as follows:
and combining the section positions with the data repetition degree larger than the threshold according to the third degree and a preset threshold to obtain the combined section.
Further, the specific obtaining method of the fourth degree is as follows:
obtaining the cache consistency degree, namely the fourth degree, of the current vector data in any one cache label according to the sum of the display times of the current vector data in all section positions in any one cache label, the average value of time intervals of all adjacent two displays in any one cache label and the product of the types of the vector data contained in any one cache label.
Further, the specific method for obtaining the classification of the cache tag comprises the following steps:
and determining the cache consistency degree according to the vector data and all corresponding cache labels, and selecting the cache label with the highest cache label consistency as the final cache label of the current vector data.
The technical scheme of the invention has the beneficial effects that:
(1) Classifying the vector data and enabling each type of vector data to have the greatest possibility of being extracted simultaneously, thereby facilitating the rapid reading of the vector data required for the section visualization, i.e. effectively improving the speed of the section visualization
(2) And merging the adjacent section data, and considering the similar display requirements of the same vector data in the adjacent section positions, so that the influence of deviation of the same display requirement corresponding to the drawn section line in actual display on the relation between the vector data and the section position in the historical data is avoided, the corresponding relation between the section position and the actual vector data is improved, the number of the section positions is reduced, and the cache relation between the vector data and the section position is conveniently and rapidly obtained.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of the steps of a method for cache optimization for BIM data visualization according to the present invention.
Detailed Description
In order to further describe the technical means and effects adopted by the present invention to achieve the preset purpose, the following description refers to the specific implementation, structure, characteristics and effects of a cache optimization method for BIM data visualization according to the present invention in detail with reference to the accompanying drawings and preferred embodiments. In the following description, different "one embodiment" or "another embodiment" means that the embodiments are not necessarily the same. Furthermore, the particular features, structures, or characteristics of one or more embodiments may be combined in any suitable manner.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following specifically describes a specific scheme of a cache optimization method for BIM data visualization provided by the invention with reference to the accompanying drawings.
Referring to fig. 1, a flowchart illustrating a buffer optimization method for BIM data visualization according to an embodiment of the present invention is shown, and the method includes the following steps.
S001: raw data is acquired.
When building design software performs BIM design, BIM data of a designed BIM graph is obtained, wherein the BIM data comprises a plurality of vector data in the BIM graph and attribute data corresponding to each vector data.
It should be noted that the attribute data is a description of vector data, that is, one kind of vector data corresponds to one kind of attribute data at this time.
And a designer can transmit BIM data corresponding to the profile position to an application system by setting the profile position according to actual requirements, and then the profile display is carried out.
Thus, for each BIM graphic, there is a large amount of data at the time of section presentation, including a section position, a time, a number of vector data at section position presentation at each section presentation, and corresponding attribute data.
In this embodiment, the data of the section display in one week is analyzed as the history data.
S002: obtaining the vector data repetition degree of every two section positions according to the types and time intervals of the vector data of the section positions and the number of times the vector data is displayed in the section positions, merging the adjacent section positions according to the vector data repetition degree of every two section positions, and obtaining the cache consistency degree of the current vector data according to the sum of the display times of all section positions in the cache label, the time intervals of all adjacent two displays in the cache label and the vector data types contained in the cache label.
It should be noted that, when the BIM data is cached, in order to facilitate visual extraction of the BIM profile data, the BIM data is classified and cached, at this time, the more the result of data classification is affected by the profile positions displayed in the historical data, the more the number of times of displaying the same profile position, the more the vector data corresponding to the profile positions is likely to be cached in the same type, and when a single vector data is displayed in a plurality of profile positions, that is, the single vector data may correspond to a plurality of profile positions, and the more the number of times of displaying the profile positions in the corresponding different profile positions, the higher the cache consistency when the data is cached. Therefore, the invention performs section position combination through the repeated relation of the vector data between the section positions, and determines the cache label of the vector data by utilizing the relation between the vector data and the section positions, thereby classifying and caching the vector data by utilizing the cache label.
It should be further noted that, the section display in the BIM data mainly draws section lines in the two-dimensional graph according to requirements, and reads vector data corresponding to the section lines according to the position relationship between the section lines and the BIM graph, so as to perform visual display. The BIM data generally mainly comprises vector data and attribute data corresponding to different vector data, so that when an actual section is displayed, the section position is determined according to a section line, then the vector data passing through the section position is read from a cached database, and the attribute data corresponding to the vector data is obtained according to the read vector data, and finally visual display is carried out.
It should be noted that the attribute data is a description of vector data, that is, one kind of vector data corresponds to one kind of attribute data at this time.
The data reading involved in the above process is always searched and read in a larger database, so the reading speed is low, and the visual display speed of the profile data is affected. At this time, the original BIM data can be classified and cached according to the profile requirement, so that the visualization rate of the profile data is improved.
The specific process is as follows: when a cache tag of vector data is obtained, a section position is selected as the cache tag of the current vector data according to section visualization requirements of different section positions, then classified cache of the vector data is carried out according to the relation between the cache tag and the related section position requirements, and meanwhile, the corresponding attribute data and the vector data are cached in the same classification.
When the BIM data caching method is used, the basis of classifying and caching the vector data is the section visualization requirement, the vector data with more consistent section position requirements is more likely to be cached in the same type, a plurality of vector data corresponding to the same section position can be cached as the same type of data, the subsequent section data reading is convenient, the higher the requirement of visualizing the current section position is, and the greater the possibility that the vector data corresponding to the current section position is cached as the same type of data is.
In the application process of the actual BIM data, the visual display of the multi-time profile graphic data at different positions is involved, the position for storing each visual display of the profile is recorded and stored in the system, namely the historical data with the multi-time profile visual display at the different positions of the BIM data is recorded, the actual application requirement is caused to cause the same position to pass through the multi-time profile display, at the moment, the times of the profile display at the different positions in the historical data reflect the profile requirement of the current position, and the more the times are, the higher the profile requirement is.
In the actual visual display of the profile of the BIM data, the different profile positions may generate the profile visual requirement, and at this time, the different profile requirement positions may overlap, so the same vector data exists in the different profile requirement positions, that is, the different profile positions may correspond to the same vector data, so that the corresponding relationship between the vector data and the profile requirement is not unique, and the current vector data cannot be classified in the process of classifying and caching the vector data, that is, the cache label of the vector data cannot be obtained.
The more the number of section display times of the same section position in the known historical data is, the higher the section display requirement of the current section position is, so that the possibility that the passing vector data of the current section position is simultaneously read is higher, and similarly, the more the number of times that a certain section position in a plurality of section positions corresponding to one vector data is displayed is, the higher the cache consistency of the current vector data and the section position is, so that the possibility that the section position is used as a cache tag of the current vector data to be cached is higher. At the moment, the vector data at the same section position are the same type of data, and the vector data are cached at the same time, so that the corresponding vector data can be quickly read when the section is displayed.
(1) And obtaining the repetition degree of the vector data of each two section positions according to the types and time intervals of the vector data of the section positions and the number of times the vector data is displayed in the section positions.
In the actual section display, each section display has its target requirement, that is, each section display has its target vector data, and the vector data displayed by the sections at adjacent positions are repeated, so that the adjacent section positions may have the same target vector data, and if the degree of the repetition of the vector data is high enough, the vector data corresponding to the two positions can be merged and cached.
Specifically, through the above analysis, vector data is merged and cached according to the degree of repetition of vector data at adjacent cross-sectional positions, and at this time, for vector data (cross-sectional position a, vector data, a, b, c) corresponding to one cross-sectional position, part of vector data (a, b) thereof is repeated with vector data at adjacent cross-sectional positions, and the remaining vector data (c) is present at other cross-sectional positions, and at this time, for vector data present at other cross-sectional positions, the cache relationship thereof has an influence on vector data at the current cross-sectional position and vector data present at other cross-sectional positions, respectively. The specific influence relation is as follows: the higher the degree of repetition of the vector data c with other profile position vector data is, the less the probability that the vector data c coincides with the vector data a, b is cached; the higher the degree of repetition of the vector data a, b with the vector data of the adjacent section position, the less likely the vector data c matches the vector data a, b in cache. The degree of repetition of the vector data c and the vector data of other section positions is expressed as the number of section positions where the vector data c exists and the number of times of displaying each section position, the more the number of section positions where the vector data c exists, the smaller the degree of repetition of the vector data c to the vector data of other section positions is, thereby reflecting that the higher the consistency of the vector data c and the corresponding section positions is, the higher the degree of repetition of the corresponding vector data is, and the fewer the number of times of displaying the other section positions where the vector data c exists is, the higher the degree of repetition of the corresponding vector data is. And accordingly, the repetition degree of the vector data corresponding to the different section positions is reflected, and the vector data of the different section positions are combined and cached according to the repetition degree.
Also in historical data there may be successive multiple presentations of one profile location, so adjacent sub-profile presentations effectively reflect similar presentation requirements. At this time, for different section positions where the vector data exists, the more continuous the section positions show, the higher the consistency of the vector data and the corresponding section positions, meanwhile, in the analysis of the repetition degree of the vector data of the adjacent section positions, the smaller the time interval shown by the adjacent section positions, the higher the repetition degree of the vector data of the two section positions, the smaller the interval between the adjacent section positions, the higher the repetition degree of the vector data of the two section positions, the higher the repetition degree of the vector data, and the higher the possibility of merging and buffering.
Specifically, according to the above analysis, the degree of repetition of vector data for two section positionsSpecifically expressed as follows:
wherein the method comprises the steps ofRepresenting the degree of repetition of vector data between the ith and jth profile positions, +.>The number of non-duplicate vector data types corresponding to the ith and jth cross-sectional positions is represented, and the greater the value, the smaller the degree of duplication of vector data for both cross-sectional positions is,/>Representing the time interval between all i-th and j-th profile positions in the history and the adjacent presentation in the j-th profile position,/for each of the i-th and j-th profile positions>，/>Showing the number of times of showing the ith section position and the jth section position respectively,representation->The smaller the value of the mean value of the time intervals, the smaller the relative time interval between the two section positions is displayed, the more continuous the two section positions are displayed, namely the greater the data coincidence degree is, the +.>Show the extent of influence of repeated presentation of the ith cross-sectional position,/->Representing the extent of influence of repeated presentation of the jth cross-sectional position,/->I.e. the extent to which non-duplicate data in two profile positions affects the duplication of data.
The vector data types are identical vector data and are the same type.
In particular, wherein the repetition of a single profile position reveals the extent of influenceThe method comprises the following steps:
wherein->Show the extent of influence of repeated presentation of the ith cross-sectional position,/->Represents the number of kinds of the repetition vector data in the i-th section position and the j-th section position,represents the average number of types of repeated vector data in the ith section position and all other section positions, K represents the total number of all section positions, +.>The number of data types of the i-th cross-sectional position vector of the marker,representing the number of relative repeated data of the ith section position and the jth section position, +.>The effect of the ith section position and the jth section position on repeated data in multiple display is shown, the greater the value of the effect is, the greater the repeated degree of repeated data in multiple display reaction is, and the +.>The time interval of vector data representing the two adjacent displays of the ith section position in the historical data is smaller, the two displays are more continuous, the degree of data repetition reflected by the two displays is larger, and the +.>Indicating the i-th cross-sectional position correspondence +.>The greater the value of the continuous display degree reflected by the display interval, the greater the degree of repetition of the reflection data, +.>Showing the number of times the history data of the i-th section position is displayed.
Influence of non-repeated data in two profile positions related to the above formula on the degree of data repetitionThe method mainly shows the data repetition degree of unrepeated data relative to other section positions, and at the moment, the data repetition degree of unrepeated data and other section positions is directly based on the relative relation of the repeated data of the section positions relative to the data of the position of the data, and the display times corresponding to other positions are specifically shown as follows:
specifically, the degree of influence of non-repeated data in two profile positions on the data repetitionThe formula of (2) is:
wherein the method comprises the steps ofIndicating the extent of influence of non-repeated data in the ith and jth profile positions on the repetition of data, +.>Representing the number of vector data not repeated in the ith section position and the jth section position, of>Representing no duplication +.>The number of other section positions through which the u-th non-repeating vector data of the individual vector data passes,/->Representing no duplication +.>The number of times the ith non-repeating data in the individual vector data is presented at the past ith cross-sectional position,indicating the effect of the ith and jth non-repeating data and other cross-sectional positions traversed on the degree of repetition of the ith and jth cross-sectional position data, +.>I.e. representing +.in two section positions>The degree of influence of non-duplicate vector data on its data duplication.
(2) And merging the adjacent section positions according to the repetition degree of the vector data of every two section positions.
It should be noted that, consider the display requirement that the same vector data reflects in adjacent section positions, namely the display requirement of the same vector data in adjacent positions in the actual display process, so as to avoid the influence of the deviation of the same display requirement corresponding to the drawn section line in the actual display on the relation between the vector data and the section position in the historical data, thereby improving the corresponding relation between the section position and the actual vector data, reducing the number of section positions, and being convenient for quickly obtaining the cache relation between the vector data and the section position.
It should be further noted that, according to the above steps, the degree of repetition of the data corresponding to the two profile positions is determined, and the greater the value, the greater the likelihood that the two profile positions are merged and cached. At this time, the merging and buffering judgment is firstly carried out at different section positions.
Specifically, among all the section positions in the history data, the vector data repetition degree of 3 (empirical value) section positions, which are closest to each section position, is obtained, and then the repetition degree of all the obtained vector data is normalized (by using the existing maximum-minimum normalization method), and the section positions, of which the data repetition degree is greater than the merge threshold, are merged by setting a preset merge threshold. Specifically, when the degree of repetition of the vector data between one section position and a plurality of adjacent section positions is greater than a combination threshold, the section position with the greatest degree of repetition of the vector data is selected for combination, and in this embodiment, the combination threshold is set to 0.7, and the threshold is an empirical threshold, so that an implementer can set the combination according to different real-time situations.
For the current BIM data classification cache, firstly, the type of the data needs to be judged, the basis of the known data cache is section display, namely, all vector data are classified and cached based on the obtained section, at the moment, firstly, the section position is judged as the possibility of a cache label, and the basis is the section display times. All sections are first arranged in order from bottom to top at this point of presentation, and then the first 60% of sections are selected as the final BIM data cache tag. That is, the final data cache type is determined, and then data of each type is determined, so that data classification cache is realized.
According to the steps, the cache label in the current BIM data is determined, and at the moment, the final cache label is determined according to the corresponding relation between the vector data and the cache label. And the corresponding relation between the vector data and the cache tag is based on the relation between the showing times of the vector data in different cache tag positions.
(3) And obtaining the cache consistency degree of the current vector data according to the sum of the showing times of all section positions in the cache label, the time interval of all adjacent two showing times in the cache label and the vector data category number contained in the cache label.
At this time, factors affecting the consistency relationship between the vector data and the corresponding plurality of cache tags are mainly the number of times of displaying the historical data and the actual requirement of displaying the corresponding cache tags for a plurality of times relative to the current vector data, wherein the actual requirement is displayed for a plurality of times at a time interval and the data type relative relationship contained in the display.
Specifically, if any one vector data is recorded as the current vector data, the cache consistency degree between the current vector data and all cache tags is achievedThe concrete steps are as follows: />
Wherein the method comprises the steps ofRepresenting the degree of cache coherence between the current vector data and all cache tags, < >>The larger the sum of the showing times of all section positions of the current vector data in the passing h cache tag is, the higher the consistency of the current vector data and the h cache tag is, so that the higher the possibility that the current data cache tag is the h cache tag is>Representing the mean value of all adjacent two displayed time intervals in the h cache tag, the smaller the value thereof,/is>The greater the likelihood that the sub-presentation reflects that the current data meets the actual presentation requirements, the +.>The smaller the value of the vector data category number contained in the h cache tag is, the higher the relative requirement of the h cache tag degree on the current vector data is, and the greater the possibility that the current data cache tag is the h cache tag is.
According to the method, the cache consistency of one vector data and all corresponding cache labels is calculated, and the cache label with the highest cache consistency is selected as the final cache label of the current vector data. And determining the final cache tags of all vector data in the same way.
In particular, there may be vector data in the BIM data that is not present in the history profile presentation, where its cache tag is its closest cache tag.
S003: and data classification cache.
Obtaining the cache tag from the BIM data according to the steps, determining the cache tag of all vector data contained in the BIM data, classifying all vector data according to the cache tag at the moment, namely, the vector data of the same cache tag are the same cache type data, and finally classifying and storing according to the cache type of all vector data, so that the visualization of the profile data is facilitated.
The foregoing description of the preferred embodiments of the invention is not intended to be limiting, but rather is intended to cover all modifications, equivalents, alternatives, and improvements that fall within the spirit and scope of the invention.

Claims (7)

1. A cache optimization method for BIM data visualization, the method comprising the steps of:
BIM graphic data are collected, and vector data and attribute data for section position display are obtained;
obtaining the influence degree of repeated display of a single section position according to the variety number of vector data of the section position and the time interval of adjacent two displays of the section position in the historical data, and marking the influence degree as a first degree;
the non-repeated vector data in any two section positions are recorded as non-repeated vector data, and the influence degree of the non-repeated data in any two section positions on the data repetition is recorded as a second degree according to the number of the non-repeated vector data, the number of other section positions through which all the non-repeated vector data pass and the display times of each section position;
obtaining the vector data repetition degree of any two section positions according to the number of non-repeated vector data types corresponding to any two section positions, the adjacent display time interval in any two section positions, the first degree and the second degree, and marking the vector data repetition degree as a third degree;
combining the section positions according to the third degree and a preset threshold value to obtain a cache tag;
obtaining the cache consistency degree of the current vector data in any one cache tag according to the sum of the showing times of the current vector data in all section positions in any one cache tag, the average value of the time intervals of all adjacent showing times in any one cache tag and the vector data types contained in any one cache tag, and marking the cache consistency degree as a fourth degree;
classifying the cache tags of the current vector data according to the fourth degree;
and classifying and storing according to the cache tag types of all the vector data, so that the visualization of the profile data is facilitated.
2. The cache optimization method for BIM data visualization according to claim 1, wherein the specific obtaining method of the first degree is:
the formula for the first degree is:wherein->Show the extent of influence of repeated presentation of the ith cross-sectional position,/->Represents the number of types of the repetition vector data in the ith section position and the jth section position, K represents the total number of all section positions,/or->The number of data types representing the i-th profile position vector of the mark,vector data time interval representing two adjacent displays of the ith section position in the history data,/->Showing the number of times the history data of the i-th section position is displayed.
3. The cache optimization method for BIM data visualization according to claim 1, wherein the specific obtaining method of the second degree is:
the formula for the second degree is:wherein->Indicating the extent of influence of non-repeated data in the ith and jth profile positions on the repetition of data, +.>Representing the number of vector data not repeated in the ith section position and the jth section position, of>Representing no duplication +.>The number of other section positions through which the u-th non-repeating vector data of the individual vector data passes,/->Representing no duplication +.>The number of times the ith non-repeating data in the individual vector data is presented at the passing ith cross-sectional position.
4. The cache optimization method for BIM data visualization according to claim 1, wherein the specific obtaining method of the third degree is:
the formula for the third degree is:
wherein the method comprises the steps ofRepresenting the degree of repetition of vector data between the ith and jth profile positions, +.>Represents the number of non-repetition of vector data types corresponding to the ith section position and the jth section position,/->Representing the time interval between all i-th and j-th profile positions in the history and the adjacent presentation in the j-th profile position,/for each of the i-th and j-th profile positions>And->Showing the number of times of presentation of the ith section position and the jth section position, respectively, +.>Show the extent of influence of repeated presentation of the ith cross-sectional position,/->Representing the extent of influence of repeated presentation of the jth cross-sectional position,/->I.e. the extent to which non-duplicate data in two profile positions affects the duplication of data.
5. The cache optimization method for BIM data visualization according to claim 1, wherein the specific obtaining method for merging the profile positions is as follows:
and combining the section positions with the data repetition degree larger than the threshold according to the third degree and a preset threshold to obtain the combined section.
6. The cache optimization method for BIM data visualization according to claim 1, wherein the specific obtaining method of the fourth degree is:
obtaining the cache consistency degree, namely the fourth degree, of the current vector data in any one cache label according to the sum of the display times of the current vector data in all section positions in any one cache label, the average value of time intervals of all adjacent two displays in any one cache label and the product of the types of the vector data contained in any one cache label.
7. The cache optimization method for BIM data visualization according to claim 1, wherein the specific obtaining method of the classification of the cache tag is:
and determining the cache consistency degree according to the vector data and all corresponding cache labels, and selecting the cache label with the highest cache label consistency as the final cache label of the current vector data.
CN202310623994.1A 2023-05-30 2023-05-30 Cache optimization method for BIM data visualization Active CN116340368B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310623994.1A CN116340368B (en) 2023-05-30 2023-05-30 Cache optimization method for BIM data visualization

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310623994.1A CN116340368B (en) 2023-05-30 2023-05-30 Cache optimization method for BIM data visualization

Publications (2)

Publication Number Publication Date
CN116340368A CN116340368A (en) 2023-06-27
CN116340368B true CN116340368B (en) 2023-07-21

Family

ID=86876332

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310623994.1A Active CN116340368B (en) 2023-05-30 2023-05-30 Cache optimization method for BIM data visualization

Country Status (1)

Country Link
CN (1) CN116340368B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111354084A (en) * 2020-02-26 2020-06-30 中国电建集团昆明勘测设计研究院有限公司 Network geographic information service system based on three-dimensional model tiles
CN114972664A (en) * 2022-04-21 2022-08-30 武汉市测绘研究院 Integrated management method for urban full-space three-dimensional model data
CN115661327A (en) * 2022-12-09 2023-01-31 北京盈建科软件股份有限公司 Distributed virtual node rendering method and device of BIM (building information modeling) platform graphic engine

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106202536B (en) * 2016-07-26 2019-09-24 四川长虹电器股份有限公司 Global metadata standardized platform system and its construction method based on XBRL
EP3321817A1 (en) * 2016-11-14 2018-05-16 Dassault Systèmes Querying a database based on a parametric view function
US20220035962A1 (en) * 2021-10-14 2022-02-03 Shenzhen Xkool Technology Co., Ltd. Building design method, device, system and storage medium

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111354084A (en) * 2020-02-26 2020-06-30 中国电建集团昆明勘测设计研究院有限公司 Network geographic information service system based on three-dimensional model tiles
CN114972664A (en) * 2022-04-21 2022-08-30 武汉市测绘研究院 Integrated management method for urban full-space three-dimensional model data
CN115661327A (en) * 2022-12-09 2023-01-31 北京盈建科软件股份有限公司 Distributed virtual node rendering method and device of BIM (building information modeling) platform graphic engine

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
BIM模型信息分类编码分析;秦艳萍 等;《工程技术研究》;第8卷(第132期);第15-17、29页 *
Geometric optimization of building information models in MEP projects: Algorithms and techniques for improving storage, transmission and display;Zhenzhong Hu 等;《Automation in Construction》;第107卷;第1-16页 *
Research on Engineering Project Management Method Based on BIM Technology;Xingliang Du 等;《Scientific Programming》;第2021卷;第1-10页 *
一种基于材质合并的BIM模型轻量化算法;吴菁钏 等;《浙江测绘》(第1期);第1-6页 *
基于BIM技术的桥梁参数化建模及轻量化研究;佘宇深;《中国优秀硕士学位论文全文数据库 工程科技Ⅱ辑(月刊)》(第3期);第C034-655页 *

Also Published As

Publication number Publication date
CN116340368A (en) 2023-06-27

Similar Documents

Publication Publication Date Title
CN112651969B (en) Trachea tree hierarchical extraction method combining multi-information fusion network and regional growth
CN112991269A (en) Identification and classification method for lung CT image
US20180192245A1 (en) Extraction and Representation method of State Vector of Sensing Data of Internet of Things
CN111667897A (en) Structured report system of image diagnosis result
WO2019013998A1 (en) Self-feeding deep learning method and system
CN116340368B (en) Cache optimization method for BIM data visualization
CN116309459A (en) Improved network-based lung nodule detection method, apparatus, device and storage medium
CN109508714B (en) Low-cost multi-channel real-time digital instrument panel visual identification method and system
WO2021159778A1 (en) Image processing method and apparatus, smart microscope, readable storage medium and device
CN110930386A (en) Image processing method, device, equipment and storage medium
CN112541621B (en) Movement prediction method, intelligent terminal and storage medium
CN117668583A (en) Investment optimization method based on artificial intelligent investment research
CN111611935B (en) Automatic identification method for similar vector diagrams in CAD drawing
CN117593420A (en) Plane drawing labeling method, device, medium and equipment based on image processing
Li et al. Automatic pavement crack detection based on single stage salient-instance segmentation and concatenated feature pyramid network
JPH0215910B2 (en)
CN113256581B (en) Automatic defect sample labeling method and system based on visual attention modeling fusion
Chen et al. Adaptive multi-resolution labeling in virtual landscapes
CN114840792A (en) Web end epidemic situation distribution visualization system and method based on gridding processing
CN113392927A (en) Animal target detection method based on single-order deep neural network
Almanie Quantitative Study of Traffic Accident Prediction Models: A Case Study of Virginia Accidents
CN117457235B (en) Pathological damage mode prediction method and device, storage medium and electronic equipment
CN115115887B (en) Crop pest detection method based on TSD-Faster RCNN and network thereof
CN117496512B (en) Multi-type cell nucleus labeling and multitasking method for cervical TCT slice
US20230016464A1 (en) System and methods for visualizing variations in labeled image sequences for development of machine learning models

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant