CGAL 5.0.2 - 2D Generalized Barycentric Coordinates
CGAL::Barycentric_coordinates Namespace Reference

The namespace Barycentric_coordinates contains implementations of all generalized barycentric coordinates: 2D, 3D, related enumerations, and so on. More...

## Classes

class  Discrete_harmonic_2
The class Discrete_harmonic_2 implements 2D discrete harmonic coordinates ( [2], [8], [1] ). More...

class  Generalized_barycentric_coordinates_2
The class Generalized_barycentric_coordinates_2 implements generalized barycentric coordinates along the polygon's boundary and provides a common interface for all coordinate classes. More...

class  Mean_value_2
The class Mean_value_2 implements 2D mean value coordinates ( [5], [2], [3] ). More...

class  Segment_coordinates_2
The class Segment_coordinates_2 implements barycentric coordinates with respect to an arbitrary non-degenerate segment along an arbitrary line in the plane. More...

class  Triangle_coordinates_2
The class Triangle_coordinates_2 implements barycentric coordinates ( [1], [2] ) with respect to an arbitrary non-degenerate triangle in the plane. More...

class  Wachspress_2
The class Wachspress_2 implements 2D Wachspress coordinates ( [2], [6], [9] ). More...

## Locations of a Query Point

enum  Query_point_location {
UNSPECIFIED_LOCATION, ON_VERTEX, ON_BOUNDARY, ON_BOUNDED_SIDE,
ON_UNBOUNDED_SIDE
}
Query_point_location is enumeration with possible locations of a query point provided by the user. More...

## Types of an Algorithm

enum  Type_of_algorithm { PRECISE, FAST }
Type_of_algorithm is enumeration with possible algorithms to compute coordinates. More...

## Definition

The namespace Barycentric_coordinates contains implementations of all generalized barycentric coordinates: 2D, 3D, related enumerations, and so on.

## ◆ Query_point_location

Query_point_location is enumeration with possible locations of a query point provided by the user.

Enumerator
UNSPECIFIED_LOCATION

Location is not known apriori and is defined automatically by the algorithm.

ON_VERTEX

Query point is located at one of the polygon's vertices.

ON_BOUNDARY

Query point is located on the boundary of the polygon.

ON_BOUNDED_SIDE

Query point is located inside the polygon, excluding the boundary.

ON_UNBOUNDED_SIDE

Query point is located outside the polygon, excluding the boundary.

## ◆ Type_of_algorithm

Type_of_algorithm is enumeration with possible algorithms to compute coordinates.

Enumerator
PRECISE

A default slow algorithm, which is as precise as possible.

FAST

A fast algorithm, which is less precise but much faster.