In Euclidean geometry, the intersection of a line and a line can be the empty set, a point, or another line. Distinguishing these cases and finding the intersection have uses, for example, in computer graphics, motion planning, and collision detection.
In three-dimensional Euclidean geometry, if two lines are not in the same plane, they have no point of intersection [citation needed] and are called skew lines. If they are in the same plane, however, there are three possibilities: if they coincide (are not distinct lines), they have an infinitude of points in common (namely all of the points on either of them); if they are distinct but have the same slope, they are said to be parallel and have no points in common; otherwise, they have a single point of intersection.
The distinguishing features of non-Euclidean geometry are the number and locations of possible intersections between two lines and the number of possible lines with no intersections (parallel lines) with a given line.[further explanation needed]
A necessary condition for two lines to intersect is that they are in the same plane—that is, are not skew lines. Satisfaction of this condition is equivalent to the tetrahedron with vertices at two of the points on one line and two of the points on the other line being degenerate in the sense of having zero volume. For the algebraic form of this condition, see Skew lines § Testing for skewness.
First we consider the intersection of two lines L1 and L2 in two-dimensional space, with line L1 being defined by two distinct points (x1, y1) and (x2, y2), and line L2 being defined by two distinct points (x3, y3) and (x4, y4).[1]
The intersection P of line L1 and L2 can be defined using determinants.
The determinants can be written out as:
When the two lines are parallel or coincident, the denominator is zero.
The intersection point above is for the infinitely long lines defined by the points, rather than the line segments between the points, and can produce an intersection point not contained in either of the two line segments. In order to find the position of the intersection in respect to the line segments, we can define lines L1 and L2 in terms of first degree Bézier parameters:
(where t and u are real numbers). The intersection point of the lines is found with one of the following values of t or u, where
and
with
There will be an intersection if 0 ≤ t ≤ 1 and 0 ≤ u ≤ 1. The intersection point falls within the first line segment if 0 ≤ t ≤ 1, and it falls within the second line segment if 0 ≤ u ≤ 1. These inequalities can be tested without the need for division, allowing rapid determination of the existence of any line segment intersection before calculating its exact point.[2]
The x and y coordinates of the point of intersection of two non-vertical lines can easily be found using the following substitutions and rearrangements.
Suppose that two lines have the equations y = ax + c and y = bx + d where a and b are the slopes (gradients) of the lines and where c and d are the y-intercepts of the lines. At the point where the two lines intersect (if they do), both y coordinates will be the same, hence the following equality:
We can rearrange this expression in order to extract the value of x,
and so,
To find the y coordinate, all we need to do is substitute the value of x into either one of the two line equations, for example, into the first:
Hence, the point of intersection is
Note that if a = b then the two lines are parallel and they do not intersect, unless c = d as well, in which case the lines are coincident and they intersect at every point.
By using homogeneous coordinates, the intersection point of two implicitly defined lines can be determined quite easily. In 2D, every point can be defined as a projection of a 3D point, given as the ordered triple (x, y, w). The mapping from 3D to 2D coordinates is (x′, y′) = (x/w, y/w). We can convert 2D points to homogeneous coordinates by defining them as (x, y, 1).
Assume that we want to find intersection of two infinite lines in 2-dimensional space, defined as a1x + b1y + c1 = 0 and a2x + b2y + c2 = 0. We can represent these two lines in line coordinates as U1 = (a1, b1, c1) and U2 = (a2, b2, c2). The intersection P′ of two lines is then simply given by[3]
If cp = 0, the lines do not intersect.
The intersection of two lines can be generalized to involve additional lines. The existence of and expression for the n-line intersection problem are as follows.
In two dimensions, more than two lines almost certainly do not intersect at a single point. To determine if they do and, if so, to find the intersection point, write the ith equation (i = 1, …, n) as
and stack these equations into matrix form as
where the ith row of the n × 2 matrix A is [ai1, ai2], w is the 2 × 1 vector [xy], and the ith element of the column vector b is bi. If A has independent columns, its rank is 2. Then if and only if the rank of the augmented matrix [A | b] is also 2, there exists a solution of the matrix equation and thus an intersection point of the n lines. The intersection point, if it exists, is given by
where Ag is the Moore–Penrose generalized inverse of A (which has the form shown because A has full column rank). Alternatively, the solution can be found by jointly solving any two independent equations. But if the rank of A is only 1, then if the rank of the augmented matrix is 2 there is no solution but if its rank is 1 then all of the lines coincide with each other.
The above approach can be readily extended to three dimensions. In three or more dimensions, even two lines almost certainly do not intersect; pairs of non-parallel lines that do not intersect are called skew lines. But if an intersection does exist it can be found, as follows.
In three dimensions a line is represented by the intersection of two planes, each of which has an equation of the form
Thus a set of n lines can be represented by 2n equations in the 3-dimensional coordinate vector w:
where now A is 2n × 3 and b is 2n × 1. As before there is a unique intersection point if and only if A has full column rank and the augmented matrix [A | b] does not, and the unique intersection if it exists is given by
In two or more dimensions, we can usually find a point that is mutually closest to two or more lines in a least-squares sense.
In the two-dimensional case, first, represent line i as a point pi on the line and a unit normal vector n̂i, perpendicular to that line. That is, if x1 and x2 are points on line 1, then let p1 = x1 and let
which is the unit vector along the line, rotated by a right angle.
The distance from a point x to the line (p, n̂) is given by
And so the squared distance from a point x to a line is
The sum of squared distances to many lines is the cost function:
This can be rearranged:
To find the minimum, we differentiate with respect to x and set the result equal to the zero vector:
so
and so
While n̂i is not well-defined in more than two dimensions, this can be generalized to any number of dimensions by noting that n̂i n̂iT is simply the symmetric matrix with all eigenvalues unity except for a zero eigenvalue in the direction along the line providing a seminorm on the distance between pi and another point giving the distance to the line. In any number of dimensions, if v̂i is a unit vector along the ith line, then
where I is the identity matrix, and so[4]
In order to find the intersection point of a set of lines, we calculate the point with minimum distance to them. Each line is defined by an origin ai and a unit direction vector n̂i. The square of the distance from a point p to one of the lines is given from Pythagoras:
where (p − ai)T n̂i is the projection of p − ai on line i. The sum of distances to the square to all lines is
To minimize this expression, we differentiate it with respect to p.
which results in
where I is the identity matrix. This is a matrix Sp = C, with solution p = S+C, where S+ is the pseudo-inverse of S.
In spherical geometry, any two great circles intersect.[5]
In hyperbolic geometry, given any line and any point, there are infinitely many lines through that point that do not intersect the given line.[5]
City and Commune in Valparaíso, ChileLa LiguaCity and CommuneLa Ligua Coat of arms La LiguaLocation in ChileCoordinates: 32°27′S 71°13′W / 32.450°S 71.217°W / -32.450; -71.217Country ChileRegion ValparaísoProvincePetorcaFounded1754Government[1] • TypeMunicipality • AlcaldeRodrigo Sánchez VillalobosArea[2] • Total1,163.4 km2 (449.2 sq mi)Elevation126 m (413 ft)Population …
Медицинский университет в ЛодзиUniwersytet Medyczny w Łodzi Международное название англ. Medical University of Łódź Год основания 2002 Тип общественный ректор Радзислав Кордек Ректор Radzisław Kordek[d][1] Студенты 9 000 (2009) Расположение Лодзь, Польша Юридический адрес al. Kościuszki 4 90-419 Лодзь Сайт en.umed.pl…
DigulFlyKamundanMamberamoSepik Sungai-sungai besar di Pulau Papua Daftar sungai-sungai yang mengalir di bagian Barat Pulau Papua, yang berada di wilayah Indonesia.[1] Menurut abjad Sungai Aimau Sungai Baliem (Vriendschaps) Sungai Bian Sungai Brazza Sungai Bulaka Sungai Digul Sungai Fly Sungai Grime Sungai Kampung Sungai Kamundan Sungai Keerom Sungai Kumbe Sungai Mamberamo Sungai Mapi Sungai Mimika Sungai Maro (Merauke) Sungai Momats Sungai Muturi Sungai Ok Tedi Sungai Pulau (Eilanden) Su…
Erin KellymanLahir17 Oktober 1998 (umur 25)Tamworth, Staffordshire, Britania RayaKebangsaan Britania RayaPekerjaanAktris Erin Mae Kellyman (lahir 17 Oktober 1998) adalah seorang aktris Inggris. Kellyman muncul sebagai Enfys Nest, pemimpin pemberontak Cloud Riders, di Solo: A Star Wars Story[1][2] dan Eponine Thénardier dalam adaptasi BBC tahun 2019 dari novel Victor Hugo, Les Miserables. Referensi ^ Latest World & National News & Headlines. USATODAY.com. Diakse…
Koe o Kikasete 声をきかせてLagu oleh Big Bangdari album Big Bang 2Dirilis4 November 2009FormatJPN CD SingleGenreJ-Pop, R&B, R&B kontemporerLabelYG Entertainment, Universal Music JapanPenciptaTeddy (musik); Yamamoto Shigemi, ROBIN (lirik) Koe o Kikasete (声をきかせてcode: ja is deprecated , Let Me Hear Your Voice) adalah singel Jepang ketiga[1][2] dari boy band asal Korea Selatan, Big Bang. Singel ini dirilis oleh YG Entertainment tujuh bulan setelah singel ガ…
Ohrazení Ohrazení (Tschechien) Basisdaten Staat: Tschechien Tschechien Region: Jihočeský kraj Bezirk: České Budějovice Gemeinde: Ledenice Fläche: 241 ha Geographische Lage: 48° 57′ N, 14° 35′ O48.945126914.5847978525Koordinaten: 48° 56′ 42″ N, 14° 35′ 5″ O Höhe: 525 m n.m. Einwohner: 139 (2021) Postleitzahl: 373 11 Kfz-Kennzeichen: C Verkehr Straße: Ledenice – České Budějovice Straße nach Ohrazení H…
Вайде ван Нікерк (англ. Wayde van Niekerk; 15 липня 1992, Кейптаун) — південноафриканський легкоатлет. Лара ван Нікерк (13 травня 2003(2003-05-13)) — південноафриканська плавчиня, призерка чемпіонату світу. Нікерк — термін, який має кілька значень. Ця сторінка значень містить посилання н…
Fisheries Science of Ukraine Скорочена назва РГНУ і Ribogospod. nauka Ukr.[1]Країна видання УкраїнаМісце публікації КиївТематика Рибне господарство України, рибогосподарська наукаdПеріодичність виходу 1 триместрМова українська, російська і англійськаГоловний редактор
2005 video gameRogue GalaxyNorth American and European cover artDeveloper(s)Level-5Publisher(s)Sony Computer EntertainmentDirector(s)Akihiro HinoTakeshi AkasakaProducer(s)Akihiro HinoKentaro MotomuraDesigner(s)Akihiro HinoProgrammer(s)Usuke KumagiMamoru ItagakiTakayuki KobayashiArtist(s)Takeshi MajimaWriter(s)Akihiro HinoKoji HiroComposer(s)Tomohito NishiuraPlatform(s)PlayStation 2ReleaseJP: December 8, 2005[1]NA: January 30, 2007[1]AU: September 6, 2007[2]EU: September 7…
Istilah superzoom atau hyperzoom mengacu pada lensa zoom fotografi dengan faktor panjang fokus tidak biasa besar, biasanya lebih dari 5× atau bahkan mulai melampaui 15×. Rasio terbesar untuk lensa kamera SLR digital dipegang oleh format Nikon DX (APS-C) 18-300 mm, memberikan 16,7×. Beberapa kamera digital jembatan bahkan lebih besar zoom rasio hingga 60× dan non-kamera saku lensa dilepas dengan ukuran sensor 1/2.3 yang sama sebagai kamera jembatan telah superzoom hingga 30×. Samsung Galaxy …
Frederic Mackarness Frederic(k) Michael Coleridge Mackarness (31 August 1854 – 23 December 1920) born at Tardebigge, Saint Bartholomew, Worcestershire, England was a British barrister, judge and Liberal politician and Member of Parliament for the Newbury constituency. Family and education Mackarness was the son of the Right Reverend John Fielder Mackarness, who was Bishop of Oxford from 1870 to 1888[1] and Alethea Buchanan Coleridge. He was educated at Marlborough College and Keble Col…
Гончар Іван Макарович Народився 14 (27) січня 1911[1]Лип'янка, Чигиринський повіт, Київська губернія, Російська імперія[2]Помер 18 червня 1993(1993-06-18) (82 роки)Київ, Україна[2]Поховання Байкове кладовище : Громадянство Російська імперія → УНР → СРСР → Украї…
Brit Award paraMelhor Artista Revelação País Reino Unido Primeira cerimónia 1977 Detentor atual Little Simz (2022) Apresentação British Phonographic Industry (BPI) Página oficial O Brit Award para Melhor Artista Revelação (no original em inglês: Brit Award for Best New Artist) (anteriormente Brit Award para Melhor Revelação Britânica, no original em inglês: Brit Award for British Breakthrough Act)[1] é um prêmio concedido pela British Phonographic Industry (BPI), uma organi…
Public school district in Indiana Northwest Allen County Schools (NACS)Location13119 Coldwater Road Fort Wayne, IndianaAllen CountyDistrict informationTypePublicGradesPK-12SuperintendentWayne BarkerAsst. superintendent(s)Bill TolerSchool board5 membersSchools7 Elementary, 2 Middle, 1 HighBudget$69.121 MillionStudents and staffStudents7362Teachers434Athletic conferenceSummitColorsCrimson Other informationGraduation Rate96.7%Websitewww.nacs.k12.in.us[1][2][3][4 …
Si ce bandeau n'est plus pertinent, retirez-le. Cliquez ici pour en savoir plus. Cet article ou cette section comporte trop de citations, ou des citations trop longues, au point qu'elles peuvent, selon le cas, déséquilibrer l'article en donnant trop d'importance à certains points de vue, ou contrevenir à l'un des principes fondateurs de Wikipédia (décembre 2021). Pour améliorer cet article il convient, si ces citations présentent un intérêt encyclopédique et sont correctement sourcée…
Gruzja Ten artykuł jest częścią serii:Ustrój i politykaGruzji Ustrój polityczny Ustrój polityczny Gruzji Konstytucja Konstytucja Gruzji Władza ustawodawcza Parlament Przewodniczący Dawit Usupaszwili Władza wykonawcza Prezydent Giorgi Margwelaszwili Premier Mamuka Bachtadze Rząd Rząd Giorgiego Kwirikaszwilego Władza sądownicza Wymiar sprawiedliwości Sąd Najwyższy Prokurator Generalny Gruzji Kontrola państwowa Kontrola państwowa Audytor generalny Lasha Tordia Finanse Narodowy Ba…
2008 video gameDuel LoveDeveloper(s)Namco Bandai GamesPublisher(s)Namco Bandai GamesPlatform(s)Nintendo DSReleaseJP: March 13, 2008Genre(s)Action Visual NovelMode(s)Single-player, multiplayer Duel Love (デュエルラブ 恋する乙女は勝利の女神) is a Japanese otome video game for the Nintendo DS by Namco Bandai Games. It was released on 13 March 2008 and the character designs and artwork were created by Hisaya Nakajo. The story concerns a female protagonist who becomes friends with th…
Norwegian footballer (born 1988) Ruben Yttergård Jenssen Yttergård Jenssen with 1. FC Kaiserslautern in 2015Personal informationFull name Ruben Yttergård JenssenDate of birth (1988-05-04) 4 May 1988 (age 35)Place of birth Tromsø, NorwayHeight 1.73 m (5 ft 8 in)Position(s) MidfielderTeam informationCurrent team TromsøNumber 11Youth career0000–1996 Fløya1997 Sogndal1998–2004 Fløya2005–2006 TromsøSenior career*Years Team Apps (Gls)2006–2013 Tromsø 170 (4)2013–…
Country subdivision in Scandinavia A syssel is a historical type of country subdivision in Denmark and elsewhere in Scandinavia. The mediaeval Danish sysler may be compared to the fylker of Norway, the landskaps of Sweden and Finland, the shires of England and Scotland, and the Gaue of the Holy Roman Empire. A syssel was subdivided into a number of hundreds or herreder. The name still can be found in the Danish district of Vendsyssel, as well as in a governmental title, sýslumenn, in Iceland, t…
American college basketball coach and former player Darrell WalkerWalker in 2013Little Rock TrojansPositionHead coachLeagueOhio Valley ConferencePersonal informationBorn (1961-03-09) March 9, 1961 (age 62)Chicago, Illinois, U.S.NationalityAmericanListed height6 ft 4 in (1.93 m)Listed weight180 lb (82 kg)Career informationHigh schoolCorliss (Chicago, Illinois)College Westark Community College (1979–1980) Arkansas (1980–1983) NBA draft1983: 1st round, 12th overall…
Lokasi Pengunjung: 3.135.194.18