Fact-checked by Grok 2 weeks ago

Collinearity

Collinearity is a geometric and algebraic property referring to the alignment of points, lines, or vectors such that they lie on or are parallel to a single straight line. In geometry, three or more points are defined as collinear if they all reside on the same straight line, a condition that can be verified through various mathematical tests, such as the vanishing of the area of the triangle they form or the proportionality of direction vectors between them.^[1] This concept extends to higher dimensions, where points (x_1, y_1, z_1), (x_2, y_2, z_2), and (x_3, y_3, z_3) are collinear if the ratios (x_2 - x_1) : (y_2 - y_1) : (z_2 - z_1) = (x_3 - x_1) : (y_3 - y_1) : (z_3 - z_1) hold, ensuring no deviation from linearity.^[1] In linear algebra, collinearity applies to vectors, where two or more vectors are collinear if one can be expressed as a scalar multiple of another, implying they share the same or opposite direction without spanning additional dimensions.^[1] This property is crucial in understanding linear dependence, as collinear vectors do not contribute new information to a basis and can lead to rank-deficient matrices when combined. For instance, the cross product of vectors from a point to two others being zero, ( \mathbf{x_2} - \mathbf{x_1} ) \times ( \mathbf{x_3} - \mathbf{x_1} ) = \mathbf{0}, confirms collinearity in vector space.^[1] Applications appear in computer graphics for rendering straight-line paths, in physics for modeling particle trajectories, and in projective geometry where collinearity preserves under transformations like perspective projections.^[2] Beyond pure mathematics, collinearity manifests in statistics as multicollinearity, a phenomenon in multiple linear regression where two or more predictor variables exhibit high linear correlation, inflating the variance of coefficient estimates and complicating model interpretation.^[3] This issue arises when independent variables are not truly independent, such as including both height and weight in a model predicting body mass index, leading to unstable predictions and overstated standard errors.^[3] Detection methods include examining correlation matrices or computing variance inflation factors (VIF), where VIF > 10 often signals problematic multicollinearity, prompting remedies like variable selection or principal component analysis.^[4] While perfect collinearity renders regression coefficients undefined due to matrix singularity, moderate cases degrade inferential reliability without biasing point estimates.^[5]

Fundamentals

Definition and Properties

In geometry and linear algebra, collinearity describes the alignment of three or more points along a single straight line. Formally, a set of points P_1, P_2, \dots, P_k in an affine space are collinear if they all lie on the same line, which is equivalent to the vectors connecting them—such as \overrightarrow{P_i P_j} for i \neq j—being linearly dependent.^[6] This linear dependence implies that no two such vectors are linearly independent, ensuring the points do not deviate from the line. A key property of collinear points is that the line segment between any two distinct points A and B contains all intermediate points C such that C lies between A and B. This betweenness relation holds if A, B, and C are collinear and the distance AB = AC + CB.^[7] Additionally, affine combinations of collinear points remain on the same line: for scalars \lambda_1, \dots, \lambda_k summing to 1, the point \sum \lambda_i P_i lies within the affine hull of the set, preserving collinearity.^[6] In vector terms, three points A, B, and C are collinear if the vector \overrightarrow{AB} is a scalar multiple of \overrightarrow{AC}, that is, \overrightarrow{AB} = k \overrightarrow{AC} for some scalar k \in \mathbb{R}.^[6] This formulation captures the directional alignment, where k determines the relative position (e.g., $0 < k < 1 places B between A and C). Collinear points in an n-dimensional space span a one-dimensional affine subspace, meaning their affine hull is a line, regardless of the ambient dimension.^[6] This low-dimensional span underscores collinearity's role as a degenerate case in higher-dimensional geometry, where the points do not generate full rank.

Collinear Points in Euclidean Space

In Euclidean space, collinear points are defined as a set of three or more points that lie on a single straight line. This property holds regardless of the dimension of the space, as the points share a common linear path without deviation. Two points are always collinear by definition, as they uniquely determine a line, but the concept becomes meaningful for three or more points, where non-collinearity would imply they span a higher-dimensional subspace.^[1] A key characterization of collinear points in Euclidean space is that any three such points form a degenerate triangle with zero area. The area of the triangle formed by points A(x_1, y_1), B(x_2, y_2), and C(x_3, y_3) in the plane is given by

\frac{1}{2} \left| x_1(y_2 - y_3) + x_2(y_3 - y_1) + x_3(y_1 - y_2) \right| = 0,

indicating the points do not enclose a region. Similarly, the distances between collinear points satisfy the triangle inequality with equality when one point lies between the other two: for points A, B, and C with B intermediate, d(A, C) = d(A, B) + d(B, C). Equality holds if and only if the points are collinear in this order, reflecting the straight-line path without deviation.^[1]^[8] At any intermediate point among collinear points, the angle formed is exactly 180 degrees (or \pi radians), forming a straight angle that aligns the segments without bend. This property underscores the linearity, as any deviation would introduce an angle less than 180 degrees, violating collinearity. In vector terms, the direction vectors between consecutive points are parallel and oriented consistently.^[1] This notion extends naturally to higher dimensions, such as three-dimensional Euclidean space, where collinear points still lie on a unique line. In \mathbb{R}^3, such a line intersects any plane at exactly one point unless the line is parallel to the plane, in which case it either lies entirely within the plane or does not intersect it. This intersection behavior preserves the one-dimensional nature of the point set amid the three-dimensional ambient space.^[9] The term "collinearity" emerged in 19th-century geometry texts, building directly on Euclid's postulates of points and lines from Elements (circa 300 BCE), as mathematicians formalized projective and Euclidean properties amid the rise of non-Euclidean geometries.

Geometric Configurations

Planar Figures

In planar geometry, collinearity often induces degeneracies in standard figures, reducing their dimensionality or altering key properties such as area or convexity. For instance, when points intended to form a polygon lie on a straight line, the figure collapses, leading to zero enclosed area and violating typical non-degeneracy assumptions in Euclidean constructions.^[1] For triangles, collinearity of the three vertices results in a degenerate figure with zero area, as the height relative to any base becomes null, effectively reducing the triangle to a line segment.^[1] Menelaus' theorem further illustrates collinearity in this context by relating a transversal line to points on the sides of a triangle: if points D, E, F lie on sides BC, CA, AB respectively, and the transversal intersects these sides, the points are collinear if and only if the product of signed segment ratios satisfies (AF/FB) × (BD/DC) × (CE/EA) = -1.^[10] In quadrilaterals, the presence of three collinear vertices causes the figure to degenerate into a triangle, as the fourth vertex defines the only non-collinear point, collapsing one side into a point along the line.^[11] Varignon's theorem states that the midpoints of the sides of any quadrilateral form a parallelogram, but this parallelogram degenerates into a line segment when all four vertices of the quadrilateral are collinear, highlighting how collinearity disrupts the parallelogram's properties.^[12] For conic sections, five collinear points cannot lie on a non-degenerate conic, as any conic passing through five points with no three collinear is unique and irreducible, but collinearity of three or more forces degeneracy into a pair of lines or a repeated line.^[13] Pascal's theorem exemplifies collinearity in conic-related figures: for a hexagon inscribed in a conic, the intersection points of the three pairs of opposite sides are collinear, providing a projective criterion for the vertices to lie on a conic (possibly degenerate).^[14] This result is dual to Brianchon's theorem, which concerns concurrency in circumscribed hexagons, underscoring the interplay between collinearity and conic tangency in planar projective geometry.^[15]

Spatial Figures

In three-dimensional Euclidean space, collinearity among the generators of a cone—straight lines emanating from the apex to points on the base curve—leads to degeneracy when all such lines coincide along a single direction, reducing the cone to a line rather than a surface of revolution or general conical solid. This occurs if the base points are collinear with the apex, collapsing the structure into a one-dimensional object with zero lateral area and volume. Similarly, cross-sections of the cone degenerate into lines or points when the intersecting plane aligns the apex with collinear base points, resulting in planar slices that lack the typical elliptical, parabolic, or hyperbolic forms. For tetrahedrons, the simplest polyhedral spatial figure with four vertices, collinearity of all four vertices produces a degenerate case where the figure flattens to a line segment, yielding zero volume. In this configuration, the scalar triple product defining the signed volume vanishes, as the vectors from one vertex to the others lie along the same line. The Cayley-Menger determinant, which computes the squared volume from pairwise distances, also equals zero under collinearity, confirming the degeneracy since the determinant of the bordered distance matrix reduces to that of a lower-dimensional simplex.^[16] In general polyhedra, collinear vertices along what should form an edge or face boundary cause structural degeneracies, such as flat faces where three or more vertices lie on a straight line, reducing the face to a degenerate polygon with zero area. This leads to non-convex or flattened polyhedra where adjacent faces may coplanar, violating the strict convexity assumptions of classical polyhedral theory. Such degeneracies impact the Euler characteristic χ = V - E + F, which equals 2 for convex 3D polyhedra but drops to 1 for fully planar degenerate cases resembling polygonal disks, reflecting the topological shift from a spherical surface to a planar boundary.^[17]^[18] In modern computational geometry, particularly post-2000 developments in 3D mesh generation, collinearity poses challenges in creating robust tetrahedral meshes for finite element analysis and simulations, as it produces slivers—degenerate tetrahedra with near-zero volume and poor aspect ratios. Algorithms like Delaunay refinement handle this by detecting collinear points as non-generic inputs, employing symbolic perturbation to resolve ambiguities and ensure unique triangulations, or inserting Steiner points to avoid infinite radius-edge ratios in degenerate simplices. These techniques, emphasized in refinement methods for piecewise linear complexes, maintain mesh quality by bounding local feature sizes and removing slivers, enabling reliable 3D models in applications like computer-aided design and scientific visualization.^[19]

Algebraic Methods

Coordinate Geometry Tests

In two-dimensional coordinate geometry, collinearity of three points A(x_1, y_1), B(x_2, y_2), and C(x_3, y_3) can be tested by verifying whether the area of the triangle formed by these points is zero. This area is given by half the absolute value of the determinant

\begin{vmatrix} x_1 & y_1 & 1 \\ x_2 & y_2 & 1 \\ x_3 & y_3 & 1 \end{vmatrix},

so the points are collinear if the determinant equals zero.^[1] This condition arises because the determinant computes twice the signed area of the triangle; a zero value indicates the points lie on a straight line.^[20] An alternative test uses slopes: the points are collinear if the slope between A and B equals the slope between A and C, expressed as

\frac{y_2 - y_1}{x_2 - x_1} = \frac{y_3 - y_1}{x_3 - x_1},

assuming x_2 \neq x_1 and x_3 \neq x_1. For vertical lines (where denominators are zero), collinearity holds if x_1 = x_2 = x_3.^[21] In n-dimensional space, a set of points \mathbf{p}_1, \mathbf{p}_2, \dots, \mathbf{p}_k \in \mathbb{R}^n (with k > 2) is collinear if the differences \mathbf{p}_i - \mathbf{p}_1 for i = 2, \dots, k lie along a single direction, meaning the rank of the n \times (k-1) matrix formed by these difference vectors as columns is 1.^[1] For numerical stability in computational implementations, the determinant method is generally preferred over the slope method, as the latter involves division that can amplify errors when coordinates are close or differences are small.^[22]

Distance-Based Tests

Distance-based tests for collinearity rely on the pairwise distances between points, making them applicable in metric spaces where coordinate systems are unavailable or unnecessary. These methods leverage properties of Euclidean distances to detect whether points lie on a straight line, often through equality conditions in geometric inequalities or determinant conditions on distance matrices. Such tests are particularly valuable in distance geometry and computational applications where only distance measurements are provided. For three points A, B, and C, collinearity holds if and only if the triangle inequality achieves equality, meaning the distance between the two farthest points equals the sum of the distances to the third point. Specifically, assuming without loss of generality that d(A,C) is the largest distance, the points are collinear if d(A,C) = d(A,B) + d(B,C), indicating that B lies between A and C on the line; analogous conditions apply for other orderings, such as d(A,B) = |d(A,C) - d(B,C)| if B extends beyond C from A. This condition arises directly from the degeneracy of the triangle formed by the points, where the area is zero.^[8] To generalize to n > 3 points, the Cayley-Menger determinant provides a comprehensive test based on the squared distances. The Cayley-Menger matrix for n+1 points is an (n+2) \times (n+2) symmetric matrix with the top-left entry 0, the first row and column (except the diagonal) filled with 1's, the diagonal (from position 2 to n+2) set to 0, and the remaining entries d_{ij}^2 for the squared distances between points i and j. Collinearity of the points manifests as a rank deficiency in this matrix, specifically rank at most 3 (corresponding to embedding in 1-dimensional affine space plus the homogeneous coordinate), such that all principal minors associated with higher-dimensional simplices vanish, yielding zero volume for any non-collinear subset. For instance, for three points, the 4×4 Cayley-Menger determinant is proportional to the squared area of the triangle, which is zero precisely when the points are collinear.^[23] Another perspective on collinearity emerges from embeddability conditions in Euclidean spaces. A set of points is collinear if and only if it can be isometrically embedded into a 1-dimensional Euclidean space, where distances satisfy the strict triangle inequalities degenerating to equalities along the line. For four points, this is equivalently tested via Ptolemy's inequality: for points A, B, C, D, the inequality d(A,C) \cdot d(B,D) \leq d(A,B) \cdot d(C,D) + d(A,D) \cdot d(B,C) holds with equality if and only if the points are concyclic or collinear. In the collinear case, the configuration degenerates to a line, satisfying the equality as a limiting flat quadrilateral. This criterion extends the three-point test and is useful for verifying low-dimensional embeddings from distance data.^[24] In graph rigidity theory, developed prominently in the 1980s by researchers such as Asimow, Roth, and Connelly, distance-based collinearity plays a key role in assessing framework flexibility. A bar-joint framework, modeled as a graph with vertices at points and edges as fixed-length bars enforcing distances, is flexible if it admits non-trivial continuous motions preserving bar lengths. Configurations with collinear points connected by bars often result in flexible frameworks, as the points can slide along the line like a chain without violating distance constraints, leading to mechanisms rather than rigid structures; for example, three collinear points with two bars form a flexible degenerate triangle that can extend or contract. This property highlights how collinear subsets induce degrees of freedom, contrasting with generic positions that promote rigidity per Laman's combinatorial conditions.^[25]

Advanced Mathematical Concepts

Collinearity in Number Theory

In number theory, collinearity among lattice points—points with integer coordinates in the Euclidean plane—is intimately connected to the solutions of linear Diophantine equations. A straight line can be expressed in the form ax + by = c, where a, b, and c are integers with a and b not both zero. The lattice points lying on this line are precisely the integer pairs (x, y) satisfying the equation, provided solutions exist; this requires that d = \gcd(a, b) divides c. If so, a particular solution (x_0, y_0) can be found, and the general solution takes the parametric form

x = x_0 + \frac{b}{d} t, \quad y = y_0 - \frac{a}{d} t,

where t ranges over all integers.^[26] For lines with rational slope -a/b (assuming b \neq 0), the coefficients a and b can always be chosen as integers, ensuring the equation has integer coefficients after clearing denominators. In this case, the direction vector (b/d, -a/d) has integer components, and the lattice points are spaced along the line at integer multiples of this vector. If the direction vector is scaled to primitive integers m and n with \gcd(m, n) = 1, the points can be parameterized as x = x_0 + m t, y = y_0 + n t for integer t. This form highlights that the set of lattice points on such a line is discrete and evenly spaced.^[27] The coordinates of these collinear lattice points naturally form arithmetic progressions. As t increases by 1, the x-coordinates increase by the fixed common difference m (or b/d), while the y-coordinates increase by n (or -a/d). Thus, sequences of collinear lattice points correspond directly to finite arithmetic progressions in both coordinates simultaneously, with the common difference determined by the line's direction. This linkage underscores how problems in collinearity reduce to questions about arithmetic progressions in number theory. Szemerédi's theorem asserts that any subset of the integers with positive upper density contains arithmetic progressions of arbitrary length k. This has profound implications for collinear lattice points: in a dense subset of the integer lattice \mathbb{Z}^2, long arithmetic progressions in coordinates imply long sets of collinear points. A key geometric analog, established by Carl Pomerance, shows that for any B > 0 and integer k \geq 3, there exists m(k, B) such that any sequence of at least m(k, B) lattice points in \mathbb{Z}^2 with the sum of consecutive differences bounded by Bm in Euclidean norm must contain k collinear points.^[28] This result mirrors Szemerédi's theorem by guaranteeing long collinear configurations in "dense" lattice sequences, with applications to problems in additive combinatorics and discrete geometry. A prominent application arises in the no-three-in-line problem, which seeks the maximum number of lattice points selectable from the n \times n grid \{1, \dots, n\}^2 such that no three are collinear. The pigeonhole principle yields an immediate upper bound of $2n, as no row or column (each a line) can contain more than two points. Constructions achieving exactly $2n points exist for all n \leq 58 and for infinitely many larger n, often using algebraic methods like finite fields. As of October 2025, computational methods have confirmed 2n placements for all n up to 58.^[29] However, it remains open whether $2n is attainable for every n. In the 2020s, computational and probabilistic advances have improved general lower bounds to $2n - O(\sqrt{n \log n}), narrowing the gap toward the conjectured optimum.^[30]

Duality with Concurrency

In projective geometry, the principle of duality establishes a symmetry between points and lines in the projective plane, where the roles of these elements can be interchanged while preserving incidence relations. Specifically, a configuration of collinear points is dual to a configuration of concurrent lines, meaning three or more points lying on a single line correspond to three or more lines intersecting at a single point. This interchange is formalized through a correlation, a bijection that maps points to lines and lines to points, ensuring that a point lies on a line if and only if the dual line passes through the dual point.^[31] A foundational formalization of this duality without reliance on metric concepts was provided by Karl Georg Christian von Staudt in his 1847 work Geometrie der Lage, where he developed an axiomatic framework for projective geometry based solely on incidence, emphasizing the symmetric treatment of points and lines to derive theorems like those involving collinearity and concurrency.^[32]^[33] Desargues' theorem exemplifies this duality: given two triangles in the projective plane, the lines joining corresponding vertices are concurrent if and only if the intersection points of corresponding sides are collinear. This equivalence highlights how perspectivity from a point (concurrency) is dual to perspectivity from a line (collinearity), forming a cornerstone of projective configurations.^[34]^[35] The duality also manifests in conic sections through the relationship between Pascal's theorem and its dual, Brianchon's theorem. Pascal's theorem states that for a hexagon inscribed in a conic, the intersection points of opposite sides are collinear; its dual, Brianchon's theorem, asserts that for a hexagon circumscribed about a conic, the lines joining opposite vertices (the main diagonals) are concurrent. These theorems demonstrate the projective invariance of such configurations under duality.^[36]^[13] In modern algebraic geometry, post-1950s developments in scheme theory, particularly through Alexander Grothendieck's framework, extend projective duality to abstract varieties and schemes, where collinearity and concurrency concepts are generalized via the Proj construction and dual projective spaces, enabling the study of incidence relations in higher-dimensional and non-classical settings.^[37]^[38]

Graph Theory Applications

Collinearity Graphs

In combinatorial geometry, a collinearity graph is defined for a set of points P and a family of lines \mathcal{L} as the graph G(P, \mathcal{L}) whose vertex set is P and in which two distinct points are adjacent if and only if they lie on a common line from \mathcal{L}.^[39] This construction arises naturally in incidence geometries, where points and lines form a partial linear space, ensuring that any two points are incident with at most one line.^[40] The graph captures the collinearity relations within the configuration, facilitating the study of structural properties such as connectivity and diameter via graph-theoretic tools.^[41] In finite geometries, collinearity graphs exhibit remarkable regularity properties. For instance, in a generalized quadrangle of order q, the collinearity graph is strongly regular with parameters ((q+1)(q^2 + 1), q(q+1), q-1, q+1), meaning every adjacent pair of vertices has exactly q-1 common neighbors, while non-adjacent pairs have exactly q+1.^[40] This strong regularity stems from the axiomatic structure of generalized quadrangles, where any two points are collinear with at most one line and lines intersect in at most one point, leading to precise eigenvalue computations for the adjacency matrix: the eigenvalues are q(q+1), \theta = q-1, and \tau = -q-1 with known multiplicities.^[42] Similar properties hold for collinearity graphs of generalized polygons and polar spaces, often yielding distance-regular graphs useful in extremal combinatorics.^[43] Collinearity graphs also play a key role in the theory of block designs, where the lines correspond to blocks containing collinear points. In a symmetric 2-(v, k, \lambda) design, such as a projective plane, the collinearity graph coincides with the point graph of the design, providing a framework to analyze intersection properties and derive bounds on parameters like the number of blocks through a point. For example, in a balanced incomplete block design, the graph's adjacency reflects \lambda-wise intersections, enabling constructions of optimal designs via graph automorphisms and eigenvalue techniques.^[44] These applications extend to coding theory, where the graph's cliques correspond to codewords with minimum distance properties derived from the design's geometry.^[45] In the dual perspective to point-based collinearity graphs, where vertices represent points and edges connect collinear pairs, a corresponding structure arises for lines: the concurrency graph, with vertices as lines and edges between those that intersect at a common point. This duality, rooted in projective geometry, interchanges collinear points with concurrent lines while preserving incidence relations.^[46] Combinatorial properties of these graphs, such as chromatic number and girth, reveal that line intersection graphs in the plane are not χ-bounded, allowing constructions with arbitrarily large girth yet high chromatic numbers. Extending this, intersection graphs of lines can incorporate collinearity constraints on their intersection points, where edges connect lines whose pairwise intersections lie on a shared line with additional points in the arrangement. Such graphs highlight combinatorial configurations in line arrangements, including bounded crossing numbers and embedding hierarchies, distinguishing them from general geometric intersection classes like segment or disk graphs. These structures emphasize the role of collinearity in determining graph planarity and minor-closed properties, with strict containments between subclasses based on intersection multiplicity.^[47] Pseudoline arrangements provide a combinatorial abstraction of line arrangements, where pseudolines are simple curves crossing exactly once pairwise, and collinearity emerges in the ordering of intersection points along each pseudoline. A pseudoline arrangement is stretchable if it realizes an equivalent straight-line arrangement preserving all incidences and collinearities, a property central to rigidity in frameworks.^[48] Determining stretchability is NP-hard, linking collinearity preservation to computational challenges in realizing rigid structures without crossings.^[49] In rigidity theory, collinear points in such arrangements induce degenerate frameworks, where global rigidity decisions become ∃ℝ-complete, connecting pseudoline combinatorics to plane graph realizations.^[50] Recent advancements in the 2020s have explored collinearity within random geometric graphs, where vertices are points in Euclidean space and edges connect nearby pairs, modeling machine learning tasks on point sets. These graphs exhibit collinear subgraphs as dense cliques or paths, and graph neural networks have been applied to detect such patterns for enhanced shape cognition in geometric data reconstruction.^[51] For instance, in reconstructing random geometric graphs from partial observations, collinearity assumptions improve vertex positioning accuracy by avoiding near-collinear degeneracies in optimization.

Practical Applications

Statistics and Econometrics

In statistics and econometrics, multicollinearity refers to the presence of high correlation among independent variables in a regression model, which violates the assumption of no perfect linear relationships among predictors and complicates the estimation of individual effects.^[52] This issue arises when predictors are linearly dependent, making it difficult to isolate the unique contribution of each variable to the dependent variable.^[53] A common diagnostic tool is the variance inflation factor (VIF), which measures how much the variance of a regression coefficient is inflated due to collinearity with other predictors; a VIF exceeding 10 typically signals serious multicollinearity that warrants attention.^[53] Another key test involves the condition number of the design matrix, derived from its singular value decomposition, where values above 30 indicate severe multicollinearity, as outlined in the seminal work on regression diagnostics.^[54]^[55] The primary consequences of multicollinearity include inflated standard errors of the coefficient estimates, which reduce the precision of inferences and increase the likelihood of failing to detect statistically significant effects even when they exist.^[56] This leads to unstable coefficients that can change dramatically with minor alterations in the data or model specification, undermining the reliability of the model for prediction or policy analysis.^[57] While ordinary least squares (OLS) estimators remain unbiased under multicollinearity, the heightened variance can exacerbate issues like omitted variable bias if correlated predictors are selectively excluded to mitigate the problem.^[58] To address multicollinearity, remedies such as ridge regression introduce a bias through regularization by adding a penalty term to the OLS objective, shrinking coefficients toward zero and stabilizing estimates in the presence of correlated predictors, as originally proposed for nonorthogonal problems.^[59] Principal component analysis (PCA) offers another approach by transforming the original variables into orthogonal principal components, retaining only those that explain most of the variance to eliminate collinearity while preserving key information.^[54] In econometric applications, such as OLS models estimating economic growth, including highly collinear inputs like GDP and consumption—where consumption forms a major component of GDP—can inflate variances and, if one variable is omitted to simplify the model, introduce omitted variable bias by confounding the effects of related economic factors.^[60]

Engineering and Imaging

In antenna engineering, collinear arrays consist of dipole elements aligned end-to-end along a common axis, which enhances directivity by concentrating radiation along the array's longitudinal direction. This configuration increases gain compared to a single dipole, with directivity scaling approximately with the number of elements; for instance, a multi-element collinear array can achieve beamwidths as narrow as 5.6 degrees at VHF frequencies. Phase shifts applied to the elements enable beamforming, where linear placement ensures constructive interference along the desired direction, a principle fundamental to phased array systems for applications like radar and wireless communications.^[61]^[62]^[63] In photography and imaging systems, collinearity manifests in perspective projections where parallel lines in three-dimensional space appear to converge at vanishing points, creating vanishing lines that distort scenes captured by wide-angle lenses. These vanishing points arise from the collinear alignment of the camera's optical center with the principal points of the image plane, leading to effects like foreshortening in architectural or landscape photography. Lens distortion correction often employs homography matrices to map distorted points back to their collinear ideal, estimating parameters such as the distortion center based on constraints from detected vanishing points in calibration patterns. This process is essential for rectifying images from fisheye or barrel-distorted lenses, ensuring accurate metric measurements in photogrammetry.^[64]^[65]^[66] In computer vision, epipolar geometry governs stereo imaging, where corresponding points in two views and the epipole (projection of one camera's center onto the other image) lie on a common epipolar line, enforcing collinearity that simplifies disparity computation for depth estimation. This constraint reduces the search for matches from a 2D plane to a 1D line, critical for reconstructing 3D scenes from binocular cameras in robotics and augmented reality. Seminal formulations, such as those using the fundamental matrix, quantify this collinearity, with the epipolar line derived as l' = F x, where points x and x' satisfy x'^T l' = 0, confirming their alignment with the epipole.^[67] Advancements in the 2020s have integrated AI-based collinearity detection into image processing for autonomous vehicles, leveraging deep learning to identify vanishing points from monocular or stereo feeds for robust lane and obstacle estimation in unstructured environments. Convolutional neural networks trained on large datasets, such as street view images, regress heatmaps to pinpoint vanishing points with high precision, enabling real-time perspective correction and path prediction even under occlusion or poor lighting. For example, pyramid dual attention models achieve high accuracy on unstructured road benchmarks, outperforming traditional geometric methods by adapting to diverse road geometries without explicit calibration.^[68]

References

[1]
Collinear -- from Wolfram MathWorld
Three or more points P_1, P_2, P_3, ..., are said to be collinear if they lie on a single straight line L. A line on which points lie, especially if it is ...
[2]
Collinearity in Geometry - Interactive Mathematics
In geometry, collinearity refers to a set of points that lie on the same line. A line is a straight geometric figure with no curves or bends. All points on the ...
[3]
10.4 - Multicollinearity | STAT 462
Multicollinearity exists when two or more of the predictors in a regression model are moderately or highly correlated with one another.
[4]
https://library.virginia.edu/data/articles/addressing-multicollinearity
[5]
[PDF] Lecture 17: Multicollinearity - Statistics & Data Science
Oct 29, 2015 · x is column-rank deficient, meaning one or more of its columns is equal to a linear combination of the others. The last explains why we call ...
[6]
[PDF] Basics of Affine Geometry - UPenn CIS
are linearly dependent. If two of the points a, b, c are distinct, say ... collinear points to collinear points, then f is affine. The proof is rather ...
[7]
[PDF] Betweenness of Points
By definition, a point B is between two other points A and C if all three points are collinear and AB +BC = AC. Although this definition is unambiguous and ...
[8]
Triangle Inequality
“Triangle equality” and collinearity Theorem: If A, B, C are distinct points in the plane, then |CA| = |AB| + |BC| if and only if the 3 points are collinear ...
[9]
[PDF] geometry of points, lines, and planes in three dimensional euclidean ...
Points or sets of points in space are collinear if there is a line that contains all of them. Points or sets of points in space are coplanar if there is a ...
[10]
Theorems of Menelaus and Ceva
Theorem of Menelaus. Let three points X, Y, and Z, lie respectively on the sides AC, BC, and AB of triangle ABC. Then the points are collinear if and only if ...<|control11|><|separator|>
[11]
(PDF) When Varignon meets Napoleon - ResearchGate
Apr 8, 2025 · ... degenerate, i.e., three or all. four vertices can be collinear, as long as the four vertices are pairwise diﬀer-. ent. To clarify what ...
[12]
Varignon Parallelogram -- from Wolfram MathWorld
The figure formed when the midpoints of adjacent sides of a quadrilateral are joined. Varignon's theorem demonstrated that this figure is a parallelogram.
[13]
[PDF] Introduction to Projective Geometry
Theorem. Any five points, of which no three are collinear, determine a unique conic through them. George Voutsadakis (LSSU). Projective Geometry. August 2020.
[14]
Pascal's Theorem -- from Wolfram MathWorld
It states that, given a (not necessarily regular, or even convex) hexagon inscribed in a conic section, the three pairs of the continuations of opposite sides ...
[15]
Brianchon's theorem - Interactive Mathematics Miscellany and Puzzles
Brianchon theorem is the dual of Pascal's theorem. It asserts that in a hexagon circumscribed about a conic the major diagonals, i. e. the diagonals joining ...
[16]
Degenerate Conics I: Mystery of the Missing Case - The Math Doctors
Feb 18, 2022 · Similarly, a triangle can degenerate into a line segment if its vertices are collinear, or parallel lines can degenerate into a single line if ...
[17]
Simplex Volumes and the Cayley-Menger Determinant - MathPages
A simplex in two-dimensional space is a triangle three vertices), a simplex in three-dimensional space is a tetrahedron (four vertices), and so on. The ...
[18]
[PDF] Some Polynomial Conditions for Cyclic Quadrilaterals, Tilted Kites ...
Feb 21, 2023 · The determinant CM is the Cayley-Menger determinant of the four points ... Furthermore, if any of the ∆'s is zero, the three points are collinear.
[19]
[PDF] Realizability of Polyhedra - IRI-UPC
We define a proper projective realization as having no coplanar adjacent faces, no copunctual adjacent vertices, no faces collinear and no vertices collinear.
[20]
Euler's polyhedron formula | plus.maths.org
Jun 1, 2007 · Euler's formula tells us that V - E + F = 2; or, in words: the number of vertices, minus the number of edges, plus the number of faces, is equal to two.Missing: degenerate collinear
[21]
[PDF] Lecture Notes on Delaunay Mesh Generation - People @EECS
Feb 5, 2012 · The third constraint on meshes governs element size. Many mesh generation algorithms take as input not just the domain geometry, but also a ...
[22]
[PDF] To determine if three given points on the xy-plane are collinear - PolyU
To determine if three given points on the xy-plane are collinear. Given three points (x0,y0), (x1,y1), (x2,y2) on the Cartesian plane (the xy- plane) in 2-D.
[23]
Programming Assignment 3: Collinear Points
To check whether the 4 points p, q, r, and s are collinear, check whether the three slopes between p and q, between p and r, and between p and s are all equal. ...
[24]
[PDF] CMSC 754 Computational Geometry
Given a set polygonal obstacles in the plane, find the shortest obstacle-avoiding path from some given start point to a given goal point (see Fig. 1). Although.Missing: preferred | Show results with:preferred
[25]
[PDF] arXiv:1701.08833v1 [math.MG] 30 Jan 2017
Jan 30, 2017 · Equivalently, its Cayley-Menger determinant is 0. Since t0 is not 0 ... Therefore A0, G, and Q0 are collinear. Since A0 and Q0 lie on Γ ...<|separator|>
[26]
The Four Point Condition: Tropicalization of Ptolemy’s Inequality
Ptolemy's inequality is a classical result in Euclidean geometry that relates the six distances among four points in the plane.
[27]
Rigid Two-Dimensional Frameworks with Three Collinear Points
Aug 7, 2025 · In rigidity theory we seek to understand when the remaining pairwise distances are also fixed. If there exists a pair of points which move ...
[28]
[PDF] Lecture #1 of 38 ∼ January 20, 2021 - Math 4527 (Number Theory 2)
We can solve linear Diophantine equations in two variables by making changes of variable. Here's an example: Example: Find all solutions to the equation 4x + ...
[29]
[PDF] Part I1 Lattices and linear diophantine equations
Lattices and linear diophantine equations can be described, to a large extent, parallel to linear spaces and linear equations (Part I) and to polyhedra and ...
[30]
https://arxiv.org/pdf/2209.01447.pdf
[31]
[PDF] Basics of Projective Geometry - UPenn CIS
In fact, it is easy to show that three distinct points that are not collinear determine a unique circle (see Samuel. [23]). In a similar vein, we can define the ...<|control11|><|separator|>
[32]
Karl von Staudt - Biography - MacTutor - University of St Andrews
von Staudt endeavoured to construct a geometry free from all metrical relations, and exclusively based upon relations of situation. It is in this spirit that ...
[33]
Geometrie der Lage : Staudt, Karl Georg Christian von, 1798-1867
Dec 11, 2008 · Publication date: 1847 ; Topics: Geometry, Projective ; Publisher: Nürnberg F. Korn ; Collection: gerstein; toronto; university_of_toronto.
[34]
[PDF] IV.5 : Theorems of Desargues and Pappus ) - UCR Math Department
The Euclidean version of Desargues' Theorem shows how projective geometry can provide an effective means for giving unified formulations and proofs of ...
[35]
[PDF] Projective Geometry in a Plane Fundamental Concepts - Earlham CS
This is the notion of duality in projective geometry. Two Basic Theorems ... If the points A, B, C are collinear and A', B', C' are collinear, then the ...
[36]
Pascal's Theorem - Interactive Mathematics Miscellany and Puzzles
Pascal's theorem is a direct generalization of that of Pappus. Its dual is a well known Brianchon's theorem. The theorem states that if a hexagon is inscribed ...
[37]
Algebraic Geometry - SpringerLink
In stockRobin Hartshorne studied algebraic geometry with Oscar Zariski and David Mumford at Harvard, and with J.-P. Serre and A. Grothendieck in Paris.
[38]
[PDF] Robin Hartshorne - Algebraic Geometry
The main objects of study are algebraic varieties in an affine or projective space over an algebraically ... braic geometry in terms of schemes and cohomology, ...
[39]
[PDF] Incidence Geometry - G Eric Moorhouse
... collinearity graph of the structure is the graph with point set P, in which two vertices are adjacent iff the corresponding points are collinear. Show that ...
[40]
[PDF] Finite Geometries and Extremal Problems
Sep 10, 2023 · x ∼ y ⇒ |x⊥ ∩ y⊥| = s + 1, x 6∼ y ⇒ |x⊥ ∩ y⊥| = t + 1. Hence the collinearity graph is a strongly regular graph. Eigenvalues of the adjacency ...
[41]
[PDF] Groups represented by incidence geometries - arXiv
Jun 12, 2025 · Abstract. The aim of this paper is to use the framework of incidence geometry to develop a theory that permits to model both the inner and ...
[42]
[PDF] Strongly regular graphs - CWI
The present volume is a monograph on the topic of Strongly Regular Graphs. So far, no book-length treatment of this subject area has been available.
[43]
The collinearity graph of a polar space - SymOmega - WordPress.com
Oct 4, 2012 · The collinearity graph of a polar space. A partial linear space of order (s,t) is a geometry of points and lines such that every pair of ...
[44]
[PDF] Spectra of graphs - CWI
The smallest eigenvalue gives information about independence number and chromatic number. ... the collinearity graph of a generalized quadrangle (cf. §9.6 below) ...
[45]
Point-line geometries related to binary equidistant codes
... collinearity graph of our geometry contains maximal cliques which are not maximal singular subspaces. ... block design. The geometries in question can be ...
[46]
[PDF] DUALITY - ETH Zurich
Feb 16, 2016 · A set of points is called collinear if there is a line such that every point in the set is incident with this line. A set of lines is called ...
[47]
[PDF] Intersection Graphs and Geometric Objects in the Plane
In the case of three lines that intersect in one point (or are parallel) the dual points points are collinear. The order of the lines around their intersection ...
[48]
[PDF] 5 PSEUDOLINE ARRANGEMENTS
Since Pappus's theorem says that points p, q, and r must be collinear if the pseudolines are straight, the arrangement in Figure 5.3.1 is clearly nonstretch-.
[49]
[PDF] Stretchability of pseudoline arrangements is NP-hard
A pseudoline arrangement is the partition of the plane induced by a collection of pseudolines. A pseudoline arrangement is stretchable (or realizable) if there ...Missing: rigidity | Show results with:rigidity
[50]
[PDF] Who Needs Crossings? Hardness of Plane Graph Rigidity
May 9, 2016 · Abstract. We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity.
[51]
Enhancing the Recognition of Collinear Building Patterns by Shape ...
Dec 16, 2024 · This study proposes a method using graph neural networks and shape cognition to enhance collinear building pattern recognition, using a dual ...
[52]
Multicollinearity in Regression Analyses Conducted in ... - NIH
Multicollinearity occurs when highly correlated predictors are used together in a regression model, causing unstable standard errors and misleading results.
[53]
Detecting Multicollinearity Using Variance Inflation Factors | STAT 462
such as, estimates of the coefficients vary excessively from model to model. The t-tests for each of the ...
[54]
Multicollinearity and misleading statistical results - PMC - NIH
Multicollinearity is present when the VIF is higher than 5 to 10 or the condition indices are higher than 10 to 30. However, they cannot indicate multicollinear ...
[55]
[PDF] A Guide to Using the - Collinearity Diagnostics - David A. Belsley
Dec 1, 1989 · The collinearity diagnostics introduced by Belsley, Kuh, and Welsch ... The largest condition index, which is also the scaled condition number of ...Missing: multicollinearity | Show results with:multicollinearity
[56]
Regression with Stata Chapter 2 – Regression Diagnostics
Tolerance, defined as 1/VIF, is used by many researchers to check on the degree of collinearity. A tolerance value lower than 0.1 is comparable to a VIF of 10.Missing: threshold | Show results with:threshold
[57]
[PDF] Multicollinearity and A Ridge Parameter Estimation Approach
Nov 1, 2016 · The consequences of multicollinearity are that the variance of the model (i.e. the error sum of squares) and the variances of coefficients are ...
[58]
[PDF] Number of Predictors and Multicollinearity: What are their Effects on ...
Nov 7, 2017 · High levels of multicollinearity inflated the standard errors and the estimate of the intercept for the random slope component was biased ...
[59]
Ridge Regression: Biased Estimation for Nonorthogonal Problems
Proposed is an estimation procedure based on adding small positive quantities to the diagonal of X′X. Introduced is the ridge trace, a method for showing in two ...
[60]
[PDF] Modelling and Detecting Multicollinearity of Some Economic ...
This study's objective is to model and identify multicollinearity utilizing the variance inflation factor of some economic variables on the GDP. The goals of ...
[61]
Antenna Theory - Collinear Array - Tutorials Point
A Collinear array consists of two or more half-wave dipoles, which are placed end to end. These antennas are placed on a common line or axis, being parallel ...
[62]
[PDF] 7.1a directivity and spacing for the antenna elements
A 26-element collinear antenna has shown a theoretical beam width of 5.6" at 49.8 MHz. The directivity in the plane per- pendicular to the collinear antenna is ...
[63]
(PDF) Design and Analysis of Collinear Biconical Antenna Array
Jan 11, 2025 · Antenna arrays are particularly preferred as they provide flexibility in design, excellent gain and high directivity. They allow optimization ...
[64]
Computing a complete camera lens distortion model by planar ...
With the estimated homography, distortion center is computed based on collinearity, and only radial distortion parameters are estimated.
[65]
A Distortion Image Correction Method for Wide-Angle Cameras ...
Then, a constraint equation is constructed according to the collinear constraint of vanishing points. Moreover, the distortion coefficients and the coordinates ...
[66]
A Perspective Distortion Correction Method for Planar Imaging ...
Mar 18, 2025 · This paper proposed a perspective distortion correction method for planar imaging based on homography mapping.
[67]
[PDF] Epipolar Geometry and the Fundamental Matrix
The epipolar geometry is the intrinsic projective geometry between two views. It is independent of scene structure, and only depends on the cameras' ...
[68]
https://ieeexplore.ieee.org/document/11088474