亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

SMOOTHING

  • srand[getpid[]] /* initialize some of the memory */ memset[heightmap, 0, MAPSIZE*MAPSIZE]

    srand[getpid[]] /* initialize some of the memory */ memset[heightmap, 0, MAPSIZE*MAPSIZE] memset[vpage, 0, RENDERWIDTH * RENDERHEIGHT] printf["Creating dx d fractal terrain\n", MAPSIZE, MAPSIZE] heightmap[0] = [rand[] 128] + 64 // initialize starting point on map CreateFractalMap[0, 0, MAPSIZE, MAPSIZE] printf["SMOOTHING terrain\n"] for [i = 0 i < 5 i++] SmoothMap[] MakeColorMap[]

    標簽: MAPSIZE initialize heightmap getpid

    上傳時間: 2013-12-25

    上傳用戶:CSUSheep

  • Features a unique program to estimate the power spectral density. The spectrum containing all signif

    Features a unique program to estimate the power spectral density. The spectrum containing all significant details is calculated from a time series model. Model type as well as model order are determined automatically from the data, using statistical criteria. Robust estimation algorithms and order selection criteria are used to obtain reliable results. Unlike in FFT analysis, where the experimenter has to set the amount of SMOOTHING of the raw FFT, the right level of detail is assessed using the data only.

    標簽: containing Features estimate spectral

    上傳時間: 2014-02-09

    上傳用戶:daguda

  • distmesh

    matlab有限元網格劃分程序 DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based SMOOTHING procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and run it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.

    標簽: matlab有限元網格劃分程序

    上傳時間: 2015-08-12

    上傳用戶:凜風拂衣袖

主站蜘蛛池模板: 商洛市| 伊春市| 乌兰察布市| 云浮市| 永康市| 嘉定区| 开原市| 林周县| 安溪县| 聂荣县| 泰安市| 凤台县| 泌阳县| 青河县| 图木舒克市| 句容市| 清原| 页游| 达孜县| 宜都市| 上虞市| 连南| 民权县| 平乡县| 渝中区| 密云县| 梁平县| 五家渠市| 海兴县| 张家口市| 长海县| 临颍县| 黄龙县| 临猗县| 靖州| 株洲市| 黎平县| 安义县| 开封市| 乌拉特后旗| 许昌县|