Graph cuts in computer visionAs applied in the field of computer vision, graph cut optimization can be employed to efficiently solve a wide variety of low-level computer vision problems (early vision), such as , the stereo correspondence problem, , object co-segmentation, and many other computer vision problems that can be formulated in terms of energy minimization. Many of these energy minimization problems can be approximated by solving a maximum flow problem in a graph (and thus, by the max-flow min-cut theorem, define a minimal cut of the graph).
Bring's curveIn mathematics, Bring's curve (also called Bring's surface and, by analogy with the Klein quartic, the Bring sextic) is the curve in cut out by the homogeneous equations It was named by after Erland Samuel Bring who studied a similar construction in 1786 in a Promotionschrift submitted to the University of Lund. Note that the roots xi of the Bring quintic satisfies Bring's curve since for The automorphism group of the curve is the symmetric group S5 of order 120, given by permutations of the 5 coordinates.
Bolza surfaceIn mathematics, the Bolza surface, alternatively, complex algebraic Bolza curve (introduced by ), is a compact Riemann surface of genus with the highest possible order of the conformal automorphism group in this genus, namely of order 48 (the general linear group of matrices over the finite field ). The full automorphism group (including reflections) is the semi-direct product of order 96. An affine model for the Bolza surface can be obtained as the locus of the equation in .
Implicit curveIn mathematics, an implicit curve is a plane curve defined by an implicit equation relating two coordinate variables, commonly x and y. For example, the unit circle is defined by the implicit equation . In general, every implicit curve is defined by an equation of the form for some function F of two variables. Hence an implicit curve can be considered as the set of zeros of a function of two variables. Implicit means that the equation is not expressed as a solution for either x in terms of y or vice versa.
Minimal surface of revolutionIn mathematics, a minimal surface of revolution or minimum surface of revolution is a surface of revolution defined from two points in a half-plane, whose boundary is the axis of revolution of the surface. It is generated by a curve that lies in the half-plane and connects the two points; among all the surfaces that can be generated in this way, it is the one that minimizes the surface area. A basic problem in the calculus of variations is finding the curve between two points that produces this minimal surface of revolution.
CatenaryIn physics and geometry, a catenary (USˈkætənɛri, UKkəˈtiːnəri) is the curve that an idealized hanging chain or cable assumes under its own weight when supported only at its ends in a uniform gravitational field. The catenary curve has a U-like shape, superficially similar in appearance to a parabola, which it is not. The curve appears in the design of certain types of arches and as a cross section of the catenoid—the shape assumed by a soap film bounded by two parallel circular rings.
Natural topologyIn any domain of mathematics, a space has a natural topology if there is a topology on the space which is "best adapted" to its study within the domain in question. In many cases this imprecise definition means little more than the assertion that the topology in question arises naturally or canonically (see mathematical jargon) in the given context. Note that in some cases multiple topologies seem "natural". For example, if Y is a subset of a totally ordered set X, then the induced order topology, i.e.
