World Library  
Flag as Inappropriate
Email this Article

Direction vector

Article Id: WHEBN0003154778
Reproduction Date:

Title: Direction vector  
Author: World Heritage Encyclopedia
Language: English
Subject: Unit vector, Covariance and contravariance of vectors, Tensor, Linear algebra, Euclidean vector
Collection: Linear Algebra, Vectors (Mathematics and Physics)
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Direction vector

In mathematics, a direction vector that describes a line D is any vector

\overrightarrow{AB}

where A and B are two distinct points on the line. If v is a direction vector for D, so is kv for any nonzero scalar k; and these are in fact all of the direction vectors for the line D. Under some definitions, the direction vector is required to be a unit vector, in which case each line has exactly two direction vectors, which are negatives of each other (equal in magnitude, opposite in direction).

Contents

  • Parametric equation for a line 1
  • Generative versus predicate forms 2
  • Predicate form of 2D line equation 3
  • See also 4
  • External links 5

Parametric equation for a line

In Euclidean space (any number of dimensions), given a point a and a nonzero vector v, a line is defined parametrically by (a+tv), where the parameter t varies between -∞ and +∞. This line has v as a direction vector.

Generative versus predicate forms

The line equation a+tv is a generative form, but not a predicate form. Points may be generated along the line given values for a, t and v:

pa +tv

However, in order to function as a predicate, the representation must be sufficient to easily determine ( T / F ) whether any specified point p is on the given line [ a, v ]. If you substitute a known point into the above equation, it cannot be evaluated for equality because t was not supplied, only [ a, v ] and p.

Predicate form of 2D line equation

Run direction and orientation of 2D line
2D line equation (predicate form)

An example of a predicate form of the vector line equation in 2D is:

po == L

Here, the line is represented by two features: o and L, shown graphically in the illustration.

o is the line's orientation, a normalized direction vector (unit vector) pointing perpendicular to its run direction (see illustration).

The orientation is computed using the same two quantities dx and dy that go into computing slope m:

o ← ( dy , -dx ) norm = ( dy , -dx ) / || ( dy , -dx ) || (orientation of a 2D line)

Orientation o has the advantage of not overcompressing the information vested in dx and dy into a single scalar as slope does, avoiding the need to appeal to infinity as a value. Numerical algorithms benefit by avoiding such ill-behaved exceptions (e.g. , slope of a vertical line).

The 2nd feature of a 2D line represented this way is its location L. Intuitively and visually, L is the signed distance of the line from the origin (with positive distance increasing along direction o). Orientation must be solved before determining location. Once o is known, L can be computed given any known point p on the line:

L ← po (location of a 2D line)

Lines may be represented as feature pair ( o , L ) in all cases. Every line has an equivalent representation ( -o , -L ).

To determine if a point p is on the line, plug the value of p into the vector line predicate and evaluate it:

po == L (vector line predicate)

In computation, the predicate must tolerate finite math error by incorporating an epsilon signifying acceptable equality:

abs (po - L) < epsilon (finite precision vector line predicate)

The predicate form for 2D lines can be extended to higher dimensions, using coordinate rotation (by matrix rotation). The general form is:

R p == L

where R is the matrix rotation that aligns the line with an axis, and L is the invariant vector Location of points on the line under this rotation.

See also

External links

  • Weisstein, Eric W., "Direction vector", MathWorld.
  • Glossary, Nipissing University
  • Finding the vector equation of a line
  • Lines in a plane - Orthogonality, Distances, MATH-tutorial
  • Coordinate Systems, Points, Lines and Planes
  • Bierre, Pierre (2010). Flexing the Power of Algorithmic Geometry (1st ed.). Spatial Thoughtware.  
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 



Copyright © World Library Foundation. All rights reserved. eBooks from World eBook Library are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.