CN102034268A - Method for constructing and storing three-dimensional virtual plant based on dynamic substructure - Google Patents
Method for constructing and storing three-dimensional virtual plant based on dynamic substructure Download PDFInfo
- Publication number
- CN102034268A CN102034268A CN 201010603180 CN201010603180A CN102034268A CN 102034268 A CN102034268 A CN 102034268A CN 201010603180 CN201010603180 CN 201010603180 CN 201010603180 A CN201010603180 A CN 201010603180A CN 102034268 A CN102034268 A CN 102034268A
- Authority
- CN
- China
- Prior art keywords
- minor structure
- plant
- substructure
- minor
- dynamic
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 230000012010 growth Effects 0.000 claims description 19
- 238000004088 simulation Methods 0.000 claims description 16
- 230000008569 process Effects 0.000 claims description 12
- 230000009466 transformation Effects 0.000 claims description 9
- 230000002452 interceptive effect Effects 0.000 claims description 6
- 239000011159 matrix material Substances 0.000 claims description 5
- 230000008635 plant growth Effects 0.000 claims description 4
- 230000006835 compression Effects 0.000 claims description 3
- 238000007906 compression Methods 0.000 claims description 3
- 238000010276 construction Methods 0.000 claims description 3
- 241000196324 Embryophyta Species 0.000 description 72
- 210000000056 organ Anatomy 0.000 description 44
- 238000004422 calculation algorithm Methods 0.000 description 16
- 230000008859 change Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 238000006243 chemical reaction Methods 0.000 description 3
- 238000013461 design Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 239000004615 ingredient Substances 0.000 description 2
- 230000032696 parturition Effects 0.000 description 2
- 238000000547 structure data Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 235000008331 Pinus X rigitaeda Nutrition 0.000 description 1
- 235000011613 Pinus brutia Nutrition 0.000 description 1
- 241000018646 Pinus brutia Species 0.000 description 1
- 241000124033 Salix Species 0.000 description 1
- 230000009471 action Effects 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 230000035800 maturation Effects 0.000 description 1
- 238000012821 model calculation Methods 0.000 description 1
- 238000000465 moulding Methods 0.000 description 1
- 239000000082 organ preservation Substances 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 238000013138 pruning Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
- 238000013519 translation Methods 0.000 description 1
- 230000000007 visual effect Effects 0.000 description 1
Images
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a method for constructing and storing a three-dimensional virtual plant based on a dynamic substructure. The method comprises the following steps of: initializing parameters of the substructure; constructing a plant structure by a dynamic substructure method; storing data by the substructure method; and interactively editing the plant structure by using substructure information. The method is characterized in that: similar substructures in the plant structure define a substructure library; and time and space are saved by repeatedly calling information in the substructure library. A sample in the substructure library can be dynamically generated as required, so that the generated substructures are prevented from never being called. Compact storage of virtual plant data is realized by only saving one backup for the repeatedly called substructure. The constructed plant and the plant substructure are interactively edited according to calling information of the substructure.
Description
Technical field
The invention belongs to technical fields such as virtual reality, digital agriculture and forestry, digital entertainment, landscape design, particularly relate to the formative method and the Dynamic Display of virtual plant structure.
Background technology
Along with the development of dimension display technologies, the demand of displaying contents under the digital environment is increased sharply.Plant is that digital scene makes up requisite part as the important ingredient of nature to its moulding and animation.Structure realizes that the main method of virtual plant three-dimensional structure can be divided into two classes haply.One class is the manual interaction mode, promptly by using the structure of Specialty Design software definition virtual plant.Simple plant structure or plant organ can carry out manual modeling by alternant way, but for the plant structure of complexity, wherein may comprise hundreds and thousands of ten thousand organs, and the mode of modeling is infeasible fully by hand.Another kind of modeling pattern is based on the simulation of algorithm, generates plant structure automatically.Common modeling algorithm has character string to replace system, particIe system, automat etc.
When utilizing the algorithm simulation plant structure, common characteristic is to define the growth rule, describes the branch classification of different terminal buds or lateral bud generation even organ classification and the number that comprises.Analogy method is in each iteration all plant structures to be traveled through with a definite sequence intuitively, upgrades the state of branch one by one.If the plant quantity of being simulated is big, and the plant structure complexity, the traversal of plant structure very expends computing time so, is difficult to carry out result's debugging and practical application.
In fact, can comprise a large amount of similar branches usually in the complicated plant structure, more common in the tree of maturation.According to observation, can be divided into limited several classes with putting in order strain ground plant branching to plant.The plant botanist thinks and branching pattern can be divided by physiological age.The similar features of plant branching can be used for the quick structure of plant structure.Every class branch can be described as a kernel texture, and each minor structure can be decomposed into the minor structure an of growth axis and following one deck, up to no longer comprising next straton structure.Concerning individual plants, the minor structure of top layer is a plant itself.The minor structure construction method is to every class minor structure, to define a minor structure storehouse; The building process of plant structure is from the simplest minor structure, and by calling and geometric transformation of minor structure, successively from top to down carries out.In this algorithm, computing time, the size with the minor structure storehouse was directly proportional, rather than and plant structure in the organ number be directly proportional, this plant structure for complexity has clear superiority.By evidence, for complicated plant structure, the efficient of this algorithm is higher than the ergodic algorithm of plant structure.Yet, this class methods neutron structure storehouse was by from simple to complicated, the disposable structure of top-down order in the past, and was not only not directly perceived, and existed the parton structure not to be called and waste the situation of resource, for simple plant structure, simulated time is higher than ergodic algorithm on the contrary.
There are at present several moneys to be specifically designed to the business software that makes up the virtual plant structure in the world, xfrog for example, Onxy tree, Speed tree, AMAP etc. are provided for the plug-in unit of the main flow software of desktop design mostly.The domestic professional software that does not still have this type of.The present invention can be used for the algorithm design of this type of software.
Summary of the invention
The technical matters that desire of the present invention solves is how to utilize to high efficient and flexible the similarity of plant branching, keeps the advantage of plant structure ergodic algorithm simultaneously, carry out virtual plant structure, preserve, call, interactive editing and compression store.For this reason, proposing a kind of three-dimensional plant based on dynamic minor structure makes up and storage means.
For realizing purpose of the present invention, the three-dimensional plant that the present invention is based on dynamic minor structure make up and the step of storage means as follows:
Step S1: the minor structure parameter initialization, determine that branch in the virtual plant is the type of minor structure and call relation successively; The maximum number of given every straton structure, i.e. minor structure storehouse size;
Step S2: make up plant structure according to dynamic substructure method, at first make up the growth axis of virtual plant, for the anyon locations of structures on the growth of virtual plant axle, if corresponding minor structure exists in the minor structure storehouse, then directly from the minor structure storehouse, call, carry out being combined to current minor structure after the geometric transformation; Otherwise, recursively successively make up minor structure, put into corresponding minor structure storehouse, finish up to the virtual plant structure construction;
Step S3: the plant data with substructure method are preserved; For each class minor structure, wherein the plant data are the information of the plant growth axis created in simulation process, and locational minor structure numbering of minor structure and transformation matrix;
Step S4: utilize minor structure information that plant structure is carried out interactive editing; Call relation between the minor structure can obtain from step S3, also can obtain from step S2.
Wherein, to minor structure storehouse of minor structure similar in plant structure definition,, wherein information saves time and the space by being repeated to call.
Wherein, the sample evidence in the described minor structure storehouse needs and can dynamically produce, and the minor structure that can avoid producing is not called.
Wherein, can only preserve the compression storage that a backup reaches virtual plant, can carry out interactively editor to plant and plant minor structure after making up according to the recalls information of minor structure by the minor structure that the counterweight polyphony is used.
Beneficial effect of the present invention: for the minor structure that repeats in the plant structure, only need the limited minor structure sample of simulation, improve simulation precision by the information of reusing the minor structure sample.Notice that minor structure is the notion of a recurrence.Virtual plant can be decomposed into main shaft and directly long minor structure on main shaft, and the minor structure on the main shaft can be divided into the minor structure of growth axis and following one deck again.Virtual plant itself is the minor structure in the forest scene.Because minor structure is dynamic creation as required in the plant structure building process in this method, therefore the time that does not exist minor structure not to be called and produce and the waste in space can both guarantee that to the plant structure of different complexities simulation precision is higher than the algorithm that plant structure is traveled through fully.The user can change efficient and the minor structure diversity that the minor structure size obtains expectation.The building process of plant is from carrying out down, and the minor structure of dynamic creation is traveled through, and is relatively more directly perceived.The shared space of file of preserving the virtual plant geometry usually increases with wherein the organ number is linear; For using the plant structure that dynamic minor structure algorithm makes up, because the information of minor structure is reused, therefore only need to preserve the conversion and the recalls information of minor structure, thereby reach the purpose of saving the space.When reading such file,, need the cost certain hour, so this is a kind of method of changing the space with the time owing to need carry out successively untiing and changing of minor structure.Because the recalls information of minor structure is saved, and can carry out interactive operation to plant.
Description of drawings
Fig. 1 a is based on the frame diagram of dynamic substructure method.
Fig. 1 b is the sub-process figure of step S2 among Fig. 1 a.
Fig. 2 is based on the simulation of minor structure at random and calls synoptic diagram.
Fig. 3 is the different classes of minor structure example that comprises in the plant structure.
Fig. 4 a and Fig. 4 b are that the substructure method of forest scene makes up synoptic diagram.
Fig. 5 is to the analog result of complicated plant structure in the software of blue or green garden.
Fig. 6 is to the analog result of plant structure at random in the software of blue or green garden.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, below in conjunction with specific embodiment, and with reference to accompanying drawing, the present invention is described in more detail.Here suppose that the reader is familiar with the plant structure modeling algorithm, for example automat, character string replacement system etc., how concentrated introduction uses dynamic minor structure algorithm in this class algorithm.
Fig. 1 a is depicted as the relation of the various piece that realizes dynamic substructure method.
Step S1 carries out the initialization of parameter to plant structure, determines that branch in the virtual plant is the type of minor structure and call relation successively; The maximum number of given every straton structure, i.e. minor structure storehouse size; Realize the virtual plant structure of expecting, at first plant structure is decomposed, determine the minor structure type that wherein comprises and syntagmatic successively; The division of minor structure type can be with reference to the physiological age of botanist's proposition.Every class minor structure adopts identical plant structure analog parameter.
The dynamic substructure method of step S2 basis carries out the structure of plant structure, and idiographic flow is shown in Fig. 1 b.Because minor structure is the notion of recurrence, for convenience of description, the current minor structure that is making up is called current minor structure, on the growth axis of current minor structure the minor structure of giving birth to be called next straton structure.Current minor structure is called the last layer minor structure with respect to the minor structure of following one deck.The classification of current minor structure is represented with integer p, represents virtual plant itself during p=0.The classification of next the straton structure that comprises in the current minor structure represents that with integer q general q is greater than p.The size in the pairing minor structure of minor structure p storehouse is T
p, the size in the pairing minor structure of minor structure q storehouse is T
q, all in step S1, define.Simulation process is from the main shaft (p=0) of plant.
Step 21: make up numbering n according to the plant structure modeling algorithm
pThe growth axis of current minor structure, deposit in the pairing minor structure of the minor structure p storehouse n in
p∈ [1, T
p];
Step 22: with graded traversal numbering n
pThe growth axis of current minor structure on all produce the position of next straton structure.Obtain numbering n according to the plant structure modeling algorithm
pThe growth axis of current minor structure on classification q, position and the direction of next straton structure.
Step 23: judge whether traversal finishes, and whether the information of the minor structure of following one deck has covered current minor structure; If traversal does not finish, also there is next straton locations of structures of vacancy, then change step 24, if traversal finishes, then change step 27.
Step 24: according to numbering n
pThe growth axis of current minor structure on next straton structured sort q produce one 1 to T
qBetween integer minor structure numbering m
q, m
q∈ [1, T
q].
Step 25: the minor structure m that judges this numbering
qWhether making up before, Already in the minor structure storehouse corresponding to classification q.If exist, then change step 21 over to, to being numbered m
qNext straton structure, to make up current minor structure n
pSame process is carried out recurrence and is made up; At this moment be numbered m
qMinor structure become current minor structure.If next straton structure m
qAlready in the pairing minor structure of the minor structure q storehouse, then change step 26.
Step 26: according to next straton structure m
qIts position and direction, carry out being combined to current growth axis after the geometric transformation, no longer repeat to make up, finish the back and change step 22.
Step 27: finish if the minor structure on the current growth axis has all made up, then the structure of current minor structure finishes, and changes the last layer minor structure, until top level structure.
Fig. 2 is based on the simulation of minor structure at random and calls synoptic diagram, represents that dynamic substructure method carries out the process of the structure of plant structure.Wherein, the dotted arrow of black is the simulation order of minor structure, and the minor structure of green curved arrow return order.S
1The virtual plant of indicating to make up, blue axle is its growth axis.The size in minor structures at different levels storehouse is 5.When the minor structure in wherein oval is made up, judge that at first this minor structure is corresponding to S
2The minor structure storehouse in whether exist, if there is no then enter into S
2The minor structure sample of this one deck makes up: simulation S
2The growth axis of the minor structure sample in the minor structure storehouse travels through all minor structure positions, judges whether the minor structure of certain numbering exists.If there is no then entering down one deck makes up.Continue until the simplest one deck minor structure S like this
4Successively call afterwards and return.
Step S3 represents to preserve with the plant data of substructure method; For each class minor structure, wherein the plant data are the information of the plant growth axis created in simulation process, and locational minor structure numbering of minor structure and transformation matrix.When existing minor structure to repeat to call in a large number, the minor structure data that repeat are only preserved a backup.Data are preserved and can be carried out synchronously with the plant structure building process of step S2, also can realize after step S2 finishes.Plant organ can be regarded a special case of minor structure as, and its geometry defines separately.Every kind of organ is corresponding to an organ description document, and the organ description document comprises information such as the geometric model, texture coordinate of organ, can be by the professional software manual creation.A sign of only preserving this organ in the plant data of preserving in the minor structure mode, thus the space saved.The Data Structures of describing a minor structure is as follows:
SUBSTRUCTURE
{
Int ID; The sign of // minor structure;
Int length; // institute comprises the organ number;
ORGAN O (length); // organ the tabulation that comprised
}
Wherein, ID is the feature of minor structure, and the classification of this minor structure is described.The organ number of length for comprising in its growth axis comprises common organ, and for example internode, leaf, fruit etc. also comprise next stage minor structure wherein.O (length) is the specific descriptions to each organ.Its data structure ORGAN is described below:
ORGAN
{
Int symbol; // organ classification;
Int ID; // organ sign;
Float Mo (3,4); // geometric transformation;
Float So (2); // be the organ size for organ, then meaningless for minor structure.
Int num_sons; // organ number pointed
Int id_sons (num_sons); // sub-organ sign pointed
Int id_parent; // father organ sign
}
Wherein, what symbol was used for identification data structure ORGAN preservation is organ or minor structure, and different organs has different classifications, and is corresponding with the organ description document.ID is the feature of organ.Mo comprises the rotation and the translation transformation matrix of organ or minor structure.If it is organ that symbol represents current minor structure, then So is the size of organ, otherwise meaningless.Num_sons represents the sub-organ number of current organ.For internode, on it the organ of giving birth to and the internode on minor structure and top thereof all be considered as its sub-organ.Id_sons (num_sons) has promptly deposited the sign of all sub-organs.Similarly, id_parent has deposited the sign of father's organ of current organ.All organs or minor structure data are deposited with the direction and the size of standard, provide its size, direction and position on growth axis when calling.
For the data of preserving in the minor structure mode, can recursively parse complete plant geological information, carry out follow-up processing.The resolving of describing in the false code mode is as follows:
Read_Substructure(SUBSTRUCTURE?s)
{
for?i＝1?to?s.length
If O (i) .symbol＜〉' minor structure '
Output_Substructure (O (i)); The information of // output organ
else
Read_Substructure(O(i))；
end
end
}
Wherein, function R ead_substructure reads the organ information that comprises in the current minor structure one by one, if this organ is a minor structure, then further minor structure is wherein resolved.If this organ is common organ (is s.symbol＜〉' minor structure '), then directly read the information of organ description document, carry out conversion and return according to transform matrix M o.Because the ID of each minor structure is unique, so by ID minor structure is directly visited, thereby can obtain the minor structure information of optional position.For example Fig. 3 is the different classes of minor structure example that comprises in the plant structure, from left to right is respectively the different classes of minor structure with relation of inclusion.
Step S4 utilizes minor structure information that plant structure is carried out interactive editing.For example user's operation such as carry out that branch is pruned, dragged.Need the call relation between the minor structure in carrying out reciprocal process, make the user behind certain position of the growth axis of choosing a minor structure on the screen, all plant ingredients of this top, position can both be selected.Call relation between the minor structure can obtain from step S3, also can obtain from step S2, and the latter means carry out interactive editing in simulation process.Can carry out for example beta pruning after choosing, dredge leaf, action etc. such as drag.Aforesaid operations has been equivalent to create a new minor structure.At this moment need to revise the annexation between the minor structure, the numbering of new minor structure is kept in the upper level minor structure, and the invoked number of times of old minor structure reduces.Amended information is passed step S2 or step S3. back
The above-mentioned thought that makes up based on the plant structure of dynamic minor structure extends to the structure of plant community, promptly the substructure method that the forest scene is shown as Fig. 4 a and Fig. 4 b makes up synoptic diagram, when structure comprises the scene of a large amount of plant individuals, only simulate limited several plant samples, make up group by reusing these information then.Represent the virtual plant sample as Fig. 4 a, Fig. 4 b represents these several samples of repeated application and the plant scene that makes up.
Here we have provided the result of implementation in " blue or green garden " software." blue or green garden " is independently developed a plant growth and a structural simulation software based on the GreenLab functional architecture model of this seminar, can be used to make up various crops and plant.The GreenLab model is a general mathematical model, sets up based on phytological basic assumption.Blue or green garden software has been realized method described in the invention with the c++ language, and tests.The CPU that is configured to Intel Core (TM) 21.86G of PC, the internal memory of 2G, operating system is Windows XP Professional.Fig. 5 be in the software of blue or green garden to the analog result of complicated plant structure, the simulation based on the willow of the complexity of determinacy minor structure has wherein comprised 1210.6 ten thousand organs, the Model Calculation time is 10.2 seconds.Fig. 6 be in the software of blue or green garden to the analog result of plant structure at random for based on the simulation of the pine tree of minor structure at random, wherein the size in minor structure storehouse is 5.Show under less like this minor structure size, can obtain good visual effect.
The above; only be the embodiment among the present invention, but protection scope of the present invention is not limited thereto, anyly is familiar with the people of this technology in the disclosed technical scope of the present invention; can understand conversion or the replacement expected, all should be encompassed within the protection domain of claims of the present invention.
Claims (4)
1. the three-dimensional plant based on dynamic minor structure makes up and storage means, it is characterized in that described method comprises that step is as follows:
Step S1: the minor structure parameter initialization, determine that branch in the virtual plant is the type of minor structure and call relation successively; The maximum number of given every straton structure, i.e. minor structure storehouse size;
Step S2: make up plant structure according to dynamic substructure method, at first make up the growth axis of virtual plant, for the anyon locations of structures on the growth of virtual plant axle, if corresponding minor structure exists in the minor structure storehouse, then directly from the minor structure storehouse, call, carry out being combined to current minor structure after the geometric transformation; Otherwise, recursively successively make up minor structure, put into corresponding minor structure storehouse, finish up to the virtual plant structure construction;
Step S3: the plant data with substructure method are preserved; For each class minor structure, wherein the plant data are the information of the plant growth axis created in simulation process, and locational minor structure numbering of minor structure and transformation matrix;
Step S4: utilize minor structure information that plant structure is carried out interactive editing; Call relation between the minor structure can obtain from step S3, also can obtain from step S2.
2. the three-dimensional plant based on dynamic minor structure according to claim 1 makes up and storage means, it is characterized in that, to minor structure storehouse of minor structure definition similar in the plant structure, saves time and the space by wherein information is repeated to call.
3. the three-dimensional plant based on dynamic minor structure according to claim 1 makes up and storage means, it is characterized in that, the sample evidence in the described minor structure storehouse needs and can dynamically produce, and the minor structure that can avoid producing is not called.
4. the three-dimensional plant based on dynamic minor structure according to claim 1 makes up and storage means, it is characterized in that, can only preserve the compression storage that a backup reaches virtual plant by the minor structure that the counterweight polyphony is used, can carry out interactively editor to plant and plant minor structure after making up according to the recalls information of minor structure.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106031804A CN102034268B (en) | 2010-12-23 | 2010-12-23 | Method for constructing and storing three-dimensional virtual plant based on dynamic substructure |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010106031804A CN102034268B (en) | 2010-12-23 | 2010-12-23 | Method for constructing and storing three-dimensional virtual plant based on dynamic substructure |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102034268A true CN102034268A (en) | 2011-04-27 |
| CN102034268B CN102034268B (en) | 2012-06-27 |
Family
ID=43887120
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010106031804A Active CN102034268B (en) | 2010-12-23 | 2010-12-23 | Method for constructing and storing three-dimensional virtual plant based on dynamic substructure |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102034268B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102314546A (en) * | 2011-06-01 | 2012-01-11 | 福州大学 | Method for estimating plant growth biomass liveweight variation based on virtual plants |
-
2010
- 2010-12-23 CN CN2010106031804A patent/CN102034268B/en active Active
Non-Patent Citations (6)
| Title |
|---|
| 《10th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision》 20020208 Hong-Ping Yan et al Fast Algorithms of Plant Computation Based on Substructure Instances 第146页左栏倒数第2段第1－12行 2 , 2 * |
| 《11th International Conference in Central Europe on Computer Graphics, Visualization and Digital Interactive Media》 20030207 MengZhen Kang et al Fast Algorithm for Stochastic Tree Computation and Forest Simulation 全文 1－4 , 2 * |
| 《16th International Conference on Artificial Reality and Telexistence--Workshops》 20061201 Ding Wei-long et al An Improved Algorithm Based on Sub-structures for Creating Virtual Plant 全文 1－4 , 2 * |
| 《Plant Growth Modeling and Applications》 20031016 M.-Z. Kang et al Stochastic 3D Tree Simulation Using Substructure Instancing 全文 1－4 , 2 * |
| 《中国图象图形学报》 20040331 康孟珍 等 快速构造植物几何结构的子结构算法 第80页左栏第2段，第80－82页2.1节，第83页第3节，第84页左栏第1段，及图1、图2 1－4 第9卷, 第3期 2 * |
| 《安徽农业科学》 20081231 胡林 等 虚拟植物研究进展 全文 1－4 第36卷, 第25期 2 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102314546A (en) * | 2011-06-01 | 2012-01-11 | 福州大学 | Method for estimating plant growth biomass liveweight variation based on virtual plants |
| CN102314546B (en) * | 2011-06-01 | 2014-03-12 | 福州大学 | Method for estimating plant growth biomass liveweight variation based on virtual plants |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102034268B (en) | 2012-06-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Deussen et al. | Realistic modeling and rendering of plant ecosystems | |
| Berry et al. | The Land-use Change Analysis System (LUCAS) for evaluating landscape management decisions | |
| CN109976735B (en) | Knowledge graph algorithm application platform based on web visualization | |
| CN110134724A (en) | A kind of the data intelligence extraction and display system and method for Building Information Model | |
| KR20150143473A (en) | Signal capture controls in recalculation user interface | |
| CN104573231A (en) | BIM based smart building system and method | |
| Bulatewicz et al. | The simple script wrapper for OpenMI: enabling interdisciplinary modeling studies | |
| CN109840205A (en) | Applied program testing method, device, readable storage medium storing program for executing and terminal device | |
| Hurter | Image-based visualization: Interactive multidimensional data exploration | |
| CN109784708A (en) | The cloud service system that the coupling of water industry multi-model calculates | |
| CN114003621A (en) | Dynamic visualization method and system for regional carbon emission | |
| WO2023138437A1 (en) | Application development platform, micro-program generation method, and device and storage medium | |
| CN117173367B (en) | Method and equipment for establishing dynamic landscape plant component library based on Rhino | |
| Du | Application of CAD aided intelligent technology in landscape design | |
| CN102034268B (en) | Method for constructing and storing three-dimensional virtual plant based on dynamic substructure | |
| McCarter | Integrating forest inventory, growth and yield, and computer visualization into a landscape management system | |
| Nabhani et al. | TreeSim: An object-oriented individual tree simulator and 3D visualization tool in Python | |
| Hamon et al. | RTIL-system: a Real-Time Interactive L-system for 3D interactions with virtual plants | |
| Griffon et al. | AMAPstudio: a software suite for plants architecture modelling | |
| US20130086491A1 (en) | Automatically generating a business process flow gui using a symbolic annotation language | |
| Huang et al. | A novel visual modeling system for time series forecast: application to the domain of hydrology | |
| CN110728750A (en) | Intelligent driving environment live-action modeling method, system, terminal and storage medium | |
| CN118093556B (en) | Method and device for constructing scientific research communities in frozen circle field based on data engineering | |
| Ambarwari et al. | Conceptual Model of Graph-based Individual Tree and Its Utilization in Digital Twin and Metaverse of Urban Forest | |
| Wainer et al. | A Web‐Based Architecture to Operationalize Geospatial Simulation Environments |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |