triangle_monte_carlo

triangle_monte_carlo, a MATLAB 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.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Languages:

triangle_monte_carlo is available in a C version and a C++ version and a FORTRAN90 version and a MATLAB version and a Python version.

Related Data and Programs:

annulus_monte_carlo a MATLAB 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, a MATLAB 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, a MATLAB code which applies a monte carlo method to estimate the integral of a function on the circumference of the unit circle in 2d;

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

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

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

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

tetrahedron_monte_carlo, a MATLAB code which uses the monte carlo method to estimate integrals over a tetrahedron.

triangle_monte_carlo_test

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

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:

• r8mat_transpose_print.m prints an R8MAT, transposed.
• r8mat_transpose_print_some.m prints some of an R8MAT, transposed.
• reference_to_physical_t3.m maps T3 reference points to physical points.
• s_len_trim.m returns the length of a string to the last nonblank.
• triangle_area.m computes the area of a triangle.
• triangle_integrand_01.m evaluates 1 integrand function.
• triangle_integrand_02.m evaluates 2 integrand functions.
• triangle_integrand_03.m evaluates 3 integrand functions.
• triangle_integrand_04.m evaluates 4 integrand functions.
• triangle_integrand_05.m evaluates 5 integrand functions.
• triangle_monte_carlo.m applies the Monte Carlo rule to integrate a function.
• triangle_unit_sample_01.m selects points from the unit triangle.
• triangle_unit_sample_02.m selects points from the unit triangle.
• triangle_unit_sample_03.m selects points from the unit triangle.
• triangle_unit_sample_04.m selects points from the unit triangle.