Barycentric coordinate system

Last updated
Barycentric coordinates
(
l
1
,
l
2
,
l
3
)
{\displaystyle (\lambda _{1},\lambda _{2},\lambda _{3})}
on an equilateral triangle and on a right triangle. TriangleBarycentricCoordinates.svg
Barycentric coordinates on an equilateral triangle and on a right triangle.
A 3-simplex, with barycentric subdivisions of 1-faces (edges) 2-faces (triangles) and 3-faces (body). Barycentric subdivision of a 3-simplex.svg
A 3-simplex, with barycentric subdivisions of 1-faces (edges) 2-faces (triangles) and 3-faces (body).

In geometry, a barycentric coordinate system is a coordinate system in which the location of a point is specified by reference to a simplex (a triangle for points in a plane, a tetrahedron for points in three-dimensional space, etc.). The barycentric coordinates of a point can be interpreted as masses placed at the vertices of the simplex, such that the point is the center of mass (or barycenter) of these masses. These masses can be zero or negative; they are all positive if and only if the point is inside the simplex.

Contents

Every point has barycentric coordinates, and their sum is never zero. Two tuples of barycentric coordinates specify the same point if and only if they are proportional; that is to say, if one tuple can be obtained by multiplying the elements of the other tuple by the same non-zero number. Therefore, barycentric coordinates are either considered to be defined up to multiplication by a nonzero constant, or normalized for summing to unity.

Barycentric coordinates were introduced by August Möbius in 1827. [1] [2] [3] They are special homogenous coordinates. Barycentric coordinates are strongly related with Cartesian coordinates and, more generally, to affine coordinates (see Affine space § Relationship between barycentric and affine coordinates).

Barycentric coordinates are particularly useful in triangle geometry for studying properties that do not depend on the angles of the triangle, such as Ceva's theorem, Routh's theorem, and Menelaus's theorem. In computer-aided design, they are useful for defining some kinds of Bézier surfaces. [4] [5]

Definition

Let be n + 1 points in a Euclidean space, a flat or an affine space of dimension n that are affinely independent; this means that there is no affine subspace of dimension n - 1 that contains all the points, [6] or, equivalently that the points define a simplex. Given any point there are scalars that are not all zero, such that

for any point O. (As usual, the notation represents the translation vector or free vector that maps the point A to the point B.)

The elements of a (n + 1) tuple that satisfies this equation are called barycentric coordinates of P with respect to The use of colons in the notation of the tuple means that barycentric coordinates are a sort of homogeneous coordinates, that is, the point is not changed if all coordinates are multiplied by the same nonzero constant. Moreover, the barycentric coordinates are also not changed if the auxiliary point O, the origin, is changed.

The barycentric coordinates of a point are unique up to a scaling. That is, two tuples and are barycentric coordinates of the same point if and only if there is a nonzero scalar such that for every i.

In some contexts, it is useful to constrain the barycentric coordinates of a point so that they are unique. This is usually achieved by imposing the condition

or equivalently by dividing every by the sum of all These specific barycentric coordinates are called normalized or absolute barycentric coordinates. [7] Sometimes, they are also called affine coordinates, although this term refers commonly to a slightly different concept.

Sometimes, it is the normalized barycentric coordinates that are called barycentric coordinates. In this case the above defined coordinates are called homogeneous barycentric coordinates.

With above notation, the homogeneous barycentric coordinates of Ai are all zero, except the one of index i. When working over the real numbers (the above definition is also used for affine spaces over an arbitrary field), the points whose all normalized barycentric coordinates are nonnegative form the convex hull of which is the simplex that has these points as its vertices.

With above notation, a tuple such that

does not define any point, but the vector

is independent from the origin O. As the direction of this vector is not changed if all are multiplied by the same scalar, the homogeneous tuple defines a direction of lines, that is a point at infinity. See below for more details.

Relationship with Cartesian or affine coordinates

Barycentric coordinates are strongly related to Cartesian coordinates and, more generally, affine coordinates. For a space of dimension n, these coordinate systems are defined relative to a point O, the origin, whose coordinates are zero, and n points whose coordinates are zero except that of index i that equals one.

A point has coordinates

for such a coordinate system if and only if its normalized barycentric coordinates are

relatively to the points

The main advantage of barycentric coordinate systems is to be symmetric with respect to the n + 1 defining points. They are therefore often useful for studying properties that are symmetric with respect to n + 1 points. On the other hand, distances and angles are difficult to express in general barycentric coordinate systems, and when they are involved, it is generally simpler to use a Cartesian coordinate system.

Relationship with projective coordinates

Homogeneous barycentric coordinates are also strongly related with some projective coordinates. However this relationship is more subtle than in the case of affine coordinates, and, for being clearly understood, requires a coordinate-free definition of the projective completion of an affine space, and a definition of a projective frame.

The projective completion of an affine space of dimension n is a projective space of the same dimension that contains the affine space as the complement of a hyperplane. The projective completion is unique up to an isomorphism. The hyperplane is called the hyperplane at infinity, and its points are the points at infinity of the affine space. [8]

Given a projective space of dimension n, a projective frame is an ordered set of n + 2 points that are not contained in the same hyperplane. A projective frame defines a projective coordinate system such that the coordinates of the (n + 2)th point of the frame are all equal, and, otherwise, all coordinates of the ith point are zero, except the ith one. [8]

When constructing the projective completion from an affine coordinate system, one commonly defines it with respect to a projective frame consisting of the intersections with the hyperplane at infinity of the coordinate axes, the origin of the affine space, and the point that has all its affine coordinates equal to one. This implies that the points at infinity have their last coordinate equal to zero, and that the projective coordinates of a point of the affine space are obtained by completing its affine coordinates by one as (n + 1)th coordinate.

When one has n + 1 points in an affine space that define a barycentric coordinate system, this is another projective frame of the projective completion that is convenient to choose. This frame consists of these points and their centroid, that is the point that has all its barycentric coordinates equal. In this case, the homogeneous barycentric coordinates of a point in the affine space are the same as the projective coordinates of this point. A point is at infinity if and only if the sum of its coordinates is zero. This point is in the direction of the vector defined at the end of § Definition.

Barycentric coordinates on triangles

In the context of a triangle, barycentric coordinates are also known as area coordinates or areal coordinates, because the coordinates of P with respect to triangle ABC are equivalent to the (signed) ratios of the areas of PBC, PCA and PAB to the area of the reference triangle ABC. Areal and trilinear coordinates are used for similar purposes in geometry.

Barycentric or areal coordinates are extremely useful in engineering applications involving triangular subdomains. These make analytic integrals often easier to evaluate, and Gaussian quadrature tables are often presented in terms of area coordinates.

Consider a triangle defined by its three vertices, , and . Each point located inside this triangle can be written as a unique convex combination of the three vertices. In other words, for each there is a unique sequence of three numbers, such that and

The three numbers indicate the "barycentric" or "area" coordinates of the point with respect to the triangle. They are often denoted as instead of . Note that although there are three coordinates, there are only two degrees of freedom, since . Thus every point is uniquely defined by any two of the barycentric coordinates.

To explain why these coordinates are signed ratios of areas, let us assume that we work in the Euclidean space . Here, consider the Cartesian coordinate system and its associated basis, namely . Consider also the positively oriented triangle lying in the plane. It is known that for any basis of and any free vector one has [9]

where stands for the mixed product of these three vectors.

Take where is an arbitrary point in the plane , and remark that

A subtle point regarding our choice of free vectors: is, in fact, the equipollence class of the bound vector .

We have obtained that

where

Given the positive (counterclockwise) orientation of triangle , the denominator of both and is precisely the double of the area of the triangle . Also,

and so the numerators of and are the doubles of the signed areas of triangles and respectively .

Further, we deduce that

which means that the numbers , and are the barycentric coordinates of . Similarly, the third barycentric coordinate reads as

This -letter notation of the barycentric coordinates comes from the fact that the point may be interpreted as the center of mass for the masses , , which are located in , and .

Switching back and forth between the barycentric coordinates and other coordinate systems makes some problems much easier to solve.

Conversion between barycentric and Cartesian coordinates

Edge approach

Given a point in a triangle's plane one can obtain the barycentric coordinates , and from the Cartesian coordinates or vice versa.

We can write the Cartesian coordinates of the point in terms of the Cartesian components of the triangle vertices , , where and in terms of the barycentric coordinates of as

That is, the Cartesian coordinates of any point are a weighted average of the Cartesian coordinates of the triangle's vertices, with the weights being the point's barycentric coordinates summing to unity.

To find the reverse transformation, from Cartesian coordinates to barycentric coordinates, we first substitute into the above to obtain

Rearranging, this is

This linear transformation may be written more succinctly as

where is the vector of the first two barycentric coordinates, is the vector of Cartesian coordinates, and is a matrix given by

Now the matrix is invertible, since and are linearly independent (if this were not the case, then , , and would be collinear and would not form a triangle). Thus, we can rearrange the above equation to get

Finding the barycentric coordinates has thus been reduced to finding the 2×2 inverse matrix of , an easy problem.

Explicitly, the formulae for the barycentric coordinates of point in terms of its Cartesian coordinates (x, y) and in terms of the Cartesian coordinates of the triangle's vertices are:

When understanding the last line of equation, note the identity .

Vertex approach

Another way to solve the conversion from Cartesian to barycentric coordinates is to write the relation in the matrix form

with and i.e.

To get the unique normalized solution we need to add the condition . The barycentric coordinates are thus the solution of the linear system

which is

where

is twice the signed area of the triangle. The area interpretation of the barycentric coordinates can be recovered by applying Cramer's rule to this linear system.

Conversion between barycentric and trilinear coordinates

A point with trilinear coordinates x : y : z has barycentric coordinates ax : by : cz where a, b, c are the side lengths of the triangle. Conversely, a point with barycentrics has trilinears

Equations in barycentric coordinates

The three sides a, b, c respectively have equations [10]

The equation of a triangle's Euler line is [10]

Using the previously given conversion between barycentric and trilinear coordinates, the various other equations given in Trilinear coordinates#Formulas can be rewritten in terms of barycentric coordinates.

Distance between points

The displacement vector of two normalized points and is [11]

The distance between and , or the length of the displacement vector is [10] [11]

where a, b, c are the sidelengths of the triangle. The equivalence of the last two expressions follows from which holds because

The barycentric coordinates of a point can be calculated based on distances di to the three triangle vertices by solving the equation

Applications

Two solutions to the 8, 5 and 3 L water pouring puzzle using a barycentric plot. The yellow area denotes combinations achievable with the jugs. The solid red and dashed blue paths show pourable transitions. When a vertex lands on the dotted triangle, 4 L has been measured. 3 jugs puzzle barycentric plot.svg
Two solutions to the 8, 5 and 3L water pouring puzzle using a barycentric plot. The yellow area denotes combinations achievable with the jugs. The solid red and dashed blue paths show pourable transitions. When a vertex lands on the dotted triangle, 4L has been measured.

Determining location with respect to a triangle

Although barycentric coordinates are most commonly used to handle points inside a triangle, they can also be used to describe a point outside the triangle. If the point is not inside the triangle, then we can still use the formulas above to compute the barycentric coordinates. However, since the point is outside the triangle, at least one of the coordinates will violate our original assumption that . In fact, given any point in cartesian coordinates, we can use this fact to determine where this point is with respect to a triangle.

If a point lies in the interior of the triangle, all of the Barycentric coordinates lie in the open interval If a point lies on an edge of the triangle but not at a vertex, one of the area coordinates (the one associated with the opposite vertex) is zero, while the other two lie in the open interval If the point lies on a vertex, the coordinate associated with that vertex equals 1 and the others equal zero. Finally, if the point lies outside the triangle at least one coordinate is negative.

Summarizing,

Point lies inside the triangle if and only if .

lies on the edge or corner of the triangle if and .

Otherwise, lies outside the triangle.

In particular, if a point lies on the far side of a line the barycentric coordinate of the point in the triangle that is not on the line will have a negative value.

Interpolation on a triangular unstructured grid

Surface (upper part) obtained from linear interpolation over a given triangular grid (lower part) in the x,y plane. The surface approximates a function z=f(x,y), given only the values of f on the grid's vertices. Piecewise linear function2D.svg
Surface (upper part) obtained from linear interpolation over a given triangular grid (lower part) in the x,y plane. The surface approximates a function z=f(x,y), given only the values of f on the grid's vertices.

If are known quantities, but the values of inside the triangle defined by is unknown, they can be approximated using linear interpolation. Barycentric coordinates provide a convenient way to compute this interpolation. If is a point inside the triangle with barycentric coordinates , , , then

In general, given any unstructured grid or polygon mesh, this kind of technique can be used to approximate the value of at all points, as long as the function's value is known at all vertices of the mesh. In this case, we have many triangles, each corresponding to a different part of the space. To interpolate a function at a point , first a triangle must be found that contains . To do so, is transformed into the barycentric coordinates of each triangle. If some triangle is found such that the coordinates satisfy , then the point lies in that triangle or on its edge (explained in the previous section). Then the value of can be interpolated as described above.

These methods have many applications, such as the finite element method (FEM).

Integration over a triangle or tetrahedron

The integral of a function over the domain of the triangle can be annoying to compute in a cartesian coordinate system. One generally has to split the triangle up into two halves, and great messiness follows. Instead, it is often easier to make a change of variables to any two barycentric coordinates, e.g. . Under this change of variables,

where is the area of the triangle. This result follows from the fact that a rectangle in barycentric coordinates corresponds to a quadrilateral in cartesian coordinates, and the ratio of the areas of the corresponding shapes in the corresponding coordinate systems is given by . Similarly, for integration over a tetrahedron, instead of breaking up the integral into two or three separate pieces, one could switch to 3D tetrahedral coordinates under the change of variables

where is the volume of the tetrahedron.

Examples of special points

In the homogeneous barycentric coordinate system defined with respect to a triangle , the following statements about special points of hold.

The three vertices , , and have coordinates [10]

The centroid has coordinates [10]

If , , are the edge lengths , , respectively, , , are the angle measures , , and respectively, and is the semiperimeter of , then the following statements about special points of hold in addition.

The circumcenter has coordinates [10] [11] [12] [13]

The orthocenter has coordinates [10] [11]

The incenter has coordinates [11] [14]

The excenters have coordinates [14]

The nine-point center has coordinates [10] [14]

The Gergonne point has coordinates .

The Nagel point has coordinates .

The symmedian point has coordinates . [13]

Barycentric coordinates on tetrahedra

Barycentric coordinates may be easily extended to three dimensions. The 3D simplex is a tetrahedron, a polyhedron having four triangular faces and four vertices. Once again, the four barycentric coordinates are defined so that the first vertex maps to barycentric coordinates , , etc.

This is again a linear transformation, and we may extend the above procedure for triangles to find the barycentric coordinates of a point with respect to a tetrahedron:

where is now a 3×3 matrix:

and with the corresponding Cartesian coordinates:

Once again, the problem of finding the barycentric coordinates has been reduced to inverting a 3×3 matrix.

3D barycentric coordinates may be used to decide if a point lies inside a tetrahedral volume, and to interpolate a function within a tetrahedral mesh, in an analogous manner to the 2D procedure. Tetrahedral meshes are often used in finite element analysis because the use of barycentric coordinates can greatly simplify 3D interpolation.

Generalized barycentric coordinates

Barycentric coordinates of a point that are defined with respect to a finite set of k points instead of a simplex are called generalized barycentric coordinates. For these, the equation

is still required to hold. [15] Usually one uses normalized coordinates, . As for the case of a simplex, the points with nonnegative normalized generalized coordinates () form the convex hull of x1, ..., xn. If there are more points than in a full simplex () the generalized barycentric coordinates of a point are not unique, as the defining linear system (here for n=2)

is underdetermined. The simplest example is a quadrilateral in the plane. Various kinds of additional restrictions can be used to define unique barycentric coordinates. [16]

Abstraction

More abstractly, generalized barycentric coordinates express a convex polytope with n vertices, regardless of dimension, as the image of the standard -simplex, which has n vertices – the map is onto: The map is one-to-one if and only if the polytope is a simplex, in which case the map is an isomorphism; this corresponds to a point not having unique generalized barycentric coordinates except when P is a simplex.

Dual to generalized barycentric coordinates are slack variables, which measure by how much margin a point satisfies the linear constraints, and gives an embedding into the f-orthant, where f is the number of faces (dual to the vertices). This map is one-to-one (slack variables are uniquely determined) but not onto (not all combinations can be realized).

This use of the standard -simplex and f-orthant as standard objects that map to a polytope or that a polytope maps into should be contrasted with the use of the standard vector space as the standard object for vector spaces, and the standard affine hyperplane as the standard object for affine spaces, where in each case choosing a linear basis or affine basis provides an isomorphism, allowing all vector spaces and affine spaces to be thought of in terms of these standard spaces, rather than an onto or one-to-one map (not every polytope is a simplex). Further, the n-orthant is the standard object that maps to cones.

Applications

Barycentric coordinates are used for blending three colors over a triangular region evenly in computer graphics. Barycentric RGB.svg
Barycentric coordinates are used for blending three colors over a triangular region evenly in computer graphics.

Generalized barycentric coordinates have applications in computer graphics and more specifically in geometric modelling. [17] Often, a three-dimensional model can be approximated by a polyhedron such that the generalized barycentric coordinates with respect to that polyhedron have a geometric meaning. In this way, the processing of the model can be simplified by using these meaningful coordinates. Barycentric coordinates are also used in geophysics. [18]

See also

Related Research Articles

<span class="mw-page-title-main">Euclidean space</span> Fundamental space of geometry

Euclidean space is the fundamental space of geometry, intended to represent physical space. Originally, in Euclid's Elements, it was the three-dimensional space of Euclidean geometry, but in modern mathematics there are Euclidean spaces of any positive integer dimension n, which are called Euclidean n-spaces when one wants to specify their dimension. For n equal to one or two, they are commonly called respectively Euclidean lines and Euclidean planes. The qualifier "Euclidean" is used to distinguish Euclidean spaces from other spaces that were later considered in physics and modern mathematics.

In mathematics, and more specifically in linear algebra, a linear map is a mapping between two vector spaces that preserves the operations of vector addition and scalar multiplication. The same names and the same definition are also used for the more general case of modules over a ring; see Module homomorphism.

<span class="mw-page-title-main">Lorentz transformation</span> Family of linear transformations

In physics, the Lorentz transformations are a six-parameter family of linear transformations from a coordinate frame in spacetime to another frame that moves at a constant velocity relative to the former. The respective inverse transformation is then parameterized by the negative of this velocity. The transformations are named after the Dutch physicist Hendrik Lorentz.

<span class="mw-page-title-main">Affine transformation</span> Geometric transformation that preserves lines but not angles nor the origin

In Euclidean geometry, an affine transformation or affinity is a geometric transformation that preserves lines and parallelism, but not necessarily Euclidean distances and angles.

In particle physics, the Dirac equation is a relativistic wave equation derived by British physicist Paul Dirac in 1928. In its free form, or including electromagnetic interactions, it describes all spin-12 massive particles, called "Dirac particles", such as electrons and quarks for which parity is a symmetry. It is consistent with both the principles of quantum mechanics and the theory of special relativity, and was the first theory to account fully for special relativity in the context of quantum mechanics. It was validated by accounting for the fine structure of the hydrogen spectrum in a completely rigorous way.

<span class="mw-page-title-main">Simplex</span> Multi-dimensional generalization of triangle

In geometry, a simplex is a generalization of the notion of a triangle or tetrahedron to arbitrary dimensions. The simplex is so-named because it represents the simplest possible polytope in any given dimension. For example,

<span class="mw-page-title-main">Multivariate normal distribution</span> Generalization of the one-dimensional normal distribution to higher dimensions

In probability theory and statistics, the multivariate normal distribution, multivariate Gaussian distribution, or joint normal distribution is a generalization of the one-dimensional (univariate) normal distribution to higher dimensions. One definition is that a random vector is said to be k-variate normally distributed if every linear combination of its k components has a univariate normal distribution. Its importance derives mainly from the multivariate central limit theorem. The multivariate normal distribution is often used to describe, at least approximately, any set of (possibly) correlated real-valued random variables, each of which clusters around a mean value.

<span class="mw-page-title-main">Ellipsoid</span> Quadric surface that looks like a deformed sphere

An ellipsoid is a surface that can be obtained from a sphere by deforming it by means of directional scalings, or more generally, of an affine transformation.

In mathematics, a quadric or quadric surface (quadric hypersurface in higher dimensions), is a generalization of conic sections (ellipses, parabolas, and hyperbolas). It is a hypersurface (of dimension D) in a (D + 1)-dimensional space, and it is defined as the zero set of an irreducible polynomial of degree two in D + 1 variables; for example, D = 1 in the case of conic sections. When the defining polynomial is not absolutely irreducible, the zero set is generally not considered a quadric, although it is often called a degenerate quadric or a reducible quadric.

In the mathematical field of differential geometry, a metric tensor is an additional structure on a manifold M that allows defining distances and angles, just as the inner product on a Euclidean space allows defining distances and angles there. More precisely, a metric tensor at a point p of M is a bilinear form defined on the tangent space at p, and a metric field on M consists of a metric tensor at each point p of M that varies smoothly with p.

<span class="mw-page-title-main">Four-vector</span> 4-dimensional vector in relativity

In special relativity, a four-vector is an object with four components, which transform in a specific way under Lorentz transformations. Specifically, a four-vector is an element of a four-dimensional vector space considered as a representation space of the standard representation of the Lorentz group, the representation. It differs from a Euclidean vector in how its magnitude is determined. The transformations that preserve this magnitude are the Lorentz transformations, which include spatial rotations and boosts.

<span class="mw-page-title-main">Homogeneous coordinates</span> Coordinate system used in projective geometry

In mathematics, homogeneous coordinates or projective coordinates, introduced by August Ferdinand Möbius in his 1827 work Der barycentrische Calcul, are a system of coordinates used in projective geometry, just as Cartesian coordinates are used in Euclidean geometry. They have the advantage that the coordinates of points, including points at infinity, can be represented using finite coordinates. Formulas involving homogeneous coordinates are often simpler and more symmetric than their Cartesian counterparts. Homogeneous coordinates have a range of applications, including computer graphics and 3D computer vision, where they allow affine transformations and, in general, projective transformations to be easily represented by a matrix. They are also used in fundamental elliptic curve cryptography algorithms.

<span class="mw-page-title-main">Affine space</span> Euclidean space without distance and angles

In mathematics, an affine space is a geometric structure that generalizes some of the properties of Euclidean spaces in such a way that these are independent of the concepts of distance and measure of angles, keeping only the properties related to parallelism and ratio of lengths for parallel line segments. Affine space is the setting for affine geometry.

In mathematics, the covariant derivative is a way of specifying a derivative along tangent vectors of a manifold. Alternatively, the covariant derivative is a way of introducing and working with a connection on a manifold by means of a differential operator, to be contrasted with the approach given by a principal connection on the frame bundle – see affine connection. In the special case of a manifold isometrically embedded into a higher-dimensional Euclidean space, the covariant derivative can be viewed as the orthogonal projection of the Euclidean directional derivative onto the manifold's tangent space. In this case the Euclidean derivative is broken into two parts, the extrinsic normal component and the intrinsic covariant derivative component.

In physics, a wave vector is a vector used in describing a wave, with a typical unit being cycle per metre. It has a magnitude and direction. Its magnitude is the wavenumber of the wave, and its direction is perpendicular to the wavefront. In isotropic media, this is also the direction of wave propagation.

<span class="mw-page-title-main">Curvilinear coordinates</span> Coordinate system whose directions vary in space

In geometry, curvilinear coordinates are a coordinate system for Euclidean space in which the coordinate lines may be curved. These coordinates may be derived from a set of Cartesian coordinates by using a transformation that is locally invertible at each point. This means that one can convert a point given in a Cartesian coordinate system to its curvilinear coordinates and back. The name curvilinear coordinates, coined by the French mathematician Lamé, derives from the fact that the coordinate surfaces of the curvilinear systems are curved.

<span class="mw-page-title-main">Line (geometry)</span> Straight figure with zero width and depth

In geometry, a straight line, usually abbreviated line, is an infinitely long object with no width, depth, or curvature, an idealization of such physical objects as a straightedge, a taut string, or a ray of light. Lines are spaces of dimension one, which may be embedded in spaces of dimension two, three, or higher. The word line may also refer, in everyday life, to a line segment, which is a part of a line delimited by two points.

In linear algebra, a generalized eigenvector of an matrix is a vector which satisfies certain criteria which are more relaxed than those for an (ordinary) eigenvector.

In geometry, the circumscribed circle or circumcircle of a triangle is a circle that passes through all three vertices. The center of this circle is called the circumcenter of the triangle, and its radius is called the circumradius. The circumcenter is the point of intersection between the three perpendicular bisectors of the triangle's sides, and is a triangle center.

<span class="mw-page-title-main">Trilinear coordinates</span> Coordinate system based on distances from the sidelines of a given triangle

In geometry, the trilinear coordinatesx : y : z of a point relative to a given triangle describe the relative directed distances from the three sidelines of the triangle. Trilinear coordinates are an example of homogeneous coordinates. The ratio x : y is the ratio of the perpendicular distances from the point to the sides opposite vertices A and B respectively; the ratio y : z is the ratio of the perpendicular distances from the point to the sidelines opposite vertices B and C respectively; and likewise for z : x and vertices C and A.

References

  1. Möbius, August Ferdinand (1827). Der barycentrische Calcul. Leipzig: J.A. Barth.
    Reprinted in Baltzer, Richard, ed. (1885). "Der barycentrische Calcul". August Ferdinand Möbius Gesammelte Werke. Vol. 1. Leipzig: S. Hirzel. pp. 1–388.
  2. Max Koecher, Aloys Krieg: Ebene Geometrie. Springer-Verlag, Berlin 2007, ISBN   978-3-540-49328-0, S. 76.
  3. Hille, Einar. "Analytic Function Theory, Volume I", Second edition, fifth printing. Chelsea Publishing Company, New York, 1982, ISBN   0-8284-0269-8, page 33, footnote 1
  4. Josef Hoschek, Dieter Lasser: Grundlagen der geometrischen Datenverarbeitung. Teubner-Verlag, 1989, ISBN   3-519-02962-6, S. 243.
  5. Gerald Farin: Curves and Surfaces for Computer Aided Geometric Design. Academic Press, 1990, ISBN   0-12-249051-7, S. 20.
  6. Reventós Tarrida, Agustí. "Affine Maps, Euclidean Motions and Quadrics". Springer, 2011, ISBN   978-0-85729-709-9, page 11
  7. Deaux, Roland. "Introduction to The Geometry of Complex Numbers". Dover Publications, Inc., Mineola, 2008, ISBN   978-0-486-46629-3, page 61
  8. 1 2 Berger, Marcel (1987), Geometry I, Berlin: Springer, ISBN   3-540-11658-3
  9. Danby, J.M.A. "Fundamentals of Celestial Mechanics", Second edition, revised & enlarged, fifth printing. Willmann-Bell, Inc., Richmond, 2003, ISBN   0-943396-20-4, page 26, problem 11
  10. 1 2 3 4 5 6 7 8 Scott, J. A. "Some examples of the use of areal coordinates in triangle geometry", Mathematical Gazette 83, November 1999, 472–477.
  11. 1 2 3 4 5 Schindler, Max; Chen, Evan (July 13, 2012). "Barycentric Coordinates in Olympiad Geometry" (PDF). Retrieved 14 January 2016.
  12. Clark Kimberling's Encyclopedia of Triangles "Encyclopedia of Triangle Centers". Archived from the original on 2012-04-19. Retrieved 2012-06-02.
  13. 1 2 Wolfram page on barycentric coordinates
  14. 1 2 3 Dasari Naga, Vijay Krishna, "On the Feuerbach triangle", Forum Geometricorum 17 (2017), 289–300: p. 289. http://forumgeom.fau.edu/FG2017volume17/FG201731.pdf
  15. Meyer, Mark; Barr, Alan; Lee, Haeyoung; Desbrun, Mathieu (6 April 2012). "Generalized Barycentric Coordinates on Irregular Polygons" (PDF). Journal of Graphics Tools. 7: 13–22. doi:10.1080/10867651.2002.10487551. S2CID   13370238.
  16. Floater, Michael S. (2015). "Generalized barycentric coordinates and applications *" (PDF). Acta Numerica. 24: 161–214. doi:10.1017/S0962492914000129. ISSN   0962-4929. S2CID   62811364.
  17. Floater, Michael S. (2003). "Mean value coordinates". Computer Aided Geometric Design. 20 (1): 19–27. doi:10.1016/S0167-8396(03)00002-5.
  18. ONUFRIEV, VG; DENISIK, SA; FERRONSKY, VI, BARICENTRIC MODELS IN ISOTOPE STUDIES OF NATURAL-WATERS. NUCLEAR GEOPHYSICS, 4, 111-117 (1990)