Given four distinct lines in R^3 there exist zero, one, two, or various infinities of lines incident on the given lines. We wish to characterize and compute the set of incident lines in a numerically stable way. We use the Plucker coordinatization of lines to cast this problem as a null-space computation in R^5, and show how the singular value decomposition (SVD) yields a simple, stable characterization of the incident lines. Finally, we enumerate the types of input degeneracies that may arise, and describe the solution set of lines in each case.
Title
Computing the Lines Piercing Four Lines
Published
1991-01-01
Full Collection Name
Electrical Engineering & Computer Sciences Technical Reports
Other Identifiers
CSD-92-665
Type
Text
Extent
9 p
Archive
The Engineering Library
Usage Statement
Researchers may make free and open use of the UC Berkeley Library’s digitized public domain materials. However, some materials in our online collections may be protected by U.S. copyright law (Title 17, U.S.C.). Use or reproduction of materials protected by copyright beyond that allowed by fair use (Title 17, U.S.C. § 107) requires permission from the copyright owners. The use or reproduction of some materials may also be restricted by terms of University of California gift or purchase agreements, privacy and publicity rights, or trademark law. Responsibility for determining rights status and permissibility of any use or reproduction rests exclusively with the researcher. To learn more or make inquiries, please see our permissions policies (https://www.lib.berkeley.edu/about/permissions-policies).
