Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard

DOI10.1142/S0218195922500091MaRDI QIDQ6173262zbMATH OpenOpenAlexFDO

Authors Vincent Guigues

Publication date 21 July 2023

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1406.0005

zbMATH Keywords

computational geometrydistance to a random variablegeometric probabilityGreen's theoremPSHAuniform distribution

Mathematics Subject Classification ID

Euclidean analytic geometry (51N20) Geometric probability and stochastic geometry (60D05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Digital mathematics libraries and repositories (68V35) Seismology (including tsunami modeling), earthquakes (86A15)

Abstract: We consider a random variable expressed as the Euclidean distance between an arbitrary point and a random variable uniformly distributed in a closed and bounded set of a three-dimensional Euclidean space. Four cases are considered for this set: a union of disjoint disks, a union of disjoint balls, a union of disjoint line segments, and the boundary of a polyhedron. In the first three cases, we provide closed-form expressions of the cumulative distribution function and the density. In the last case, we propose an algorithm with complexity O(n ln n), n being the number of edges of the polyhedron, that computes exactly the cumulative distribution function. An application of these results to probabilistic seismic hazard analysis and extensions are discussed.

Recommendations

• Distance distribution between two random points in arbitrary polygons
• Moments of distance from a vertex to a uniformly distributed random point within arbitrary triangles
• The distance between random points in rectangles
• Calculation of the distance betweeen two random sets
• On Approximating the Distribution of Random Distances Within and Between Certain Regions of Space

Cites work

• A note concerning the distances of uniformly distributed points from the centre of a rectangle
• Approximate convex decomposition of polygons
• Computational Geometry in C
• Largest and smallest convex hulls for imprecise points
• Region-based approximation algorithms for visibility between imprecise locations

This page was built for publication: Algorithms and a Library for the Exact Computation of the Cumulative Distribution Function of the Euclidean Distance Between a Point and a Random Variable Uniformly Distributed in Disks, Balls, or Polygones and Application to Probabilistic Seismic Hazard

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173262)