![]() See Fekete, Mitchell & Beurer (2005) for generalizations of the problem to non-discrete point sets. Wesolowsky (1993) provides a survey of the geometric median problem. Some sources instead call Weber's problem the Fermat–Weber problem, but others use this name for the unweighted geometric median problem. The geometric median may in turn be generalized to the problem of minimizing the sum of weighted distances, known as the Weber problem after Alfred Weber's discussion of the problem in his 1909 book on facility location. Its solution is now known as the Fermat point of the triangle formed by the three sample points. The special case of the problem for three points in the plane (that is, m = 3 and n = 2 in the definition below) is sometimes also known as Fermat's problem it arises in the construction of minimal Steiner trees, and was originally posed as a problem by Pierre de Fermat and solved by Evangelista Torricelli. If the point is generalized into a line or a curve, the best-fitting solution is found via least absolute deviations. The more general k-median problem asks for the location of k cluster centers minimizing the sum of distances from each sample point to its nearest center. It is also a standard problem in facility location, where it models the problem of locating a facility to minimize the cost of transportation. The geometric median is an important estimator of location in statistics, where it is also known as the L 1 estimator (after the L 1 norm). ![]() It is also known as the 1-median, spatial median, Euclidean minisum point, or Torricelli point. This generalizes the median, which has the property of minimizing the sum of distances for one-dimensional data, and provides a central tendency in higher dimensions. Cuidado con figuras como el trapecio, cuyo dos lados paralelos se llaman base. Una vez elegida su posición, de manera arbitraria independientemente de cualquier representación y si tenemos en cuenta la altura relativa, podemos calcular su área hay que jugar con cubos. In geometry, the geometric median of a discrete set of sample points in a Euclidean space is the point minimizing the sum of distances to the sample points. Esta es una afirmación de carácter general para cualquier triángulo. Example of geometric median (in yellow) of a series of points. ![]() Not to be confused with Median (geometry) or Geometric mean. Las medianas tienen las siguientes propiedades: Cada mediana divide al triángulo en dos regiones de igual área, por ejemplo para el caso de la mediana AI (véase la figura) dichas regiones son los dos triángulos ABI y ACI de igual área. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |