Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Concept
Diameter
Summary
In geometry, a diameter of a circle is any straight line segment that passes through the center of the circle and whose endpoints lie on the circle. It can also be defined as the longest chord of the circle. Both definitions are also valid for the diameter of a sphere.
In more modern usage, the length of a diameter is also called the diameter. In this sense one speaks of diameter rather than diameter (which refers to the line segment itself), because all diameters of a circle or sphere have the same length, this being twice the radius
For a convex shape in the plane, the diameter is defined to be the largest distance that can be formed between two opposite parallel lines tangent to its boundary, and the is often defined to be the smallest such distance. Both quantities can be calculated efficiently using rotating calipers. For a curve of constant width such as the Reuleaux triangle, the width and diameter are the same because all such pairs of parallel tangent lines have the same distance.
For an ellipse, the standard terminology is different. A diameter of an ellipse is any chord passing through the centre of the ellipse. For example, conjugate diameters have the property that a tangent line to the ellipse at the endpoint of one diameter is parallel to the conjugate diameter. The longest diameter is called the major axis.
The word "diameter" is derived from διάμετρος (), "diameter of a circle", from διά (), "across, through" and μέτρον (), "measure". It is often abbreviated or
Metric space#Diameter of a metric space
The definitions given above are only valid for circles, spheres and convex shapes. However, they are special cases of a more general definition that is valid for any kind of -dimensional (convex or non-convex) object, such as a hypercube or a set of scattered points. The or of a subset of a metric space is the least upper bound of the set of all distances between pairs of points in the subset.
Official source
About this result
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.
Ontological neighbourhood