Razmestitev dreves v sestoju

Cedilnik, Anton (author), Kotar, Marijan (author)

V sestavku najprej pojasnimo, da sta sistematičnost/naključnost in enakomernost/šopastost dve v splošnem nekorelirani lastnosti sestoja. Nadalje izračunamo povprečni minimalni razdalji od stojišča do drevesa in od drevesa do soseda pri nekaterih ekstremnih razmestitvah dreves. Ti računi so utemeljitev definicije dveh parametrov, ki ju predlagamo kot meri za stopnjo enakomernosti in stopnjo naključnosti. Glavna odlika teh parametrov je neodvisnost - tako od izbire merskih enot kot od ocene gostote sestoja.

• Language: Slovenian
• Keywords: matematika, verjetnostni račun, gozdarstvo, razmestitev dreves, minimalna razdalja
• Typology: 1.01 - Original Scientific Article
• Organization: BF - Biotechnical Faculty
• Year: 1992
• Number of pages: Str.15-40
• Numbering: Let. 40
• PID: 20.500.12556/RUL-69743
• UDC: 630*1:519.2
• ISSN on article: 0351-3114
• COBISS.SI-ID: 36061440
• Publication date in RUL: 10.07.2015

Record is a part of a journal

• Title: Zbornik gozdarstva in lesarstva. forest and wood science & technology
• Shortened title: Zb. gozd. lesar.
• Publisher: Gozdarski inštitut Slovenije, Biotehniška fakulteta, Oddelek za gozdarstvo in obnovljive gozdne vire, Biotehniška fakulteta, Oddelek za lesarstvo
• ISSN: 0351-3114
• COBISS.SI-ID: 6206978

Secondary language

• Language: English
• Title: The arrangement of trees in a stand

Abstract

We shall first explain that the two properties of the arrangement of stand, systematic vs. random and uniform vs. cluster, are generally not correlated. Then we calculate the mean minimal distances from point to tree to neighbour, in cases of extreme arrangements of trees. These calculations are the argumentation of definition of two parameters, which we suggest as a measures of a degree of uniformity and a degree of randomness. The main advantage of these parameters is independence of chosen units and of estimate of tree density.

• Keywords: mathematics, probability, forestry, tree arrangement, minimal distance