• 検索結果がありません。

JAIST Repository: 階層構造を考慮した木の分布生成

N/A
N/A
Protected

Academic year: 2021

シェア "JAIST Repository: 階層構造を考慮した木の分布生成"

Copied!
2
0
0

読み込み中.... (全文を見る)

全文

(1)

Japan Advanced Institute of Science and Technology

JAIST Repository

https://dspace.jaist.ac.jp/ Title 階層構造を考慮した木の分布生成 Author(s) 溝口, 敦士 Citation Issue Date 2008-03

Type Thesis or Dissertation

Text version author

URL http://hdl.handle.net/10119/4279

Rights

(2)

Generation of Tree Distribution

With Multi Layer Structure

Atsushi Mizoguchi

School of Knowledge Science,

Japan Advanced Institute of Science and Technology

March 2008

Keywords: computer graphics, tree growth simulation, multi layer structure of forest.

There are many movies and video games that are created by computer graphics. The works express various natural objects. However, because of complications of natural objects, workload of creation increases with improvement of quality. Producers need increasing efficiency of creation of computer graphics.

This paper describes method that enables producers to create forests with multi layer structure in computer graphics. Generating tree distribution automatically improves the efficiency of the creation process. Generating tree distribution with multi layer structure has not been realized in previous research. A virtual forest does not have to be the same as a real forest. Therefore producers need techniques to reflect their intentions regarding the virtual forest.

In this paper, to generate tree distribution, a forest is simulated in the computer. There are two factors to obtain a tree distribution with multi layer structure. Upper layer trees have priority over lower layer trees in acquisition of light resources. And maximum height of a tree is different between species. Part of their simulation is implemented on GPU.

As a result of this research, it is possible to generate tree distribution with multi layer structure. And a producer can edit forests easily by editing image data. Simulation speed is so fast that a producer can edit virtual forests interactively.

参照

関連したドキュメント

Given any d 2 D , to prove that there are infinitely many sets of 13 consecutive positive integers that are all d-composite sandwich numbers, we utilize the method and coverings

If we are sloppy in the distinction of Chomp and Chomp o , it will be clear which is meant: if the poset has a smallest element and the game is supposed to last longer than one

One of several properties of harmonic functions is the Gauss theorem stating that if u is harmonic, then it has the mean value property with respect to the Lebesgue measure on all

Furthermore, the following analogue of Theorem 1.13 shows that though the constants in Theorem 1.19 are sharp, Simpson’s rule is asymptotically better than the trapezoidal

The main purpose of this survey is to identify and highlight the discrete inequalities that are connected with (CBS)− inequality and provide refinements and reverse results as well

Order parameters were introduced to characterize special features of these systems, notably the state of the capsule; the dispersal of the therapeutic compound, siRNA, gene, or

We denote by Rec(Σ, S) (and budRec(Σ, S)) the class of tree series over Σ and S which are recognized by weighted tree automata (respectively, by bottom- up deterministic weighted

In this article, using the sub-supersolution method and Rabinowitz- type global bifurcation theory, we prove some results on existence, uniqueness and multiplicity of positive