- Bitangent
(black) has 28 real bitangents (red).This image shows 7 of them; the others are symmetric with respect to 90° rotations through the origin.]
In
mathematics , a bitangent to acurve "C" is a line "L" that touches "C" in two distinct points "P" and "Q" and that has the same direction to "C" at these points. That is, "L" is antangent line at "P" and at "Q". It differs from asecant line in that a secant line may cross the curve at the two points it intersects it. In general, analgebraic curve will have infinitely many secant lines, but only finitely many bitangents.Bézout's theorem implies that aplane curve with a bitangent must have degree at least 4. The case of the 28 bitangents to a general plane quartic curve was a celebrated piece of geometry of thenineteenth century , a relationship being shown to the 27 lines on thecubic surface . Such bitangents are in general defined over the complex numbers, and are not "real" (see Salmon's "Higher Plane Curves"). For an example where all bitangents are real, seeTrott curve .The four bitangents of two disjoint
convex polygon s may be found efficiently by an algorithm based onbinary 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 maintainingconvex hull s dynamically (Overmars and van Leeuwen, 1981). Pocchiola and Vegter (1996a,b) 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 onpseudotriangulation .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.References
*cite journal
author = Overmars, M. H.; van Leeuwen, J.
title = Maintenance of configurations in the plane
journal = J. Comput. Sys. Sci.
volume = 23
issue = 2
year = 1981
pages = 166–204
doi = 10.1016/0022-0000(81)90012-X
*cite journal
author = Pocchiola, Michel; Vegter, Gert
title = The visibility complex
journal = International Journal of Computational Geometry and Applications
volume = 6
issue = 3
year = 1996a
pages = 297–308
doi = 10.1142/S0218195996000204
id = Preliminary version in [http://portal.acm.org/citation.cfm?id=160985.161159 Ninth ACM Symp. Computational Geometry (1993) 328–337] .
url = http://www.di.ens.fr/~pocchiol/postscript/pv-vc-93.ps*cite journal
author = Pocchiola, Michel; Vegter, Gert
year = 1996b
title = Topologically sweeping visibility complexes via pseudotriangulations
journal = Discrete and Computational Geometry
volume = 16
pages = 419–453
Wikimedia Foundation. 2010.