In
geometry, a **convex curve** is a
plane curve that has a
supporting line through each of its points. There are many other equivalent definitions of these curves, going back to
Archimedes. Examples of convex curves include the
convex polygons, the
boundaries of
convex sets, and the
graphs of
convex functions. Important subclasses of convex curves include the closed convex curves (the boundaries of bounded convex sets), the
smooth curves that are convex, and the strictly convex curves, which have the additional property that each supporting line passes through a unique point of the curve.

Bounded convex curves have a well-defined length, which can be obtained by approximating them with polygons, or from the average length of their projections onto a line. The maximum number of grid points that can belong to a single curve is controlled by its length. The points at which a convex curve has a unique supporting line are dense within the curve, and the distance of these lines from the origin defines a continuous support function. A smooth simple closed curve is convex if and only if its curvature has a consistent sign, which happens if and only if its total curvature equals its total absolute curvature.

Archimedes, in his *
On the Sphere and Cylinder*, defines convex arcs as the plane curves that lie on one side of the line through their two endpoints, and for which all
chords touch the same side of the curve.^{
[1]} This may have been the first formal definition of any notion of convexity, although convex polygons and convex polyhedra were already long known before Archimedes.^{
[2]} For the next two millennia, there was little study of convexity:^{
[2]} its in-depth investigation began again only in the 19th century,^{
[3]} when
Augustin-Louis Cauchy and others began using
mathematical analysis instead of
algebraic methods to put
calculus on a more rigorous footing.^{
[1]}^{
[2]}

Many other equivalent definitions for the convex curves are possible, as detailed below. Convex curves have also been defined by their supporting lines, by the sets they form boundaries of, and by their intersections with lines. In order to distinguish closed convex curves from curves that are not closed, the closed convex curves have sometimes also been called *convex loops*, and convex curves that are not closed have also been called *convex arcs*.^{
[4]}

A
plane curve is the image of any
continuous function from an
interval to the
Euclidean plane. Intuitively, it is a set of points that could be traced out by a moving point. More specifically,
smooth curves generally at least require that the function from the interval to the plane be
continuously differentiable, and in some contexts are defined to require higher derivatives. The function parameterizing a smooth curve is often assumed to be
regular, meaning that its derivative stays away from zero; intuitively, the moving point never slows to a halt or reverses direction. Each interior point of a smooth curve has a
tangent line. If, in addition, the second derivative exists everywhere, then each of these points has a well-defined
curvature.^{
[5]}

A plane curve is *closed* if the two endpoints of the interval are mapped to the same point in the plane, and it is *simple* if no other two points coincide.^{
[5]} Less commonly, a simple plane curve may be said to be *open* if it is topologically equivalent to a line, neither having an endpoint nor forming any limiting point that does not belong to it, and dividing the plane into two unbounded regions.^{
[6]} However, this terminology is ambiguous as other sources refer to a curve with two distinct endpoints as an open curve.^{
[7]} Here, we use the topological-line meaning of an open curve.

A
supporting line is a line containing at least one point of the curve, for which the curve is contained in one of the two
half-planes bounded by the line. A plane curve is called *convex* if it has a supporting line through each of its points.^{
[8]}^{
[9]} For example, the
graph of a
convex function has a supporting line below the graph through each of its points. More strongly, at the points where the function has a derivative, there is exactly one supporting line, the
tangent line.^{
[10]}

Supporting lines and tangent lines are not the same thing,^{
[11]} but for convex curves, every tangent line is a supporting line.^{
[8]} At a point of a curve where a tangent line exists, there can only be one supporting line, the tangent line.^{
[12]} Therefore, a smooth curve is convex if it lies on one side of each of its tangent lines. This may be used as an equivalent definition of convexity for smooth curves, or more generally for
piecewise smooth curves.^{
[13]}^{
[a]}

A convex curve may be alternatively defined as a connected subset of the
boundary of a
convex set in the
Euclidean plane.^{
[8]}^{
[9]} Not every convex set has a connected boundary,^{
[b]} but when it does, the whole boundary is an example of a convex curve. When a
bounded convex set in the plane is not a line segment, its boundary forms a simple closed convex curve.^{
[16]} By the
Jordan curve theorem, a simple closed curve divides the plane into interior and exterior regions, and another equivalent definition of a closed convex curve is that it is a simple closed curve whose union with its interior is a convex set.^{
[9]}^{
[17]} Examples of open and unbounded convex curves include the graphs of convex functions. Again, these are boundaries of convex sets, the
epigraphs of the same functions.^{
[18]}

This definition is equivalent to the definition of convex curves from support lines. Every convex curve, defined as a curve with a support line through each point, is a subset of the boundary of its own
convex hull. Every connected subset of the boundary of a convex set has a support line through each of its points.^{
[8]}^{
[9]}^{
[19]}

For a convex curve, every line in the plane intersects the curve in one of four ways: its intersection can be the empty set, a single point, a pair of points, or an interval. In the cases where a closed curve intersects in a single point or an interval, the line is a supporting line. This can be used as an alternative definition of the convex curves: they are the
Jordan curves (connected simple curves) for which every intersection with a line has one of these four types. This definition can be used to generalize convex curves from the
Euclidean plane to certain other
linear spaces such as the
real projective plane. In these spaces, like in the Euclidean plane, any curve with only these restricted line intersections has a supporting line for each point.^{
[20]}

The *strictly convex curves* again have many equivalent definitions. They are the convex curves that do not contain any
line segments.^{
[21]} They are the curves for which every intersection of the curve with a line consists of at most two points.^{
[20]} They are the curves that can be formed as a connected subset of the boundary of a
strictly convex set.^{
[22]} Here, a set is strictly convex if every point of its boundary is an
extreme point of the set, the unique maximizer of some linear function.^{
[23]} As the boundaries of strictly convex sets, these are the curves that lie in
convex position, meaning that none of their points can be a
convex combination of any other subset of its points.^{
[24]}

Closed strictly convex curves can be defined as the simple closed curves that are
locally equivalent (under an appropriate coordinate transformation) to the graphs of strictly convex functions. This means that, at each point of the curve, there is a
neighborhood of the points and a system of
Cartesian coordinates within that neighborhood such that, within that neighborhood, the curve coincides with the graph of a strictly convex function.^{
[25]}^{
[c]}

Smooth closed convex curves with an
axis of symmetry, such as an
ellipse or
Moss's egg, may sometimes be called
ovals.^{
[28]} However, the same word has also been used to describe the sets for which each point has a unique line disjoint from the rest of the set, especially in the context of
ovals in finite
projective geometry. In Euclidean geometry these are the smooth strictly convex closed curves, without any requirement of symmetry.^{
[20]}

Every bounded convex curve is a
rectifiable curve, meaning that it has a well-defined finite
arc length, and can be approximated in length by a sequence of inscribed
polygonal chains. For closed convex curves, the length may be given by a form of the
Crofton formula as times the average length of its projections onto lines.^{
[8]} It is also possible to approximate the area of the convex hull of a convex curve by a sequence of inscribed
convex polygons. For any integer , the most accurate approximating -gon has the property that each vertex has a supporting line parallel to the line through its two neighboring vertices.^{
[29]} As Archimedes already knew, if two convex curves have the same endpoint, and one of the two curves lies between the other and the line through their endpoints, then the inner curve is shorter than the outer one.^{
[2]}

According to
Newton's theorem about ovals, the area cut off from an
infinitely differentiable convex curve by a line cannot be an algebraic function of the coefficients of the line.^{
[30]}

It is not possible for a short strictly convex curve to pass through many points of the integer lattice. If the curve has length , then according to a theorem of Vojtěch Jarník, the number of lattice points that it can pass through is at most

Because this estimate uses
big O notation, it is accurate only in the limiting case of large lengths. Neither the leading constant nor the exponent in the error term can be improved.

A convex curve can have at most a
countable set of
singular points, where it has more than one supporting line. All of the remaining points must be non-singular, and the unique supporting line at these points is necessarily a tangent line. This implies that the non-singular points form a
dense set in the curve.^{
[10]}^{
[32]} It is also possible to construct convex curves for which the singular points are dense.^{
[19]}

A closed strictly convex closed curve has a continuous
support function, mapping each direction of supporting lines to their signed distance from the origin. It is an example of a
hedgehog, a type of curve determined as the
envelope of a system of lines with a continuous support function. The hedgehogs also include non-convex curves, such as the
astroid, and even self-crossing curves, but the smooth strictly convex curves are the only hedgehogs that have no singular points.^{
[33]}

It is impossible for a convex curve to have three parallel tangent lines. More strongly, a smooth closed curve is convex if and only if it does not have three parallel tangent lines. In one direction, the middle of any three parallel tangent lines would separate the points of tangency of the other two lines, so it could not be a line of support. There could be no other line of support through its point of tangency, so a curve tangent to these three lines could not be convex. In the other direction, a non-convex smooth closed curve has at least one point with no support line. The tangent line through that point, and the two tangent supporting lines parallel to it, form a set of three parallel tangent lines.^{
[13]}^{
[d]}

According to the
four-vertex theorem, every smooth closed curve has at least four
vertices, points that are local minima or local maxima of
curvature.^{
[36]} The original proof of the theorem, by
Syamadas Mukhopadhyaya in 1909, considered only convex curves;^{
[37]} it was later extended to all smooth closed curves.^{
[36]}

Curvature can be used to characterize the smooth closed curves that are convex.^{
[13]} The curvature depends in a trivial way on the parameterization of the curve: if a regularly parameterization of a curve is reversed, the same set of points results, but its curvature is negated.^{
[5]} A smooth simple closed curve, with a regular parameterization, is convex if and only if its curvature has a consistent sign: always non-negative, or always non-positive.^{
[13]}^{
[e]} Every smooth simple closed curve with strictly positive (or strictly negative) curvature is strictly convex, but some strictly convex curves can have points with curvature zero.^{
[39]}

The total absolute curvature of a smooth convex curve,

is at most . It is exactly for closed convex curves, equalling the
total curvature of these curves, and of any simple closed curve. For convex curves, the equality of total absolute curvature and total curvature follows from the fact that the curvature has a consistent sign. For closed curves that are not convex, the total absolute curvature is always greater than , and its excess can be used as a measure of how far from convex the curve is. More generally, by
Fenchel's theorem, the total absolute curvature of a closed smooth
space curve is at least , with equality only for convex plane curves.

By the
Alexandrov theorem, a non-smooth convex curve has a second derivative, and therefore a well-defined curvature,
almost everywhere. This means that the subset of points without a second derivative has
measure zero in the curve. However, in other senses, the set of points with a second derivative can be small. In particular, for the graphs of generic non-smooth convex functions, it is a
meager set, that is, a countable union of
nowhere dense sets.^{
[42]}

The boundary of any
convex polygon forms a convex curve (one that is a
piecewise linear curve and not strictly convex). A polygon that is
inscribed in any strictly convex curve, with its vertices in order along the curve, must be a convex polygon.^{
[43]}

The
inscribed square problem is the problem of proving that every simple closed curve in the plane contains the four corners of a square. Although still unsolved in general, its solved cases include the convex curves.^{
[44]} In connection with this problem, related problems of finding inscribed quadrilaterals have been studied for convex curves. A scaled and rotated copy of any
rectangle or
trapezoid can be inscribed in any given closed convex curve. When the curve is smooth, a scaled and rotated copy of any
cyclic quadrilateral can be inscribed in it. However, the assumption of smoothness is necessary for this result, because some
right kites cannot be inscribed in some obtuse
isosceles triangles.^{
[45]}^{
[46]}
Regular polygons with more than four sides cannot be inscribed in all closed convex curves, because the curve formed by a
semicircle and its diameter does not contain any of these polygons.^{
[47]}

- Convex surface, the higher-dimensional generalization of convex curves
- List of convexity topics

**^**The assumption of smoothness is necessary when defining convex curves using tangent lines. There exist fractal curves, and even the graphs of continuous functions, that do not have any tangent lines, not even vertical or one-sided tangents.^{ [14]}For these curves it is vacuously true that they lie on one side of each tangent line, but they are not convex.**^**For a slab, the region between two parallel lines, the boundary is its two defining lines.^{ [15]}**^**Many spirals are also locally convex but do not form closed curves.^{ [9]}^{ [26]}Non-convex polygons are closed curves that are locally equivalent to the graphs of piecewise linear convex functions, but these functions are not strictly convex.^{ [27]}**^**There exist smooth open curves that do not have three parallel tangents but are not convex; the graph of any cubic polynomial is an example. For the graph of a function, the slope of any tangent line is the derivative of the function at that point,^{ [34]}and since the derivative of a cubic is a quadratic polynomial, it produces any given slope at most twice.^{ [35]}**^**Some non-simple closed curves such as the rose curves also have consistently-signed curvatures.^{ [38]}

- ^
^{a}^{b}Fenchel, W. (1983), "Convexity through the ages", in Gruber, Peter M.; Wills, Jörg M. (eds.),*Convexity and its Applications*, Basel: Birkhäuser, pp. 120–130, doi: 10.1007/978-3-0348-5858-8_6, MR 0731109 - ^
^{a}^{b}^{c}^{d}Dwilewicz, Roman J. (2009), "A short history of convexity" (PDF),*Differential Geometry—Dynamical Systems*,**11**: 112–129, MR 2533649 **^**Gruber, Peter M. (1993), "History of convexity", in Gruber, Peter M. (ed.),*Handbook of Convex Geometry, Volume A*, Amsterdam: North-Holland, pp. 1–15, ISBN 0-444-89598-1**^**Strantzen, John; Brooks, Jeff (1992), "A chord-stretching map of a convex loop is an isometry",*Geometriae Dedicata*,**41**(1): 51–62, doi: 10.1007/BF00181542, MR 1147501, S2CID 121294001- ^
^{a}^{b}^{c}Banchoff, Thomas F.; Lovett, Stephen T. (2016), "Chapter 1: Plane curves: local properties",*Differential Geometry of Curves and Surfaces*(2nd ed.), CRC Press, pp. 1–46, ISBN 978-1-4822-4737-4 **^**Moore, Robert L. (1920), "Concerning simple continuous curves",*Transactions of the American Mathematical Society*,**21**(3): 333–347, doi: 10.2307/1988935, JSTOR 1988935, MR 1501148**^**Veblen, Oswald (1931),*The Cambridge Colloquium, 1916, Part. II: Analysis Situs*, Colloquium Lectures, vol. 5, Providence, Rhode Island: American Mathematical Society, p. 3- ^
^{a}^{b}^{c}^{d}^{e}Toponogov, Victor A. (2006), "1.5 Problems: convex plane curves", in Rovenski, Vladimir Y (ed.),*Differential Geometry of Curves and Surfaces: A Concise Guide*, Birkhäuser, pp. 15–19, doi: 10.1007/b137116, ISBN 978-0-8176-4402-4 - ^
^{a}^{b}^{c}^{d}^{e}Latecki, Longin Jan; Rosenfeld, Azriel (March 1998), "Supportedness and tameness differentialless geometry of plane curves" (PDF),*Pattern Recognition*,**31**(5): 607–622, Bibcode: 1998PatRe..31..607L, doi: 10.1016/s0031-3203(97)00071-x - ^
^{a}^{b}Bourbaki, Nicolas (2004),*Functions of a Real Variable: Elementary Theory*, Elements of Mathematics, translated by Spain, Philip, Berlin: Springer-Verlag, p. 29, doi: 10.1007/978-3-642-59315-4, ISBN 3-540-65340-6, MR 2013000 **^**Rademacher, Hans; Toeplitz, Otto (1994),*The Enjoyment of Math*, Princeton Science Library, Princeton, New Jersey: Princeton University Press, p. 164, ISBN 0-691-02351-4, MR 1300411**^**Epstein, Charles L. (2008),*Introduction to the Mathematics of Medical Imaging*(2nd ed.), Society for Industrial and Applied Mathematics, p. 17, ISBN 978-0-89871-779-2- ^
^{a}^{b}^{c}^{d}Gray, Alfred; Abbena, Elsa; Salamon, Simon (2006), "6.4 Convex plane curves",*Modern Differential Geometry of Curves and Surfaces with Mathematica*(3rd ed.), Boca Raton, Florida: CRC Press, pp. 164–166, ISBN 978-1-58488-448-4; note that (per Definition 1.5, p. 5) this source assumes that the curves it describes are all piecewise smooth. **^**Ciesielski, Krzysztof Chris (2022), "Continuous maps admitting no tangent lines: a centennial of Besicovitch functions",*The American Mathematical Monthly*,**129**(7): 647–659, doi: 10.1080/00029890.2022.2071562, MR 4457737, S2CID 249140750**^**Preparata, Franco P.; Shamos, Michael Ian (1985), "2.2.2.1 The slab method",*Computational Geometry: An Introduction*, New York: Springer, pp. 45–48, doi: 10.1007/978-1-4612-1098-6, ISBN 978-1-4612-7010-2, S2CID 206656565**^**Latecki, Longin Jan (1998), "Basic Definitions and Propositions",*Discrete Representation of Spatial Objects in Computer Vision*, Computational Imaging and Vision, vol. 11, Springer Netherlands, pp. 33–43, doi: 10.1007/978-94-015-9002-0_2**^**Banchoff & Lovett (2016), p. 65.**^**Brinkhuis, Jan (2020), "Convex functions: basic properties",*Convex Analysis for Optimization*, Graduate Texts in Operations Research, Springer International Publishing, pp. 123–149, doi: 10.1007/978-3-030-41804-5_5, ISBN 978-3-030-41804-5, S2CID 218921797- ^
^{a}^{b}Hug, Daniel; Weil, Wolfgang (2020),*Lectures on Convex Geometry*, Graduate Texts in Mathematics, vol. 286, Cham: Springer, doi: 10.1007/978-3-030-50180-8, ISBN 978-3-030-50180-8, MR 4180684, S2CID 226548863; see in particular Theorem 1.16 (support theorem), p. 27, and exercise 16, p. 60 - ^
^{a}^{b}^{c}Polster, Burkard; Steinke, Günter (2001), "2.2.1 Convex curves, arcs, and ovals",*Geometries on surfaces*, Encyclopedia of Mathematics and its Applications, vol. 84, Cambridge University Press, pp. 31–34, doi: 10.1017/CBO9780511549656, ISBN 0-521-66058-0, MR 1889925 **^**Maehara, Hiroshi (2015), "Circle lattice point problem, revisited",*Discrete Mathematics*,**338**(3): 164–167, doi: 10.1016/j.disc.2014.11.004, MR 3291879**^**Hartmann, Erich; Feng, Yu Yu (1993), "On the convexity of functional splines",*Computer Aided Geometric Design*,**10**(2): 127–142, doi: 10.1016/0167-8396(93)90016-V, MR 1213308**^**Ha, Truong Xuan Duc; Jahn, Johannes (2019), "Characterizations of strictly convex sets by the uniqueness of support points",*Optimization*,**68**(7): 1321–1335, doi: 10.1080/02331934.2018.1476513, MR 3985200, S2CID 126177709**^**Garibaldi, Julia; Iosevich, Alex; Senger, Steven (2011),*The Erdős Distance Problem*, Student Mathematical Library, vol. 56, Providence, Rhode Island: American Mathematical Society, p. 51, doi: 10.1090/stml/056, ISBN 978-0-8218-5281-1, MR 2721878**^**Ricci, Fulvio; Travaglini, Giancarlo (2001), "Convex curves, Radon transforms and convolution operators defined by singular measures",*Proceedings of the American Mathematical Society*,**129**(6): 1739–1744, doi: 10.1090/S0002-9939-00-05751-8, MR 1814105**^**Umehara, Masaaki; Yamada, Kotaro (2017), "Chapter 4: Geometry of spirals",*Differential Geometry of Curves and Surfaces*, Hackensack, New Jersey: World Scientific Publishing, pp. 40–49, doi: 10.1142/9901, ISBN 978-981-4740-23-4, MR 3676571**^**Yurinsky, Vadim Vladimirovich (1995), "1.4.4 Piecewise-linear functions and polytopes",*Sums and Gaussian Vectors*, Lecture Notes in Mathematics, vol. 1617, Berlin & Heidelberg: Springer, pp. 24–27, doi: 10.1007/bfb0092599, ISBN 978-3-540-60311-5**^**Schwartzman, Steven (1994),*The Words of Mathematics: An Etymological Dictionary of Mathematical Terms Used in English*, MAA Spectrum, Mathematical Association of America, p. 156, ISBN 9780883855119**^**Johnson, Harold H.; Vogt, Andrew (1980), "A geometric method for approximating convex arcs",*SIAM Journal on Applied Mathematics*,**38**(2): 317–325, doi: 10.1137/0138027, MR 0564017**^**Arnold, V. I. (1989), "Topological proof of the transcendence of the abelian integrals in Newton's Principia",*Istoriko-Matematicheskie Issledovaniya*(31): 7–17, ISSN 0136-0949, MR 0993175**^**Swinnerton-Dyer, H. P. F. (1974), "The number of lattice points on a convex curve",*Journal of Number Theory*,**6**(2): 128–135, Bibcode: 1974JNT.....6..128S, doi: 10.1016/0022-314X(74)90051-1, MR 0337857**^**Kakeya, Sōichi (1915), "On some properties of convex curves and surfaces.",*Tohoku Mathematical Journal*,**8**: 218–221, JFM 45.1348.02**^**Martinez-Maure, Yves (2001), "A fractal projective hedgehog",*Demonstratio Mathematica*,**34**(1): 59–63, doi: 10.1515/dema-2001-0108, MR 1823083, S2CID 118211962**^**Abramson, Jay (2014), "3.1 Defining the derivative",*Precalculus*, OpenStax**^**Higgins, Peter M. (2008),*Number Story: From Counting to Cryptography*, London: Springer, p. 179, doi: 10.1007/978-1-84800-001-8, ISBN 978-1-84800-000-1- ^
^{a}^{b}DeTurck, Dennis; Gluck, Herman; Pomerleano, Daniel; Vick, David Shea (2007), "The four vertex theorem and its converse" (PDF),*Notices of the American Mathematical Society*,**54**(2): 9268, arXiv: math/0609268 **^**Mukhopadhyaya, S. (1909), "New methods in the geometry of a plane arc",*Bulletin of the Calcutta Mathematical Society*,**1**: 21–27**^**Cieślak, Waldemar; Zając, Józef (1986), "The rosettes",*Mathematica Scandinavica*,**58**(1): 114–118, doi: 10.7146/math.scand.a-12133, JSTOR 24491607, MR 0845490**^**Helton, J. William; Nie, Jiawang (2010), "Semidefinite representation of convex sets",*Mathematical Programming*,**122**(1, Ser. A): 21–64, arXiv: 0705.4068, doi: 10.1007/s10107-008-0240-y, MR 2533752, S2CID 1352703**^**Chen, Bang-Yen (2000), "Riemannian submanifolds", in Dillen, Franki J. E.; Verstraelen, Leopold C. A. (eds.),*Handbook of differential geometry, Vol. I*, Amsterdam: North-Holland, pp. 187–418, doi: 10.1016/S1874-5741(00)80006-0, MR 1736854; see in particular p. 360**^**Banchoff & Lovett (2016), p. 108.**^**Gruber, Peter M. (2007), "2.2: Alexandrov's theorem in second-order differentiability",*Convex and Discrete Geometry*, Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences], vol. 336, Berlin: Springer, pp. 27–32, ISBN 978-3-540-71132-2, MR 2335496**^**Milnor, J. W. (1950), "On the total curvature of knots",*Annals of Mathematics*, Second Series,**52**(2): 248–257, doi: 10.2307/1969467, JSTOR 1969467, MR 0037509; see discussion following Theorem 3.4 (Fenchel's theorem), p. 254**^**Stromquist, Walter (1989), "Inscribed squares and square-like quadrilaterals in closed curves",*Mathematika*,**36**(2): 187–197, doi: 10.1112/S0025579300013061, MR 1045781**^**Akopyan, Arseniy; Avvakumov, Sergey (2018), "Any cyclic quadrilateral can be inscribed in any closed convex smooth curve",*Forum of Mathematics*,**6**: Paper No. e7, 9, doi: 10.1017/fms.2018.7, MR 3810027, S2CID 111377310**^**Matschke, Benjamin (2021), "Quadrilaterals inscribed in convex curves",*Transactions of the American Mathematical Society*,**374**(8): 5719–5738, doi: 10.1090/tran/8359, MR 4293786, S2CID 119174856**^**Jerrard, R. P. (1961), "Inscribed squares in plane curves",*Transactions of the American Mathematical Society*,**98**(2): 234–241, doi: 10.1090/s0002-9947-1961-0120604-3, MR 0120604, S2CID 54091952