HOME

TheInfoList



OR:

In geometry, a bitangent to a
curve In mathematics, a curve (also called a curved line in older texts) is an object similar to a line (geometry), line, but that does not have to be Linearity, straight. Intuitively, a curve may be thought of as the trace left by a moving point (ge ...
is a
line Line most often refers to: * Line (geometry), object with zero thickness and curvature that stretches to infinity * Telephone line, a single-user circuit on a telephone communication system Line, lines, The Line, or LINE may also refer to: Arts ...
that touches in two distinct points and and that has the same direction as at these points. That is, is a tangent line at and at .


Bitangents of algebraic curves

In general, an algebraic curve will have infinitely many secant lines, but only finitely many bitangents. Bézout's theorem implies that an algebraic plane curve with a bitangent must have degree at least 4. The case of the 28 bitangents of a quartic was a celebrated piece of geometry of the nineteenth century, a relationship being shown to the 27 lines on the cubic surface.


Bitangents of polygons

The four bitangents of two disjoint convex polygons may be found efficiently by an algorithm based on binary search in which one maintains a binary search pointer into the lists of edges of each polygon and moves one of the pointers left or right at each steps depending on where the tangent lines to the edges at the two pointers cross each other. This bitangent calculation is a key subroutine in data structures for maintaining
convex hull In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean sp ...
s dynamically . describe an algorithm for efficiently listing all bitangent line segments that do not cross any of the other curves in a system of multiple disjoint convex curves, using a technique based on pseudotriangulation. Bitangents may be used to speed up the
visibility graph In computational geometry and robot motion planning, a visibility graph is a graph of intervisible locations, typically for a set of points and obstacles in the Euclidean plane. Each node in the graph represents a point location, and each edge rep ...
approach to solving the Euclidean shortest path problem: the shortest path among a collection of polygonal obstacles may only enter or leave the boundary of an obstacle along one of its bitangents, so the shortest path can be found by applying
Dijkstra's algorithm Dijkstra's algorithm ( ) is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks. It was conceived by computer scientist Edsger W. Dijkstra in 1956 and published three years ...
to a subgraph of the visibility graph formed by the visibility edges that lie on bitangent lines .


Related concepts

A bitangent differs from a secant line in that a secant line may cross the curve at the two points it intersects it. One can also consider bitangents that are not lines; for instance, the symmetry set of a curve is the locus of centers of circles that are tangent to the curve in two points. Bitangents to pairs of circles figure prominently in
Jakob Steiner Jakob Steiner (18 March 1796 – 1 April 1863) was a Swiss mathematician who worked primarily in geometry. Life Steiner was born in the village of Utzenstorf, Canton of Bern. At 18, he became a pupil of Heinrich Pestalozzi and afterwards s ...
's 1826 construction of the Malfatti circles, in the
belt problem The belt problem is a mathematics problem which requires finding the length of a crossed belt that connects two circular pulleys with radius ''r''1 and ''r''2 whose centers are separated by a distance ''P''. The solution of the belt problem requ ...
of calculating the length of a belt connecting two pulleys, in Casey's theorem characterizing sets of four circles with a common tangent circle, and in Monge's theorem on the collinearity of intersection points of certain bitangents.


References

*. *. *. *{{citation , last = Rohnert , first = H. , doi = 10.1016/0020-0190(86)90045-1 , issue = 2 , journal =
Information Processing Letters ''Information Processing Letters'' is a peer reviewed scientific journal in the field of computer science, published by Elsevier. The aim of the journal is to enable fast dissemination of results in the field of information processing Information ...
, pages = 71–76 , title = Shortest paths in the plane with convex polygonal obstacles , volume = 23 , year = 1986. Differential geometry Algebraic curves