In geometry, a circumscribed sphere of a polyhedron is a sphere that contains the polyhedron and touches each of the polyhedron's vertices. The word circumsphere is sometimes used to mean the same thing, by analogy with the term circumcircle. As in the case of two-dimensional circumscribed circles (circumcircles), the radius of a sphere circumscribed around a polyhedron P is called the circumradius of P, and the center point of this sphere is called the circumcenter of P.
When it exists, a circumscribed sphere need not be the smallest sphere containing the polyhedron; for instance, the tetrahedron formed by a vertex of a cube and its three neighbors has the same circumsphere as the cube itself, but can be contained within a smaller sphere having the three neighboring vertices on its equator. However, the smallest sphere containing a given polyhedron is always the circumsphere of the convex hull of a subset of the vertices of the polyhedron.
In De solidorum elementis (circa 1630), René Descartes observed that, for a polyhedron with a circumscribed sphere, all faces have circumscribed circles, the circles where the plane of the face meets the circumscribed sphere. Descartes suggested that this necessary condition for the existence of a circumscribed sphere is sufficient, but it is not true: some bipyramids, for instance, can have circumscribed circles for their faces (all of which are triangles) but still have no circumscribed sphere for the whole polyhedron. However, whenever a simple polyhedron has a circumscribed circle for each of its faces, it also has a circumscribed sphere.
The circumscribed sphere is the three-dimensional analogue of the circumscribed circle.
All regular polyhedra have circumscribed spheres, but most irregular polyhedra do not have one, since in general not all vertices lie on a common sphere. The circumscribed sphere (when it exists) is an example of a bounding sphere, a sphere that contains a given shape. It is possible to define the smallest bounding sphere for any polyhedron, and compute it in linear time.
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.
In geometry, the circumscribed circle or circumcircle of a triangle is a circle that passes through all three vertices. The center of this circle is called the circumcenter of the triangle, and its radius is called the circumradius. The circumcenter is the point of intersection between the three perpendicular bisectors of the triangle's sides, and is a triangle center. More generally, an n-sided polygon with all its vertices on the same circle, also called the circumscribed circle, is called a cyclic polygon, or in the special case n = 4, a cyclic quadrilateral.
In geometry, the midsphere or intersphere of a convex polyhedron is a sphere which is tangent to every edge of the polyhedron. Not every polyhedron has a midsphere, but the uniform polyhedra, including the regular, quasiregular and semiregular polyhedra and their duals all have midspheres. The radius of the midsphere is called the midradius. A polyhedron that has a midsphere is said to be midscribed about this sphere.
In geometry, the inscribed sphere or insphere of a convex polyhedron is a sphere that is contained within the polyhedron and tangent to each of the polyhedron's faces. It is the largest sphere that is contained wholly within the polyhedron, and is dual to the dual polyhedron's circumsphere. The radius of the sphere inscribed in a polyhedron P is called the inradius of P. All regular polyhedra have inscribed spheres, but most irregular polyhedra do not have all facets tangent to a common sphere, although it is still possible to define the largest contained sphere for such shapes.
Given an integral polyhedron P subset of R-n and a rational polyhedron Q subset of R-n containing the same integer points as P, we investigate how many iterations of the Chvatal-Gomory closure operator have to be performed on Q to obtain a polyhedron conta ...
Following a recent effort [J. Am. Soc. Mass Spectrom. 23, 386-396 (2012)], we continue to explore computational methodologies for generating molecular conformations to support collisional cross sections suggested by ion mobility measurements. Here, adaptiv ...