triangle_monte_carlo

triangle_monte_carlo, an Octave code which estimates the integral of a function over a general triangle using the Monte Carlo method.

The library makes it relatively easy to compare different methods of producing sample points in the triangle, and to vary the triangle over which integration is carried out.

Languages:

triangle_monte_carlo is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:

annulus_monte_carlo an Octave code which uses the monte carlo method to estimate the integral of a function over the interior of a circular annulus in 2d.

ball_monte_carlo, an Octave code which applies a monte carlo method to estimate integrals of a function over the interior of the unit ball in 3d;

circle_monte_carlo, an Octave code which applies a monte carlo method to estimate the integral of a function on the circumference of the unit circle in 2d;

cube_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit cube in 3D.

disk_monte_carlo, an Octave code which uses the Monte Carlo method to estimate integrals over the interior of the general disk in 2D.

disk01_monte_carlo, an Octave code which applies a monte carlo method to estimate the integral of a function over the interior of the unit disk in 2d;

disk01_quarter_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit quarter disk in 2D;

ellipse_monte_carlo an Octave code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipse in 2D.

ellipsoid_monte_carlo an Octave code which uses the Monte Carlo method to estimate the value of integrals over the interior of an ellipsoid in M dimensions.

hyperball_monte_carlo, an Octave code which applies a monte carlo method to estimate the integral of a function over the interior of the unit hyperball in m dimensions;

hypercube_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit hypercube in M dimensions.

hypersphere_monte_carlo, an Octave code which applies a monte carlo method to estimate the integral of a function on the surface of the unit sphere in m dimensions;

line_monte_carlo, an Octave code which uses the Monte Carlo method to estimate integrals over the length of the unit line in 1D.

polygon_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of a polygon in 2D.

pyramid_monte_carlo, an Octave code which applies a Monte Carlo method to estimate integrals of a function over the interior of the unit pyramid in 3D;

simplex_monte_carlo, an Octave code which uses the Monte Carlo method to estimate integrals over the interior of the unit simplex in M dimensions.

sphere_monte_carlo, an Octave code which applies a monte carlo method to estimate the integral of a function over the surface of the unit sphere in 3d;

sphere_triangle_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over a spherical triangle on the surface of the unit sphere in 3D;

square_monte_carlo, an Octave code which applies a Monte Carlo method to estimate the integral of a function over the interior of the unit square in 2D.

tetrahedron_monte_carlo, an Octave code which uses the Monte Carlo method to estimate integrals over the interior of a general tetrahedron in 3D.

tetrahedron01_monte_carlo, an Octave code which uses the Monte Carlo method to estimate integrals over the interior of the unit tetrahedron in 3D.

triangle01_monte_carlo, an Octave code which uses the monte carlo method to estimate integrals over the interior of the unit triangle in 2d.

wedge_monte_carlo, an Octave code which uses the Monte Carlo method to estimate integrals over the interior of the unit wedge in 3D.

Reference:

1. Claudio Rocchini, Paolo Cignoni,
Generating Random Points in a Tetrahedron,
Journal of Graphics Tools,
Volume 5, Number 4, 2000, pages 9-12.
2. Reuven Rubinstein,
Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks,
Krieger, 1992,
ISBN: 0894647644,
LC: QA298.R79.
3. Greg Turk,
Generating Random Points in a Triangle,
in Graphics Gems I,
edited by Andrew Glassner,
AP Professional, 1990,
ISBN: 0122861663,
LC: T385.G697

Source Code:

Last revised on 08 November 2022.