Moments of distance from a vertex to a uniformly distributed random point within arbitrary triangles (Q1793654): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q59140915, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Robust density estimation using distance methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Handbook of computational statistics. Concepts and methods. / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Non-parametric Sampling Approximation via Voronoi Tessellations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiscale modelling of evolving foams / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the estimation of the point-object nearest neighbour distribution F<i>(y)</i>for point processes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Kernel density estimation via diffusion / rank | |||
Normal rank | |||
Latest revision as of 20:41, 16 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Moments of distance from a vertex to a uniformly distributed random point within arbitrary triangles |
scientific article |
Statements
Moments of distance from a vertex to a uniformly distributed random point within arbitrary triangles (English)
0 references
12 October 2018
0 references
Summary: We study the cumulative distribution function (CDF), probability density function (PDF), and moments of distance between a given vertex and a uniformly distributed random point within a triangle in this work. Based on a computational technique that helps us provide unified formulae of the CDF and PDF for this random distance then we compute its moments of arbitrary orders, based on which the variance and standard deviation can be easily derived. We conduct Monte Carlo simulations under various conditions to check the validity of our theoretical derivations. Our method can be adapted to study the random distances sampled from arbitrary polygons by decomposing them into triangles.
0 references
0 references
