CIRCLE_ARC_GRID
Compute Grid Points Along a Circular Arc


CIRCLE_ARC_GRID is a C++ library which calculates a grid of points along a circle or circular arc in 2D.

Licensing:

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

Languages:

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

Related Programs:

BALL_GRID, a C++ library which computes a grid of points over the interior of a ball in 3D.

CUBE_GRID, a C++ library which computes a grid of points over the interior of a cube in 3D.

DISK_GRID, a C++ library which computes a grid of points over the interior of a disk in 2D.

ELLIPSE_GRID, a C++ library which computes a grid of points over the interior of an ellipse in 2D.

ELLIPSOID_GRID, a C++ library which computes a grid of points over the interior of an ellipsoid in 3D.

HYPERCUBE_GRID, a C++ library which computes a grid of points over the interior of a hypercube in M dimensions.

LINE_GRID, a C++ library which computes a grid of points over the interior of a line segment in 1D.

POLYGON_GRID, a C++ library which generates a grid of points over the interior of a polygon in 2D.

PYRAMID_GRID, a C++ library which computes a grid of points over the interior of the unit pyramid in 3D;

SIMPLEX_GRID, a C++ library which generates a grid of points over the interior of a simplex in M dimensions.

SPHERE_FIBONACCI_GRID, a C++ library which uses a Fibonacci spiral to create a grid of points on the surface of the unit sphere in 3D.

SPHERE_GRID, a C++ library which provides a number of ways of generating grids of points, or of points and lines, or of points and lines and faces, on the surface of the unit sphere in 3D.

SPHERE_LLQ_GRID, a C++ library which uses longitudes and latitudes to create grids of points, lines, and quadrilaterals on the surface of the unit sphere in 3D.

SPHERE_LLT_GRID, a C++ library which uses longitudes and latitudes to create grids of points, lines, and triangles on the surface of the unit sphere in 3D.

SQUARE_GRID, a C++ library which computes a grid of points over the interior of a square in 2D.

TETRAHEDRON_GRID, a C++ library which computes a grid of points over the interior of a tetrahedron in 3D.

TRIANGLE_GRID, a C++ library which computes a grid of points over the interior of a triangle in 2D.

WEDGE_GRID, a C++ library which computes a grid of points over the interior of the unit wedge in 3D.

Source Code:

Examples and Tests:

ARC is a set of 10 equally spaced points from 0 to 90 degrees, on a circle of radius 2 centered at (5,5).

PENTAGON is a set of 6(!) equally spaced points from 0 to 360 degrees. This is the easiest way to get a pentagon, but you should really edit the file and remove the last point, since it repeats the first one. The alternative is to specify that the angles range from 0 to 288 degrees!

List of Routines:

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


Last revised on 13 November 2011.