Minimum bounding circle may refer to:
 |
This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article. |
Wikimedia Foundation. 2010.
Bounding volume — A three dimensional model with its bounding box drawn in dashed lines. For building code compliance, see Bounding. In computer graphics and computational geometry, a bounding volume for a set of objects is a closed volume that completely contains … Wikipedia
Circumscribed circle — Circumscribed circle, C, and circumcenter, O, of a cyclic polygon, P In geometry, the circumscribed circle or circumcircle of a polygon is a circle which passes through all the vertices of the polygon. The center of this circle is called the… … Wikipedia
Smallest circle problem — The smallest circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n dimensional space, the… … Wikipedia
Director circle — An ellipse, its minimum bounding box, and its director circle. In geometry, the director circle of an ellipse or hyperbola (also called the orthoptic circle or Fermat–Apollonius circle) is a circle formed by the points where two perpendicular… … Wikipedia
Fermat–Apollonius circle — In geometry, the Fermat–Apollonius circle of an ellipse is a circle that circumscribes the minimum bounding box of the ellipse. It has the same center as the ellipse, with radius radic;( a 2 + b 2), where a and b are the semi major axis and semi… … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
List of combinatorial computational geometry topics — enumerates the topics of computational geometry that states problems in terms of geometric objects as discrete entities and hence the methods of their solution are mostly theories and algorithms of combinatorial character.See List of numerical… … Wikipedia
Ellipse — Elliptical redirects here. For the exercise machine, see Elliptical trainer. This article is about the geometric figure. For other uses, see Ellipse (disambiguation). Not to be confused with ellipsis. An ellipse obtained as the intersection of a… … Wikipedia
Proximity problems — is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of these problems stated in terms of points only are sometimes referred to as closest point problems[1], although the term… … Wikipedia
Differential geometry of surfaces — Carl Friedrich Gauss in 1828 In mathematics, the differential geometry of surfaces deals with smooth surfaces with various additional structures, most often, a Riemannian metric. Surfaces have been extensively studied from various perspectives:… … Wikipedia
