An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and Its Application to Kernel Machines

Total Page:16

File Type:pdf, Size:1020Kb

An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and Its Application to Kernel Machines An Algorithm for the Exact Computation of the Centroid of Higher Dimensional Polyhedra and its Application to Kernel Machines Frederic Maire Smart Devices Laboratory, School of SEDC, IT Faculty, Queensland University of Technology, 2 George Street, GPO Box 2434, Brisbane Q 4001, Australia. Abstract (SVM) returns the central direction wsvm (a unit vector) of the largest spheric cone contained in the polyhedral cone i The Support Vector Machine (SVM) solution corre- w|∀i ∈ [1,m] , w, yiφ(x ) ≥ 0 . The weight vector sponds to the centre of the largest sphere inscribed in ver- wsvm can be expressed as a linear combination of the vec- i sion space. Alternative approaches like Bayesian Point tors yiφ(x )’s. That is, there exist (α1,...,αm) such that m i Machines (BPM) and Analytic Centre Machines have sug- wsvm = i=1 αiyiφ(x ). gested that the generalization performance can be further The Kernel trick is that for some feature spaces and map- enhanced by considering other possible centres of version pings φ, there exist easily computable kernel functions k de- space like the centroid (centre of mass) or the analytic cen- fined on the input space such that k(x, y)=φ(x),φ(y). tre. We present an algorithm to compute exactly the cen- A new input vector x is classified with the sign of troid of higher dimensional polyhedra, then derive approx- m m imation algorithms to build a new learning machine whose i i wsvm,x = αiyi φ(x ),φ(x) = αiyik(x ,x) performance is comparable to BPM. We also show that for i=1 i=1 regular kernel matrices (Gaussian kernels for example), the k SVM solution can be obtained by solving a linear system of With a kernel function , the computation of inner prod- φ(x),φ(y) equalities. ucts does not require the explicit knowledge of φ. In fact for a given kernel function k, there may exist many suitable mappings φ. Bayes Point Machines (BPM) are a well-founded im- 1. Introduction provement over to SVM which approximate the Bayes- optimal decision by the centroid (also known as the cen- In the Kernel Machine framework [5, 8], a feature map- tre of mass or barycentre) of version space. It happens ping x →φ(x) from an input space to a feature space is that the Bayes point is very close to the centroid of ver- given (generally, implicitly via a kernel function), as well sion space in high dimensional spaces. The Bayes point as a training set T of pattern vectors and their class la- achieves better generalization performance in comparison 1 m bels (x ,y1),...,(x ,ym) where the class labels are in to SVM [6, 9, 1, 10]. {−1, +1}. The learning problem is formulated as a search An intuitive way to see why the centroid is a good choice problem for a linear classifier (a weight vector w)inthe is to view version space as a (infinite) committee of experts feature space. Because only the direction of w matters for who all are consistent with the training set. A new and un- classification purpose, without loss of generality, we can re- labelled input vector corresponds to a hyperplane in feature strict the search for w to the unit sphere. The set of weight space that may split version space in two. It is reasonable vectors w that classify correctly the training set is called to use the opinion of the majority of the experts that were version space and denoted by V(T ). Version space is the consistent with the training set to predict the class label of region of feature space defined as the intersection of the a new pattern. The expert that agrees the most with the ma- unit sphere and the polyhedral cone of the feature space jority vote on new inputs is precisely the Bayesian point. i w|∀i ∈ [1,m] , w, yiφ(x ) ≥ 0 . In a standard committee machine, for each new input we The training algorithm of a Support Vector Machine seek the opinions of a finite number of experts then take a Proceedings of the Third IEEE International Conference on Data Mining (ICDM’03) 0-7695-1978-4/03 $ 17.00 © 2003 IEEE majority vote, whereas with a BPM, the expert that most of- Gh of its intersection with the hyperplane xn = h by the ten agrees with the majority vote of the infinite committee following equalities; (version space) is delegated the task of classifying the new inputs. h h x n−1 h Following Rujan [7], Herbrich and Graepel [2] intro- V = V dx = V × dx = × V duced two algorithms to stochastically approximate the cen- x h h n h 0 0 troid of version space; a billiard sampling algorithm and a −−→ h −−→ sampling algorithm based on the well known perceptron al- V × OG = OGx × Vx × dx 0 gorithm. −−→ n −−→ OG = × OG In this paper, we present an algorithm to compute exactly n +1 h the centroid of a polyhedron in high dimensional spaces. From this exact algorithm, we derive an algorithm to ap- proximate a centroid position in a polyhedral cone. We The above formulae were derived by considering the n-fold show empirically that the corresponding machine presents integral defining the n-dimensional volume. These formu- better generalization capability than SVMs on a number a lae allow a recursive computation of the centroid of a poly- benchmark data sets. hedron P by partitioning P into polyhedral cones generated In Section 2, we introduce an algorithm to compute ex- by its facets. actly the centroid of higher dimensional polyhedra. In Sec- tion 3, we show a simple algorithm to compute the SVM so- It is useful to observe that the computation of the vol- lution of regular kernels. In Section 4, we sketch the idea of ume and the centroid of a (n − 1)-dimensional polyhedron Balancing Board Machines. In Section 5, some implemen- in a n-dimensional space is identical to the computation of tation issues are considered and some experimental results the volume and the centroid of a facet of a n-dimensional are presented. polyhedron. 2. Exact Computation of the Centroid of a Algorithm 1 [G, V ] P Higher Dimensional Polyhedron =measurePolyhedron( ) Require: P = {x | Ax ≤ b} non-empty and irredundant Ensure: G is the centroid of P ,andV its volume A polyhedron P is the intersection of a finite number of {m is the number of rows of A, n is its number of half-spaces. It is best represented by a system of non redun- columns} dant linear inequalities P = {x|Ax ≤ b}. Recall that the 1- for i =1to m do volume is the length, the 2-volume is the surface and the 3- {Compute recursively the centroids GF and the (n − volume is the every-day-life volume. The algorithm that we i 1)-volumes VF of each facet Fi of P } introduce for computing the centroid of an n-dimensional i [GF ,VF ]=measurePolyhedron(Fi) polyhedron is an extension of the work by Lasserre [4] i i end for who showed that the n-dimensional volume V (n, A, b) of {Compute GE, the centroid of the envelope of P } a polyhedron P is related to the (n − 1)-dimensional vol- V G = Fi × G E i V Fi umes of its facets and the row vectors of its matrix A by the j Fj following formula; for i =1to m do { G (n − Compute recursively the centroids Ci and the 1 bi 1) V C = (G ,F ) V (n, A, b)= × V (n − 1,A,b) -volumes Ci of each cone i cone E i n a i G F } i i rooted at E and generated by i Compute hi, the distance form GE to the hyperplane th where ai denotes the i row of A and Vi(n − 1,A,b) containing Fi th V = hi × V denotes the (n − 1)-dimensional volume of the i facet Ci n Fi T −−−−→ n −−−−→ P ∩{x|ai x = bi}. We obtain the centroid and the (n−1)- G G = × G G E Ci n+1 E Fi volume of a facet by variable elimination. Geometrically, end for this amounts to projecting the facet onto an axis parallel V = V i Ci V hyperplane, then computing the volume and the centroid Ci G = × GC of this projection recursively in a lower dimensional space. i V i From the volume and centroid of the projected facet, we can derive the centroid and volume of the original facet. The n-volume V and the centroid G of a cone rooted The Matlab code for this algorithm is available at at 0 are related to the (n − 1)-volume Vh and the centroid http://www.fit.qut.edu.au/∼maire/G Proceedings of the Third IEEE International Conference on Data Mining (ICDM’03) 0-7695-1978-4/03 $ 17.00 © 2003 IEEE 3. Computing the Spheric Centre of a Poly- formulae allow us to derive an approximation of the volume hedral Cone Derived from a Non Singular and the centroid of a polyhedron once we have approxima- Mercer Kernel Matrix tions for the volumes and the centroids of its facets. Because the balancing board algorithm requires several board centroid estimations, it is desirable to recycle inter- P = {x|Ax ≤ 0} Let be the non-empty polyhedral cone mediate results as much as possible to achieve a significant A derived from a non-singular kernel matrix. The matrix is reduction in computation time. Because the intersection of m = n square ( ).
Recommended publications
  • Center of Mass and Centroids
    Center of Mass and Centroids Center of Mass A body of mass m in equilibrium under the action of tension in the cord, and resultant W of the gravitational forces acting on all particles of the body. -The resultant is collinear with the cord Suspend the body at different points -Dotted lines show lines of action of the resultant force in each case. -These lines of action will be concurrent at a single point G As long as dimensions of the body are smaller compared with those of the earth. - we assume uniform and parallel force field due to the gravitational attraction of the earth. The unique Point G is called the Center of Gravity of the body (CG) ME101 - Division III Kaustubh Dasgupta 1 Center of Mass and Centroids Determination of CG - Apply Principle of Moments Moment of resultant gravitational force W about any axis equals sum of the moments about the same axis of the gravitational forces dW acting on all particles treated as infinitesimal elements. Weight of the body W = ∫dW Moment of weight of an element (dW) @ x-axis = ydW Sum of moments for all elements of body = ∫ydW From Principle of Moments: ∫ydW = ӯ W Moment of dW @ z axis??? xdW ydW zdW x y z = 0 or, 0 W W W Numerator of these expressions represents the sum of the moments; Product of W and corresponding coordinate of G represents the moment of the sum Moment Principle. ME101 - Division III Kaustubh Dasgupta 2 Center of Mass and Centroids xdW ydW zdW x y z Determination of CG W W W Substituting W = mg and dW = gdm xdm ydm zdm x y z m m m In vector notations:
    [Show full text]
  • Dynamics of Urban Centre and Concepts of Symmetry: Centroid and Weighted Mean
    Jong-Jin Park Research École Polytechnique Fédérale de Dynamics of Urban Centre and Lausanne (EPFL) Laboratoire de projet urbain, Concepts of Symmetry: territorial et architectural (UTA) Centroid and Weighted Mean BP 4137, Station 16 CH-1015 Lausanne Presented at Nexus 2010: Relationships Between Architecture SWITZERLAND and Mathematics, Porto, 13-15 June 2010. [email protected] Abstract. The city is a kind of complex system being capable Keywords: evolving structure, of auto-organization of its programs and adapts a principle of urban system, programmatic economy in its form generating process. A new concept of moving centre, centroid, dynamic centre in urban system, called “the programmatic weighted mean, symmetric moving centre”, can be used to represent the successive optimization, successive appearances of various programs based on collective facilities equilibrium and their potential values. The absolute central point is substituted by a magnetic field composed of several interactions among the collective facilities and also by the changing value of programs through time. The center moves continually into this interactive field. Consequently, we introduce mathematical methods of analysis such as “the centroid” and “the weighted mean” to calculate and visualize the dynamics of the urban centre. These methods heavily depend upon symmetry. We will describe and establish the moving centre from a point of view of symmetric optimization that answers the question of the evolution and successive equilibrium of the city. In order to explain and represent dynamic transformations in urban area, we tested this programmatic moving center in unstable and new urban environments such as agglomeration areas around Lausanne in Switzerland.
    [Show full text]
  • Chapter 5 –3 Center and Centroids
    ENGR 0135 Chapter 5 –3 Center and centroids Department of Mechanical Engineering Centers and Centroids Center of gravity Center of mass Centroid of volume Centroid of area Centroid of line Department of Mechanical Engineering Center of Gravity A point where all of the weight could be concentrated without changing the external effects of the body To determine the location of the center, we may consider the weight system as a 3D parallel force system Department of Mechanical Engineering Center of Gravity – discrete bodies The total weight isWW i The location of the center can be found using the total moments 1 M Wx W x xW x yz G i i G W i i 1 M Wy W y yW y zx G i i G W i i 1 M Wz W z z W z xy G i i G W i i Department of Mechanical Engineering Center of Gravity – continuous bodies The total weight Wis dW The location of the center can be found using the total moments 1 M Wx xdW x xdW yz G G W 1 M Wy ydW y ydW zx G G W 1 M Wz zdW z zdW xy G G W Department of Mechanical Engineering Center of Mass A point where all of the mass could be concentrated It is the same as the center of gravity when the body is assumed to have uniform gravitational force Mass of particles 1 n 1 n 1 n n xC xi m i C y yi m i C z z mi i m i m m i m i m i i Continuous mass 1 1 1 x x dm yy dmz z dm m dm G m G m G m Department of Mechanical Engineering Example:Example: CenterCenter ofof discretediscrete massmass List the masses and the coordinates of their centroids in a table Compute the first moment of each mass (relative
    [Show full text]
  • Centroids by Composite Areas.Pptx
    Centroids Method of Composite Areas A small boy swallowed some coins and was taken to a hospital. When his grandmother telephoned to ask how he was a nurse said 'No change yet'. Centroids ¢ Previously, we developed a general formulation for finding the centroid for a series of n areas n xA ∑ ii i=1 x = n A ∑ i i=1 2 Centroids by Composite Areas Monday, November 12, 2012 1 Centroids ¢ xi was the distance from the y-axis to the local centroid of the area Ai n xA ∑ ii i=1 x = n A ∑ i i=1 3 Centroids by Composite Areas Monday, November 12, 2012 Centroids ¢ If we can break up a shape into a series of smaller shapes that have predefined local centroid locations, we can use this formula to locate the centroid of the composite shape n xA ∑ ii i=1 x = n A ∑ i 4 Centroids by Composite Areas i=1 Monday, November 12, 2012 2 Centroid by Composite Bodies ¢ There is a table in the back cover of your book that gives you the location of local centroids for a select group of shapes ¢ The point labeled C is the location of the centroid of that shape. 5 Centroids by Composite Areas Monday, November 12, 2012 Centroid by Composite Bodies ¢ Please note that these are local centroids, they are given in reference to the x and y axes as shown in the table. 6 Centroids by Composite Areas Monday, November 12, 2012 3 Centroid by Composite Bodies ¢ For example, the centroid location of the semicircular area has the y-axis through the center of the area and the x-axis at the bottom of the area ¢ The x-centroid would be located at 0 and the y-centroid would be located
    [Show full text]
  • Multidisciplinary Design Project Engineering Dictionary Version 0.0.2
    Multidisciplinary Design Project Engineering Dictionary Version 0.0.2 February 15, 2006 . DRAFT Cambridge-MIT Institute Multidisciplinary Design Project This Dictionary/Glossary of Engineering terms has been compiled to compliment the work developed as part of the Multi-disciplinary Design Project (MDP), which is a programme to develop teaching material and kits to aid the running of mechtronics projects in Universities and Schools. The project is being carried out with support from the Cambridge-MIT Institute undergraduate teaching programe. For more information about the project please visit the MDP website at http://www-mdp.eng.cam.ac.uk or contact Dr. Peter Long Prof. Alex Slocum Cambridge University Engineering Department Massachusetts Institute of Technology Trumpington Street, 77 Massachusetts Ave. Cambridge. Cambridge MA 02139-4307 CB2 1PZ. USA e-mail: [email protected] e-mail: [email protected] tel: +44 (0) 1223 332779 tel: +1 617 253 0012 For information about the CMI initiative please see Cambridge-MIT Institute website :- http://www.cambridge-mit.org CMI CMI, University of Cambridge Massachusetts Institute of Technology 10 Miller’s Yard, 77 Massachusetts Ave. Mill Lane, Cambridge MA 02139-4307 Cambridge. CB2 1RQ. USA tel: +44 (0) 1223 327207 tel. +1 617 253 7732 fax: +44 (0) 1223 765891 fax. +1 617 258 8539 . DRAFT 2 CMI-MDP Programme 1 Introduction This dictionary/glossary has not been developed as a definative work but as a useful reference book for engi- neering students to search when looking for the meaning of a word/phrase. It has been compiled from a number of existing glossaries together with a number of local additions.
    [Show full text]
  • NOTES Centroids Constructed Graphically
    NOTES CentroidsConstructed Graphically TOM M. APOSTOL MAMIKON A. MNATSAKANIAN Project MATHEMATICS! California Instituteof Technology Pasadena, CA 91125-0001 [email protected] [email protected] The centroid of a finite set of points Archimedes (287-212 BC), regarded as the greatest mathematician and scientist of ancient times, introduced the concept of center of gravity. He used it in many of his works, including the stability of floating bodies, ship design, and in his discovery that the volume of a sphere is two-thirds that of its cir- cumscribing cylinder. It was also used by Pappus of Alexandria in the 3rd century AD in formulating his famous theorems for calculating volume and surface area of solids of revolution. Today a more general concept, center of mass, plays an important role in Newtonian mechanics. Physicists often treat a large body, such as a planet or sun, as a single point (the center of mass) where all the mass is concentrated. In uniform symmetric bodies it is identified with the center of symmetry. This note treats the center of mass of a finite number of points, defined as follows. Given n points rl, r2, ..., rn, regarded as position vectors in Euclidean m-space, rela- tive to some origin 0, let wl, w2, ..., Wnbe n positive numbers regarded as weights attached to these points. The center of mass is the position vector c defined to be the weighted average given by 1 n C=- wkrk, (1) n k=1 where Wnis the sum of the weights, n Wn= wk. (2) k=l When all weights are equal, the center of mass c is called the centroid.
    [Show full text]
  • Barycentric Coordinates in Triangles
    Computational Geometry Lab: BARYCENTRIC COORDINATES IN TRIANGLES John Burkardt Information Technology Department Virginia Tech http://people.sc.fsu.edu/∼jburkardt/presentations/cg lab barycentric triangles.pdf August 28, 2018 1 Introduction to this Lab In this lab we investigate a natural coordinate system for triangles called the barycentric coordinate system. The barycentric coordinate system gives us a kind of standard chart, which applies to all triangles, and allows us to determine the positions of points independently of the particular geometry of a given triangle. Our path to this coordinate system will identify a special reference triangle for which the standard (x; y) coordinate system is essentially identical to the barycentric coordinate system. We begin with some simple geometric questions, including determining whether a point lies to the left or right of a line. If we can answer that question, we can also determine if a point lies inside or outside a triangle. Once we are comfortable determining the (signed) distances of a point from each side of the triangle, we will discover that the relative distances can be used to form the barycentric coordinate system. This barycentric coordinate system, in turn, will provide the correspondence or mapping that allows us to establish a 1-1 and onto relationship between two triangles. The barycentric coordinate system is useful when defining the basis functions used in the finite element method, which is the subject of a separate lab. 2 Signed Distance From a Line In order to understand the geometry of triangles, we are going to need to take a small detour into the simple world of points and lines.
    [Show full text]
  • Affine Invariant Points
    Affine invariant points. ∗ Mathieu Meyer, Carsten Sch¨uttand Elisabeth M. Werner y Abstract We answer in the negative a question by Gr¨unbaum who asked if there exists a finite basis of affine invariant points. We give a positive answer to another question by Gr¨unbaum about the \size" of the set of all affine invariant points. Related, we show that the set of all convex bodies K, for which the set of affine invariant points n is all of R , is dense in the set of convex bodies. Crucial to establish these results, are new affine invariant points, not previously considered in the literature. 1 Introduction. A number of highly influential works (see, e.g., [8, 10, 12], [14]-[18], [20]-[31], [37, 44, 51, 52, 58]) has directed much of the research in the theory of convex bodies to the study of the affine geometry of these bodies. Even questions that had been considered Euclidean in nature, turned out to be affine problems - among them the famous Busemann-Petty Problem (finally laid to rest in [6, 9, 56, 57]). The affine structure of convex bodies is closely related to the symmetry structure of the bodies. From an affine point of view, ellipsoids are the most symmetric convex bodies, and simplices are considered to be among the least symmetric ones. This is reflected in many affine invariant inequalities (we give examples below) where ellipsoids and simplices are the extremal cases. However, simplices have many affine symmetries. Therefore, a more systematic study for symmetry of convex bodies is needed. Gr¨unbaum, in his seminal paper [13], initiated such a study.
    [Show full text]
  • Barycentric Coordinates in Olympiad Geometry
    Barycentric Coordinates in Olympiad Geometry Max Schindler∗ Evan Cheny July 13, 2012 I suppose it is tempting, if the only tool you have is a hammer, to treat everything as if it were a nail. Abstract In this paper we present a powerful computational approach to large class of olympiad geometry problems{ barycentric coordinates. We then extend this method using some of the techniques from vector computations to greatly extend the scope of this technique. Special thanks to Amir Hossein and the other olympiad moderators for helping to get this article featured: I certainly did not have such ambitious goals in mind when I first wrote this! ∗Mewto55555, Missouri. I can be contacted at igoroogenfl[email protected]. yv Enhance, SFBA. I can be reached at [email protected]. 1 Contents Title Page 1 1 Preliminaries 4 1.1 Advantages of barycentric coordinates . .4 1.2 Notations and Conventions . .5 1.3 How to Use this Article . .5 2 The Basics 6 2.1 The Coordinates . .6 2.2 Lines . .6 2.2.1 The Equation of a Line . .6 2.2.2 Ceva and Menelaus . .7 2.3 Special points in barycentric coordinates . .7 3 Standard Strategies 9 3.1 EFFT: Perpendicular Lines . .9 3.2 Distance Formula . 11 3.3 Circles . 11 3.3.1 Equation of the Circle . 11 4 Trickier Tactics 12 4.1 Areas and Lines . 12 4.2 Non-normalized Coordinates . 13 4.3 O, H, and Strong EFFT . 13 4.4 Conway's Formula . 14 4.5 A Few Final Lemmas . 15 5 Example Problems 16 5.1 USAMO 2001/2 .
    [Show full text]
  • Centroid of a Triangle
    analytic geometry (part 2) analytic geometry (part 2) Medians MPM2D: Principles of Mathematics Consider ∆ABD below. Centroid of a Triangle J. Garvin J. Garvin— Centroid of a Triangle Slide 1/17 Slide 2/17 analytic geometry (part 2) analytic geometry (part 2) Medians Medians The line segment AC, connecting vertex A to the midpoint Example of BD, is called a median. In ∆ABD, BC = CD . If ∆ABC has an area of 12 cm2. | | | | A median connects a vertex to the midpoint of its opposite Determine the area of ∆ABD. side. A median divides a triangle into two smaller triangles that have equal areas. These triangles may be congruent, but only when the triangle is equilateral or isosceles. 2 Since AABC = 12, AABD = 2 12 = 24 cm . J. Garvin— Centroid of a Triangle J. Garvin— Centroid of a Triangle × Slide 3/17 Slide 4/17 analytic geometry (part 2) analytic geometry (part 2) Medians Medians Consider ∆ABC with vertices at A(6, 7), B( 3, 1) and To determine an equation for a line segment containing a − C(9, 5) below, and the median from A. median from a specific vertex, we must first determine the − midpoint of the opposite side. In the case of the median from A, we want MBC . 3 + 9 1 + ( 5) M = − , − BC 2 2 = (3, 2) − Now we know two points on the median: A and MBC . Use these to calculate the slope of the median. 2 7 m = − − AM 3 6 − = 3 J. Garvin— Centroid of a Triangle J. Garvin— Centroid of a Triangle Slide 5/17 Slide 6/17 analytic geometry (part 2) analytic geometry (part 2) Medians Medians Once the slope is calculated, use it and either point to solve We can construct the medians from B and from C using the for the equation of the line.
    [Show full text]
  • Centroids Introduction • the Earth Exerts a Gravitational Force on Each of the Particles Forming a Body
    Centroids Introduction • The earth exerts a gravitational force on each of the particles forming a body. These forces can be replace by a single equivalent force equal to the weight of the body and applied at the center of gravity for the body. • The centroid of an area is analogous to the center of gravity of a body. The concept of the first moment of an area is used to locate the centroid. 5 - 2 Centroids • Centroid of mass – (a.k.a. Center of mass) – (a.k.a. Center of weight) – (a.k.a. Center of gravity) • For a solid, the point where the distributed mass is centered • Centroid of volume, Centroid of area xM xm x dm yM ym y dm Center of Gravity of a 2D Body • Center of gravity of a plate • Center of gravity of a wire M y xW xW x dW M y yW yW y dW 5 - 7 Centroids &First Moments of Areas & Lines • Centroid of an area • Centroid of a line xW x dW xgM g x dM xW x dW M V tA) dM dV tdA x La x adL xAt x tdA xL x dL xA x dA Q y yL y dL first moment with respect to y yA y dA Q x first moment with respect to x 5 - 8 First Moments of Areas and Lines • An area is symmetric with respect to an axis BB’ if for every point P there exists a point P’ such that PP’ is perpendicular to BB’ and is divided into two equal parts by BB’.
    [Show full text]
  • Centroid and Moment of Inertia 4.1 Centre of Gravity 4.2 Centroid
    MODULE 4 Centroid and Moment of Inertia 4.1 Centre of Gravity Everybody is attracted towards the centre of the earth due gravity. The force of attraction is proportional to mass of the body. Everybody consists of innumerable particles, however the entire weight of a body is assumed to act through a single point and such a single point is called centre of gravity. Every body has one and only centre of gravity. 4.2 Centroid In case of plane areas (bodies with negligible thickness) such as a triangle quadrilateral, circle etc., the total area is assumed to be concentrated at a single point and such a single point is called centroid of the plane area. The term centre of gravity and centroid has the same meaning but the following d ifferences. 1. Centre of gravity refer to bodies with mass and weight whereas, centroid refers to plane areas. 2. centre of gravity is a point is a point in a body through which the weight acts vertically downwards irrespective of the position, whereas the centroid is a point in a plane area such that the moment of areas about an axis through the centroid is zero Plane area ‘A’ G g2 g1 d2 d1 a2 a1 Note: In the discussion on centroid, the area of any plane figure is assumed as a force equivalent to the centroid referring to the above figure G is said to be the centroid of the plane area A as long as a1d1 – a2 d2 = 0. 4.3 Location of centroid of plane areas Y Plane area X G Y The position of centroid of a plane area should be specified or calculated with respect to some reference axis i.e.
    [Show full text]