Computational Geometry in 2D

Topics
	Computational Geometry in axisymmetric
	Computational geometry routines in axisymmetric.
	Polygon flooding
	Computational geometry tool to fill a convex polygon with a given volume fraction in a given direction.
	Line/polygon intersection
	Computational geometry tools relative to lines and polygon intersection.
	Line/line segment intersection
	Computational geometry tools relative to lines and line segments intersection.
	Point properties
	Computational geometry tools relative to points.
	Polygon
	This module contains the definition of a polygon and some related subroutines.
	Polygon list
	This module contains the definition of a polygon list and some related subroutines.
	Polygon/polygon intersection
	Computational geometry tools relative to polygon intersection.

Detailed Description

We provide here a list of functions and subroutines that detect or compute the intersection of various bi-dimensional objects. In the source file, the routines that perform detection are placed before the routines that make the computations. Detection algorithms are generally asymptotically faster than computation algorithms.

Notations

All functions, types and subroutines are prefixed by cg2_.

The different objects such as lines or polygons are referenced by specific notations. Here is a non-exhaustive list of the main notations used in the documentation:

• points: p, p0, p1, etc.
• ordered set of points: {p0, p1, p2}
• line: between parentheses (l0, l1) l0 and l1 are two distinct points of a given line
• line segment: between square brackets [s0, s1] s0, s1 are the two extreme points of a line segment