Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Diameter (computational geometry)
open-in-new
<p> In <a href="/facts/Computational_geometry/eeaotQtl">computational geometry</a>, the diameter of a <a href="/facts/Finite_set/za1newlP">finite set</a> of points or of a <a href="/facts/Polygon/yAq7RjPz">polygon</a> is its <a href="/facts/Diameter_of_a_set/G9YWL7lY">diameter as a set</a>, the largest distance between any two points. The diameter is always attained by two points of the <a href="/facts/Convex_hull/D4Id3JDS">convex hull</a> of the input. A trivial <a href="/facts/Brute-force_search/YU2fzBIt">brute-force search</a> can be used to find the diameter of n {\displaystyle n} points in time O ( n 2 ) {\displaystyle O(n^{2})} (assuming constant-time distance evaluations) but faster algorithms are possible for points in low dimensions. </p>