Dia eae ites) te laa gd ARCS AND SECTORS An are is apart of crcl which joins any two diferent points. eit ts a bi is iain wet , GEOMETRY OF 3-DIMENSIONAL FIGURES “The surface area of a three-dimensional figure with plane faces is the sum of the areas af the faces. ‘The volume ofa solid isthe amount of space it oeeupies. The capacity of a container isthe quantity of uid iis capable oF holding. You should understand how the units of volume and ‘capacity are related. ‘You should be able to calculate ihe surface area and volume of 8-dimensional figures, including solids of uniform cross-section, pyramids, spheres, and cones. 3-DIMENSIONAL COORDINATE GEOMETRY In S-dimensional coordina Perpendicular axes called the 3 geometry, we specify an origin ©, and three mutually ze isyand the Z-axis. 4 For points Aten. pus 21) and Bla, yas 2): the ditance AB = lq= a Ga ) the midpoint oF [AB] is (2°22, RIGHT ANGLED TRIANGLE TRIGONOMETRY cos = AD wy . a sind = om ADP and Angle between a line and a plane The angle between a line and a plane angle beeen the line and its projeetion on the pa True bearings Troscon “True bearings ate used to describe the direction of ne objet from another. ‘The direction is measured clockwise from tue north NON-RIGHT ANGLED TRIANGLE TRIGONOMETRY Area formula: Area = Sabsin bee odPERPENDICULAR BISECTORS ‘The perpendicular bisector of a line segment [AB] isthe line perpendicular to [AB] perpendicular ‘which passes throught its midpoint. as bvacctor of [AB] Poins on the perpendicular bisector are equidistant from A and ORONO! DIAGRAMS Ina Voronoi diagram: ‘¢ Important locations are called sites ‘© Each site is surrounded by a rion or eell which contains the pins which are closer to that site than to any other site, ‘© The lines which separate the cells are called edges. Each point onan edge is equally closest tothe two sites whose cells are adjacent to that edge. ‘* The points at which the edges meet are called vertices. Each vertex is equally closest othe sites whose cells meet at that vertex. veriex equally closest, 106, D,and E Nearest neighbour interpolation {If we are given the values ofa variable at a set of known data points, we can estimate the value ofthe variable at some other point We use the variable’ value a the neares? known data point. From a Voronoi diagram withthe known data point as sites, we can quickly identify the nearest known data point to any given point. the given point les on an edge or at a vertex, we tke the average ofthe eloses known data pots. ‘The Largest Empty Circle problem ‘The Largest Empty Circle problem is the problem of finding the lagest circle . ‘whose interior does not contain any sites. 7 % {In the problems considered inthis course, the optimal position forthe circles centre will occur stone ofthe vertices ofthe Voronoi diagram. The vertex with the greatest distance from is nearest site is the optimal postion forthe eircle's centre.