Terrain Processor: Area: High-density Cluster
Jump to navigation
Jump to search
| Task name: Area: Hight-density Cluster
Dll plugin name: BITasksPlugin.dll Geometry type: Polygon, PolygonM, PolygonZ Heightmap: No |
Description
Random placement of multiple objects inside the polygons specified in the given shapefile. First step is to create lifegrid. Lifegrid is 2D table where every cell has information about its Object prototype. Algorithm puts some first seeds. Counts and types of seeds depends on input parameters. Ideal for high density areas like forest.
Example :
- Spruce 85% PROB
- Pine 10% PROB
- Larch 5% PROB
| Fragmentation | Spruce seeds count | Pine seeds count | Larch seeds count | Preview |
|---|---|---|---|---|
| 1 | 17 | 2 | 1 | 
|
| 2 | 34 | 4 | 2 | 
|
| 5 | 85 | 10 | 5 | 
|
Legend: 
Task parameters
- Random seed - number used to initialize pseudorandom number generator.
- Hectare - area size in hectares (individual for each shape)
- Hectare density - density of the filling in number of objects for hectare. For example 100 objects for hectare means an average distance of about 10 meters between objects.
- Fraction - initial seeds count for smallest probability object prototype on hectare.
- Blend distance - distance to get object prototype.
Object prototype parameters
- OBJECT - Object's prototype name
- PROB - Object's probability
- MINHEIGHT - Minimal size in %
- MAXHEIGHT - Maximal size in %
- MINDIST - Minimal distance in meters
Usage
Use for areas with high objects density, where particular object types tend to aggregate in groups, e.g. in mixed forests.
Algorithm
For each shape (areal) do :
- Create and populate "lifegrid"
- Find shape bounding.
- Create empty "lifegrid" for this area.
- Generate base seeds (for each object prototype)
- seeds_count = HECTARES * CDENSHA
- Randomly generate seeds_count in shape and set this grid item prototype.
- instances_count = HECTARES * DENSHA
- For instances_count try to find position :
- Random position in bounding box.
- If position is inside shape, continue to c. else a.
- Test with objects if minimal distance is ok, continue to d. else a.
- Find object prototype - random grid item in radius 50 meters. This grid item has information about object prototype.
If this loop a <-> d has no new output for last 100 attempts, area is full and iteration of this shape will end.