jburkardt

TRIANGLE_HISTOGRAM\ Histograms of Triangle Data {#triangle_histogram-histograms-of-triangle-data align=”center”} ===========================


TRIANGLE_HISTOGRAM is a C++ program which creates a histogram of data in the unit triangle.

The unit triangle has the vertices (1,0), (0,1), (0,0).

“Data” in the unit triangle is assumed to take the form of a file, containing a list of points that lie in the triangle.

The sides of the triangle can each be divided into N subintervals, and by connecting them, the result is N*N subtriangles of the same area.

The program then determines the number of points that lie within each subtriangle, and prints this list.

This program is particularly suitable for investigating whether a set of points in the unit triangle are close to a uniformly sampling, or if there is some bias in the selection.

Usage: {#usage align=”center”}

triangle_histogram data_file n

where

Licensing: {#licensing align=”center”}

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

Languages: {#languages align=”center”}

TRIANGLE_HISTOGRAM is available in a C++ version and a FORTRAN90 version and a MATLAB version.

RANDOM_DATA, a C++ program which produces random samples from a number of regions, including triangles.

TRIANGLE_ANALYZE, a C++ program which reads a triangle defined in a file, and uses the triangle_properties() library to compute angles, area, centroid, circumcircle, edge lengths, incircle, orientation, orthocenter, and quality.

TRIANGLE_MONTE_CARLO, a C++ program which uses the Monte Carlo method to estimate integrals over a triangle.

TRIANGLE_SAMPLES, a dataset directory which contains sets of sample points drawn from the unit triangle.

Reference: {#reference align=”center”}

  1. Reuven Rubinstein,\ Monte Carlo Optimization, Simulation and Sensitivity of Queueing Networks,\ Krieger, 1992,\ ISBN: 0894647644,\ LC: QA298.R79.
  2. 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: {#source-code align=”center”}

Examples and Tests: {#examples-and-tests align=”center”}

B10000 is a “bad” set of sample points.

G10000 is a “good” set of sample points.

List of Routines: {#list-of-routines align=”center”}

You can go up one level to the C++ source codes.


Last revised on 14 August 2009.