Affine Geometry - Applications
Let and be two triangles in an affine plane. If the lines , , are parallel (or coincide), then the intersection points:
are collinear (lie on a line) or some of these intersection points are undefined (lines are parallel).
In the projective completion, this becomes: if lines through corresponding vertices are concurrent, then intersection points of corresponding sides are collinear.
Desargues' theorem is fundamental in the axiomatic development of geometry. It holds in affine and projective geometries over any field, but fails in some non-Desarguesian planes. The theorem reveals deep connections between incidence properties and algebraic structure.
The proof in affine geometry uses vector methods. Represent points using position vectors from a fixed origin, and verify the collinearity condition algebraically. The assumption that , , are parallel translates to specific relationships among the position vectors.
Desargues' theorem underlies the technique of perspective drawing. When an artist draws two triangles in perspective (corresponding to two triangular objects at different depths), the lines connecting corresponding vertices converge at a "vanishing point." Desargues ensures that certain intersection points align, maintaining geometric consistency.
This principle guides computer graphics algorithms for rendering 3D scenes onto 2D screens.
A related result concerns affine ratios:
Points , , on sides , , of triangle are collinear if and only if:
where ratios are signed (positive if same direction, negative if opposite).
This theorem uses only affine notions—ratios of signed lengths along lines—making it an affine invariant. The condition is preserved under affine transformations.
For collinear points , , with between and , the affine ratio is:
This ratio is preserved by affine transformations, making it a fundamental affine invariant. Unlike the cross-ratio (which requires four points), the affine ratio uses only three.
Applications of affine geometry extend to optimization and convexity theory. The Hahn-Banach theorem in functional analysis has geometric content: separating convex sets with hyperplanes. In finite dimensions, this reduces to affine geometry—given disjoint convex sets and , there exists a hyperplane separating them.
Affine geometry provides the natural setting for:
- Convex analysis: Convex sets and functions defined without reference to metrics
- Linear programming: Feasible regions are convex polyhedra in affine space
- Affine algebraic varieties: Zero sets of polynomials studied up to affine coordinate changes
- Affine differential geometry: Intrinsic geometry of surfaces without assuming a Riemannian metric
In computer science, affine transformations underlie computational geometry algorithms. Many problems—such as convex hull computation, line segment intersection, and point location—rely only on affine properties. This robustness makes algorithms work correctly under coordinate changes and avoids numerical issues with distances and angles.