Fandom

武装突袭 Wiki

Terrain Processor: Area: Low-density Cluster (strip)

简体 | 繁體

4,827个页面创建
于此维基上
添加新页面
评论0 分享

您使用了广告屏蔽软件!


Wikia通过广告运营为用户提供免费的服务。我们对用户通过嵌入广告屏蔽软件访问网站进行了使用调整。

如果您使用了广告屏蔽软件,将无法使用我们的服务。请您移除广告屏蔽软件,以确保页面正常加载。

Task details

Task name : Area: Low-density Cluster (strip)

Dll plugin name : BITasksPlugin.dll

Geometry type : Polygon, PolygonM, PolygonZ

Heightmap : No

Description

Algorithm used for populating low-density areas. Objects are organized in linear clusters.

Task parameters

  • RANDOM SEED - number used to initialize pseudorandom number generator.
  • CDENSHA - The density of the filling in number of clusters for hectare.

Object prototype parameters

  • OBJECT - Object's prototype name
  • MINHEIGHT - Minimal size in %
  • MAXHEIGHT - Maximal size in %
  • MINDIST - Minimal distance in meters
  • GROUPID - Cluster group id
  • MINCOUNT - Minimal count of objects in one cluster
  • MAXCOUNT - Maximal count of objects in one cluster

Usage

Similar to the "Area: Low-density Cluster (circle)", creates prolonged clusters of given width. Perfect for small tree groups, or for adding lines of undergrowth into forests.

Algorithm

For each shape (areal) do :

  1. clusters_count = HECTARES * CDENSHA
  2. For clusters_count :
    1. Get random prototypes group.
    2. Find position inside shape = cluster_center.
    3. For each object prototype do :
      1. prototypes_count = random MINCOUNT - MAXCOUNT
      2. For prototypes_count :
        1. Get random direction_vector with random length (0 - MAXCRADIUS) from cluster_center.
        2. If position = cluster_center + direction_vector id inside shape and condition MINDIST[n] is ok, then 3. else 1.
        3. Create new instance for object prototype in position.

Sample

File:TerrainProcessor LinearClusterSettings.png

File:TerrainProcessor LinearCluster.png


更多维基

随机维基