|
|
| Line 1: |
Line 1: |
| {{no footnotes|date=April 2013}}
| | It is time to address the slow computer issues even if you do not learn how. Just considering the computer is working thus slow or keeps freezing up; does not signify to not address the problem and fix it. You may or can not be aware which any computer owner should know that there are certain things that a computer requires to maintain the greatest performance. The sad truth is the fact that so many people whom own a system have no idea that it needs routine maintenance merely like their cars.<br><br>Registry is not also important to quick computer boot up, and crucial to the performance of the computer. If you have a registry error, you can face blue screen, freezing or even crash. It's important to frequently clean up the invalid, missing, junk registry keys to keep the computer healthy and running quick.<br><br>The 'registry' is a central database that shops information, settings and options for your computer. It's really the most usual reason why XP runs slow plus if you fix this issue, we may make your computer run a lot quicker. The problem is the fact that the 'registry' shops a great deal of settings and details regarding the PC... and considering Windows needs to employ a lot of of these settings, any corrupted or damaged ones might straight affect the speed of the program.<br><br>If you feel you don't have enough money at the time to upgrade, then the number one choice is to free up several area by deleting a few of the unwelcome files and folders.<br><br>One other way when arresting the 1328 error is to clean out a PC's registry. The registry is important because it happens to be where settings and files chosen by Windows for running are stored. As it is very frequently used, breakdowns plus cases of files getting corrupted are not uncommon. Additionally as a result of the technique it is actually configured, the "registry" gets saved in the wrong fashion continually, that makes the program run slow, ultimately causing your PC to suffer from a series of mistakes. The best system one may use in cleaning out registries is to employ a reliable [http://bestregistrycleanerfix.com/system-mechanic system mechanic] system. A registry cleaner will seek out plus repair corrupted registry files and settings permitting one's computer to run normally again.<br><br>2)Fix a Windows registry to speed up PC- The registry is a complex section of the computer which holds different kinds of information within the items you do on the computer each day. Coincidentally, over time the registry can become cluttered with info and/or may obtain some kind of virus. This is surprisingly critical plus we MUST get this issue fixed right away, otherwise you run the risk of your computer being permanently damage and/or the sensitive info (passwords, etc.) is stolen.<br><br>Google Chrome is my lifeline and to the day happily. My all settings and research connected bookmarks were saved inside Chrome plus stupidly I did not synchronize them with the Gmail to shop them online. I couldn't afford to install fresh variation plus sacrifice all my work settings. There was no method to retrieve the aged settings. The just choice left for me was to miraculously fix it browser in a means which all of the information and settings stored inside it are recovered.<br><br>If you like to have a computer with fast running speed, you'd better install a good registry cleaner to clean the useless files for we. As long as we take care of the computer, it may keep inside advantageous condition. |
| | |
| [[Image:Triangle.Centroid.svg|thumb|right|Centroid of a triangle]]
| |
| In [[mathematics]] and [[physics]], the '''centroid''' or '''geometric center''' of a two-dimensional region is, informally, the point at which a cardboard cut-out of the region could be perfectly balanced on the tip of a pencil (assuming uniform density and a uniform gravitational field). Formally, the centroid of a [[plane figure]] or two-dimensional shape is the [[arithmetic mean]] ("average") position of all the points in the shape. The definition extends to any object in ''n''-[[dimension]]al [[space (mathematics)|space]]: its centroid is the mean position of all the points in all of the coordinate directions.
| |
| | |
| While in geometry the term '''barycenter''' is a synonym for "centroid", in physics "barycenter" may also mean the physical [[center of mass]] or the center of gravity, depending on the context. The center of mass (and center of gravity in a uniform gravitational field) is the arithmetic mean of all points weighted by the local [[density]] or [[specific weight]]. If a physical object has uniform density, then its center of mass is the same as the centroid of its shape.
| |
| | |
| In [[geography]], the centroid of a radial projection of a region of the Earth's surface to sea level is known as the region's [[geographical center]].
| |
| | |
| == Properties ==
| |
| The geometric centroid of a [[convex set|convex]] object always lies in the object. A non-convex object might have a centroid that is outside the figure itself. The centroid of a [[Annulus (mathematics)|ring]] or a [[bowl (vessel)|bowl]], for example, lies in the object's central void.
| |
| | |
| If the centroid is defined, it is a [[fixed points of isometry groups in Euclidean space|fixed point of all isometries]] in its [[symmetry group]]. In particular, the geometric centroid of an object lies in the intersection of all its [[hyperplane]]s of [[symmetry]]. The centroid of many figures ([[regular polygon]], [[regular polyhedron]], [[cylinder (geometry)|cylinder]], [[rectangle]], [[rhombus]], [[circle (geometry)|circle]], [[sphere (geometry)|sphere]], [[ellipse]], [[ellipsoid]], [[Lamé curve|superellipse]], [[superellipsoid]], etc.) can be determined by this principle alone.
| |
| | |
| In particular, the centroid of a [[parallelogram]] is the meeting point of its two [[diagonal]]s. This is not true for other [[quadrilateral]]s.
| |
| | |
| For the same reason, the centroid of an object with [[translational symmetry]] is undefined (or lies outside the enclosing space), because a translation has no fixed point.
| |
| | |
| ==Triangle centroid==
| |
| | |
| The centroid of a triangle is the intersection of the three [[median (triangle)|medians]] of the triangle (each median connecting a vertex with the midpoint of the opposite side). It lies on the triangle's [[Euler line]], which also goes through various other key points including the [[orthocenter]] and the [[circumcenter]].<ref>{{harvtxt|Altshiller-Court|1925|p=101}}</ref><ref>{{harvtxt|Kay|1969|pp=18,189,225-226}}</ref>
| |
| | |
| Let ''M'' be any point in the plane of a triangle with vertices ''A, B,'' and ''C'' and centroid ''G''. Then the sum of the squared distances of ''M'' from the three vertices exceeds the sum of the squared distances of the centroid ''G'' from the vertices by three times the squared distance between ''M'' and ''G'':
| |
| | |
| :<math>MA^2+MB^2+MC^2=GA^2+GB^2+GC^2+3MG^2.</math><ref>{{harvtxt|Altshiller-Court|1925|pp=70-71}}</ref>
| |
| | |
| The sum of the squares of the triangle's sides equals three times the sum of the squared distances of the centroid from the vertices:
| |
| | |
| :<math>AB^2+BC^2+CA^2=3(GA^2+GB^2+GC^2).</math><ref>{{harvtxt|Altshiller-Court|1925|pp=70-71}}</ref>
| |
| | |
| For other properties of a triangle's centroid, see [[#Of triangle and tetrahedron|below]].
| |
| | |
| == Locating the centroid ==
| |
| === Plumb line method ===
| |
| The centroid of a uniform [[planar lamina]], such as (a) below, may be determined, experimentally, by using a [[plumbline]] and a pin to find the center of mass of a thin body of uniform density having the same shape. The body is held by the pin inserted at a point near the body's perimeter, in such a way that it can freely rotate around the pin; and the plumb line is dropped from the pin (b). The position of the plumbline is traced on the body. The experiment is repeated with the pin inserted at a different point of the object. The intersection of the two lines is the centroid of the figure (c).
| |
| | |
| {| cellpadding=3
| |
| |- valign=center
| |
| | [[File:Center gravity 0.svg|147px|center]]
| |
| | [[File:Center gravity 1.svg|183px|center]]
| |
| | [[File:Center gravity 2.svg|157px|center]]
| |
| |-
| |
| | align=center | (a)
| |
| | align=center | (b)
| |
| | align=center | (c)
| |
| |}
| |
| | |
| This method can be extended (in theory) to concave shapes where the centroid lies outside the shape, and to solids (of uniform density), but the positions of the plumb lines need to be recorded by means other than drawing.
| |
| | |
| === Balancing method ===
| |
| | |
| For convex two-dimensional shapes, the centroid can be found by balancing the shape on a smaller shape, such as the top of a narrow cylinder. The centroid occurs somewhere within the range of contact between the two shapes. In principle, progressively narrower cylinders can be used to find the centroid to arbitrary accuracy. In practice air currents make this unfeasible. However, by marking the overlap range from multiple balances, one can achieve a considerable level of accuracy.
| |
| | |
| === Of a finite set of points ===
| |
| The centroid of a finite set of <math>{k}</math> points <math>\mathbf{x}_1,\mathbf{x}_2,\ldots,\mathbf{x}_k</math> in <math>\mathbb{R}^n</math> is
| |
| :<math>\mathbf{C} = \frac{\mathbf{x}_1+\mathbf{x}_2+\cdots+\mathbf{x}_k}{k} </math>.<ref>{{harvtxt|Protter|Morrey, Jr.|1970|p=520}}</ref>
| |
| This point minimizes the sum of squared Euclidean distances between itself and each point in the set.
| |
| | |
| === By geometric decomposition ===
| |
| The centroid of a plane figure <math>X</math> can be computed by dividing it into a finite number of simpler figures <math>X_1,X_2,\dots,X_n</math>, computing the centroid <math>C_i</math> and area <math>A_i</math> of each part, and then computing
| |
| | |
| : <math> C_x = \frac{\sum C_{i_x} A_i}{\sum A_i} , C_y = \frac{\sum C_{i_y} A_i}{\sum A_i}</math>
| |
| | |
| Holes in the figure <math>X</math>, overlaps between the parts, or parts that extend outside the figure can all be handled using negative areas <math>A_i</math>. Namely, the measures <math>A_i</math> should be taken with positive and negative signs in such a way that the sum of the signs of <math>A_i</math> for all parts that enclose a given point <math>p</math> is 1 if <math>p</math> belongs to <math>X</math>, and 0 otherwise.
| |
| | |
| For example, the figure below (a) is easily divided into a square and a triangle, both with positive area; and a circular hole, with negative area (b).
| |
| {{multiple images
| |
| |align=center
| |
| |height=200
| |
| |direction=horizontal
| |
| |image1=COG 1.svg
| |
| |caption1=(a) 2D Object
| |
| |image2=COG 2.svg
| |
| |caption2=(b) Object described using simpler elements
| |
| |image3=COG 3.svg
| |
| |caption3=(c) Centroids of elements of the object
| |
| }}
| |
| The centroid of each part can be found in any [[list of centroids|list of centroids of simple shapes]] (c). Then the centroid of the figure is the weighted average of the three points. The horizontal position of the centroid, from the left edge of the figure is
| |
| :<math>x = \frac{5 \times 10^2 + 13.33 \times \frac{1}{2}10^2 - 3 \times \pi2.5^2}{10^2 + \frac{1}{2}10^2 -\pi2.5^2} \approx 8.5 \mbox{ units}.</math>
| |
| The vertical position of the centroid is found in the same way.
| |
| | |
| The same formula holds for any three-dimensional objects, except that each <math>A_i</math> should be the volume of <math>X_i</math>, rather than its area. It also holds for any subset of <math>\R^d</math>, for any dimension <math>d</math>, with the areas replaced by the <math>d</math>-dimensional [[measure (mathematics)|measure]]s of the parts.
| |
| | |
| === By integral formula ===
| |
| The centroid of a subset ''X'' of <math>\R^n</math> can also be computed by the [[integral]] | |
| | |
| :<math>C = \frac{\int x g(x) \; dx}{\int g(x) \; dx}</math>
| |
| | |
| where the integrals are taken over the whole space <math>\R^n</math>, and ''g'' is the [[Indicator function|characteristic function]] of the subset, which is 1 inside ''X'' and 0 outside it.<ref>{{harvtxt|Protter|Morrey, Jr.|1970|p=526}}</ref> Note that the denominator is simply the [[measure (mathematics)|measure]] of the set ''X''. This formula cannot be applied if the set ''X'' has zero measure, or if either integral diverges.
| |
| | |
| Another formula for the centroid is
| |
| | |
| :<math>C_k = \frac{\int z S_k(z) \; dz}{\int S_k(z) \; dz}</math>
| |
| | |
| where ''C''<sub>''k''</sub> is the ''k''th coordinate of ''C'', and ''S''<sub>''k''</sub>(''z'') is the measure of the intersection of ''X'' with the hyperplane defined by the equation ''x''<sub>''k''</sub> = ''z''. Again, the denominator is simply the measure of ''X''. | |
| | |
| For a plane figure, in particular, the barycenter coordinates are
| |
| | |
| :<math>C_{\mathrm x} = \frac{\int x S_{\mathrm y}(x) \; dx}{A}</math>
| |
| | |
| :<math>C_{\mathrm y} = \frac{\int y S_{\mathrm x}(y) \; dy}{A}</math>
| |
| | |
| where ''A'' is the area of the figure ''X''; ''S''<sub>y</sub>(''x'') is the length of the intersection of ''X'' with the vertical line at [[abscissa]] ''x''; and ''S''<sub>x</sub>(''y'') is the analogous quantity for the swapped axes.
| |
| | |
| ==== Bounded region ====
| |
| | |
| The centroid <math>(\bar{x},\;\bar{y})</math> of a region bounded by the graphs of the [[continuous function]]s <math>f</math> and <math>g</math> such that <math>f(x) \geq g(x)</math> on the interval <math>[a, b]</math>, <math>a \leq x \leq b</math>, is given by
| |
| | |
| :<math>\bar{x}=\frac{1}{A}\int_a^b x[f(x) - g(x)]\;dx</math>
| |
| :<math>\bar{y}=\frac{1}{A}\int_a^b \left[\frac{f(x) + g(x)}{2}\right][f(x) - g(x)]\;dx,</math> | |
| | |
| where <math>A</math> is the area of the region (given by <math>\int_a^b [f(x) - g(x)]\;dx</math>).<ref>{{harvtxt|Larson|1998|pp=458–460}}</ref>
| |
| | |
| ===== Example =====
| |
| [[File:Semicircle radius 1 centroid.svg|300px|thumb|Semicircle with a red dot showing the centroid]]
| |
| | |
| Consider the semicircle bounded by <math>f(x)=\sqrt{1-x^2}</math> and <math>g(x)=0</math>. Its area is <math>A=\frac{\pi r^2}{2}=\frac{\pi}{2}</math>.
| |
| | |
| :<math>\bar{x}=\frac{1}{A}\int_a^b x[f(x) - g(x)]\;dx=\frac{2}{\pi}\int_{-1}^1 x\sqrt{1-x^2}\;dx=0</math>
| |
| :<math>\bar{y}=\frac{1}{A}\int_0^1 2y\sqrt{1-y^2}\;dy=\frac{-2}{3A} (1-y^2)^{\frac{3}{2}}|^1_0=\frac{4}{3\pi}</math>
| |
| | |
| The centroid is located at <math>(0,\;\frac{4}{3\pi})</math>. | |
| | |
| === Of an L-shaped object ===
| |
| This is a method of determining the centroid of an L-shaped object.
| |
| | |
| [[Image:CoG of L shape.svg|600px|CG of L-shaped object]]
| |
| | |
| #Divide the shape into two rectangles, as shown in fig 2. Find the centroids of these two rectangles by drawing the diagonals. Draw a line joining the centroids. The centroid of the shape must lie on this line AB.
| |
| #Divide the shape into two other rectangles, as shown in fig 3. Find the centroids of these two rectangles by drawing the diagonals. Draw a line joining the centroids. The centroid of the L-shape must lie on this line CD.
| |
| #As the centroid of the shape must lie along AB and also along CD, it is obvious that it is at the intersection of these two lines, at O. The point O might ''not'' lie inside the L-shaped object.
| |
| | |
| === Of triangle and tetrahedron ===
| |
| {| align="right" border="0" cellspacing="0" cellpadding="0"
| |
| |-
| |
| | [[Image:Triangle centroid 1.svg]] [[Image:Triangle centroid 2.svg]]
| |
| |}
| |
| | |
| The centroid of a [[triangle]] is the point of intersection of its [[median (geometry)|medians]] (the lines joining each [[vertex (geometry)|vertex]] with the midpoint of the opposite side). The centroid divides each of the medians in the [[ratio]] 2:1, which is to say it is located ⅓ of the perpendicular distance between each side and the opposing point (see figures at right). Its [[Cartesian coordinates]] are the [[arithmetic mean|means]] of the coordinates of the three vertices. That is, if the three vertices are <math>a = (x_a, y_a)</math>, <math>b = (x_b, y_b)</math>, and <math>c = (x_c, y_c)</math>, then the centroid is
| |
| | |
| :<math>
| |
| C = \frac13(a+b+c) = \left(\frac13 (x_a+x_b+x_c),\;\;
| |
| \frac13(y_a+y_b+y_c)\right).</math>
| |
| | |
| The centroid is therefore at <math>\left(\frac13,\frac13,\frac13\right)</math> in [[Barycentric coordinates (mathematics)|barycentric coordinates]].
| |
| | |
| The centroid is also the physical center of mass if the triangle is made from a uniform sheet of material; or if all the mass is concentrated at the three vertices, and evenly divided among them. On the other hand, if the mass is distributed along the triangle's perimeter, with uniform [[linear density]], then the center of mass lies at the [[Spieker center]] (the [[incenter]] of the [[medial triangle]]), which does not (in general) coincide with the geometric centroid of the full triangle.
| |
| | |
| The area of the triangle is 1.5 times the length of any side times the perpendicular distance from the side to the centroid.<ref>{{harvtxt|Johnson|2007|p=173}}</ref>
| |
| | |
| A triangle's centroid lies on its [[Euler line]] between its [[orthocenter]] and its [[circumcenter]], exactly twice as close to the latter as to the former.
| |
| | |
| Similar results hold for a [[tetrahedron]]: its centroid is the intersection of all line segments that connect each vertex to the centroid of the opposite face. These line segments are divided by the centroid in the ratio 3:1. The result generalizes to any ''n''-dimensional [[simplex]] in the obvious way. If the set of vertices of a simplex is <math>{v_0,\ldots,v_n}</math>, then considering the vertices as [[vector (geometry)|vectors]], the centroid is
| |
| | |
| :<math>C = \frac{1}{n+1}\sum_{i=0}^n v_i.</math>
| |
| | |
| The geometric centroid coincides with the center of mass if the mass is uniformly distributed over the whole simplex, or concentrated at the vertices as ''n'' equal masses.
| |
| | |
| The [[isogonal conjugate]] of a triangle's centroid is its [[symmedian|symmedian point]].
| |
| | |
| === Centroid of polygon ===
| |
| The centroid of a non-self-intersecting closed polygon defined by ''n'' vertices (''x''<sub>0</sub>,''y''<sub>0</sub>), (''x''<sub>1</sub>,''y''<sub>1</sub>), ..., (''x''<sub>''n''−1</sub>,''y''<sub>''n''−1</sub>) is the point (''C''<sub>x</sub>, ''C''<sub>y</sub>), where
| |
| | |
| : <math>C_{\mathrm x} = \frac{1}{6A}\sum_{i=0}^{n-1}(x_i+x_{i+1})(x_i\ y_{i+1} - x_{i+1}\ y_i)</math>
| |
| | |
| : <math>C_{\mathrm y} = \frac{1}{6A}\sum_{i=0}^{n-1}(y_i+y_{i+1})(x_i\ y_{i+1} - x_{i+1}\ y_i)</math>
| |
| | |
| and where ''A'' is the polygon's signed area, | |
| | |
| : <math>A = \frac{1}{2}\sum_{i=0}^{n-1} (x_i\ y_{i+1} - x_{i+1}\ y_i)\;</math>.<ref>{{harvtxt|Bourke|July 1997}}</ref>
| |
| | |
| In these formulas, the vertices are assumed to be numbered in order of their occurrence along the polygon's perimeter, and the vertex ( ''x''<sub>''n''</sub>, ''y''<sub>''n''</sub> ) is assumed to be the same as ( ''x''<sub>0</sub>, ''y''<sub>0</sub> ). Note that if the points are numbered in clockwise order the area ''A'', computed as above, will have a negative sign; but the centroid coordinates will be correct even in this case.
| |
| | |
| === Centroid of cone or pyramid ===
| |
| The centroid of a cone or pyramid is located on the line segment that connects the [[Apex (geometry)|apex]] to the centroid of the base. For a solid cone or pyramid, the centroid is 1/4 the distance from the base to the apex. For a cone or pyramid that is just a shell (hollow) with no base, the centroid is 1/3 the distance from the base plane to the apex.
| |
| | |
| == See also ==
| |
| * [[Chebyshev center]]
| |
| * [[Fréchet mean]]
| |
| * [[K-means algorithm]]
| |
| * [[List of centroids]]
| |
| * [[Pappus's centroid theorem]]
| |
| * [[Triangle center]]
| |
| | |
| ==Notes==
| |
| <references/>
| |
| | |
| == References ==
| |
| {{Refimprove|date=August 2010}}
| |
| * {{ citation | first1 = Nathan | last1 = Altshiller-Court | year = 1925 | lccn = 52-13504 | title = College Geometry: An Introduction to the Modern Geometry of the Triangle and the Circle | edition = 2nd | publisher = [[Barnes and Noble]] | location = New York }}
| |
| * {{ cite web | url = http://paulbourke.net/geometry/polygonmesh | last = Bourke | first = Paul | title = Calculating the area and centroid of a polygon | date = July 1997 }}
| |
| * {{ citation | first = Roger A. | last1 = Johnson | title = Advanced Euclidean Geometry | publisher = [[Dover]] | year = 2007 }}
| |
| * {{ citation | first1 = David C. | last1 = Kay | year = 1969 | lccn = 69-12075 | title = College Geometry | publisher = [[Holt, Rinehart and Winston]] | location = New York }}
| |
| * {{ citation | last1 = Larson | first1 = Roland E. | last2 = Hostetler | first2 = Robert P. | last3 = Edwards |first3 = Bruce H. | title = Calculus of a Single Variable | year = 1998 | publisher = [[Houghton Mifflin Company]] | edition = 6th }}
| |
| * {{ citation | first1 = Murray H. | last1 = Protter | first2 = Charles B. | last2 = Morrey, Jr. | year = 1970 | lccn = 76-87042 | title = College Calculus with Analytic Geometry | edition = 2nd | publisher = [[Addison-Wesley]] | location = Reading }}
| |
| | |
| == External links ==
| |
| *[http://faculty.evansville.edu/ck6/encyclopedia/ETC.html ''Encyclopedia of Triangle Centers''] by Clark Kimberling. The centroid is indexed as X(2).
| |
| * [http://www.cut-the-knot.org/triangle/CharacteristicPropertyOfCentroid.shtml Characteristic Property of Centroid] at [[cut-the-knot]]
| |
| * [http://www.cut-the-knot.org/triangle/barycenter.shtml Barycentric Coordinates] at [[cut-the-knot]]
| |
| * Interactive animations showing [http://www.mathopenref.com/trianglecentroid.html Centroid of a triangle] and [http://www.mathopenref.com/constcentroid.html Centroid construction with compass and straightedge]
| |
| * [http://dynamicmathematicslearning.com/findingtrianglemedian.html Experimentally finding the medians and centroid of a triangle] at [http://dynamicmathematicslearning.com/JavaGSPLinks.htm Dynamic Geometry Sketches], an interactive dynamic geometry sketch using the gravity simulator of Cinderella.
| |
| | |
| [[Category:Affine geometry]]
| |
| [[Category:Geometric centers]]
| |
| [[Category:Means]]
| |
| [[Category:Triangle centers]]
| |