geometry 10-1 solids face: the flat side of a figure edge: a straight line connecting sides vertex:...

Geometry 10-1 Solids • Face: the flat side of a figure • Edge: a straight line connecting sides • Vertex: a corner where edges intersect

Upload: reginald-nelson

Post on 01-Jan-2016

214 views

Category:

Documents

0 download

Report

Download

Embed Size (px):

TRANSCRIPT

Geometry 10-1 Solids

• Face: the flat side of a figure• Edge: a straight line connecting sides• Vertex: a corner where edges intersect

Basic Shapes

• Prism: 2 polygon bases, rectangle faces

• Cylinder: 2 circle bases, curved face

• Pyramid: 1 polygon base, triangle faces connect to a vertex

• Cone: 1 circle base, 1 curved side connects to a vertex

Page 3: Geometry 10-1 Solids Face: the flat side of a figure Edge: a straight line connecting sides Vertex: a corner where edges intersect

Name that Shape

• Prisms and pyramids are named according to the shape of the base.

Page 4: Geometry 10-1 Solids Face: the flat side of a figure Edge: a straight line connecting sides Vertex: a corner where edges intersect

Example

• Classify the solid shape.

pentagonal pyramidvertices: A, B, C, D, E, F

faces: 6 total (1 base)

edges:

Example

• Classify the solid shape.

vertex: Ncone

edges: cones don’t have edgesfaces: 2 total (1 base)

Page 6: Geometry 10-1 Solids Face: the flat side of a figure Edge: a straight line connecting sides Vertex: a corner where edges intersect

Volume and Surface AreaVolume: how much can fit inside of a shape

Surface area: total area of all facesLateral Surface area: area of side faces. Does not include the base(s).

Page 7: Geometry 10-1 Solids Face: the flat side of a figure Edge: a straight line connecting sides Vertex: a corner where edges intersect

Prisms

• Volume: V = BhB = area of the base shapeh = distance between bases

Page 8: Geometry 10-1 Solids Face: the flat side of a figure Edge: a straight line connecting sides Vertex: a corner where edges intersect

Prisms

• Total Surface Area: S = Ph + 2B• Lateral Surface Area: S = Ph

P = perimeter of base shape

Lecture 7: Martingales and Concentration · Lecture 7: Martingales and Concentration 11. Example of Doob Martingale: Vertex Exposure Martingale Similarly, instead of reveal edges

Graph theory Prof Amir Geva Eitan Netzer. G=(V,E) V – Vertex E – Edges

Intersect Australia

Segment Intersect

Line Segment Intersect

A Polyhedron- (polyhedra or polyhedrons) Is formed by 4 or more polygons (faces) that intersect only at the edges. Encloses a region in space

Graphs - yeasirrayhanprince.github.io · 0 Undirected Graph: Vertices and edges Edges = {02, 05, 04, 15, 14, 24, 23, 45 } No convention Which vertex to write first. 2 4 3 1 5

DIJKSTRA S ALGORITHM DEMO・Consider vertices in increasing order of distance from s (non-tree vertex with the lowest distTo[] value).・Add vertex to tree and relax all edges adjacent

arXiv:1909.02609v1 [math.CO] 5 Sep 2019 · In CP1, we draw a single white vertex at 0, a single black vertex at 1, and N edges from 0 to 1, one for each colour joining the two vertices

Algorithm for nding the largest inscribed rectangle in polygonjournals.ut.ac.ir/article_71280_2a21de484e568a9e396458a...last vertex is exactly on e 4 or the edges cut e4 .For example,

Graphs: DFS263/jessica/lecture8.pdfDFS in Graphs Explore edgesout of the most recently discovered vertex v that still has unexplored edges leaving it. Once all of v’s edges have

Splitting a Face Point edge already split new vertex two new faces one new vertex six new half-edges

COS 423 Lecture 19 Graph Matching · Given an undirected graph, a matching is a set of edges, no two sharing a vertex. A vertex is matched if it has an end in the matching, free

Intersect Challenge IV - Innovacorp

Intersect mag

SCALING LIMITS OF RANDOM GRAPH MODELS AT …i 2[n]), where di 2N represents the degree of vertex i with Pn i˘1 di assumed even. Think of each vertex i 2 [n] as having di half edges

The$Platonic$Solids$ - WordPress.com · requirements!is!called!a!Platonic!Solid.! Platonic!Solids!6!Details! Shape Name Faces Faces / Vertex Vertices Edges Triangle Tetrahedron 4

Vertex – A point at which two or more edges meet Edge – A line segment at which two faces intersect Face – A flat surface Vertices, Edges, Faces

INDEPENDENT SETS IN HYPERGRAPHS AND RAMSEY …web.mat.bham.ac.uk/~rah410/indRamseyFINAL_25Jul.pdf · be the hypergraph with vertex set [n] in which edges precisely correspond to solutions

The Poincaré dodecahedral space - Inria · The Poincaré dodecahedral space Gert Vegter and Rien van de Weijgaert ... 1 ev: nr. edges/vertex ve = 2: nr. vertices/edge e f: nr. edges/face

Finding two vertex connected components in linear timeguyk/dfss.pdf · TOC 2 Backward edges Please read the DFS algorithm (its in the lecture notes). The DFS gives a tree. The edges

Graph Theory and Network Flows - David Lippmandlippman.imathas.com/mathinsociety/GraphTheory1.3.doc · Web viewCreate a graph with each actor as a vertex, and edges connecting two

Guidebook for the Proper Installation of Tactile Ground ...same directional blocks as at rail stations but warning blocks are never used at platform edges or where blocks intersect

CS 179: GPU Programming Lecture 12 / Homework 4. Breadth-First Search Given source vertex S: – Find min. #edges to reach every vertex from S – (Assume

1 An Introduction to Graph Theory Chapter 11. 2 11.1 Definitions and Examples Undirected graph Directed graph isolated vertex adjacent loop multiple edges

VisualizingandAnimatingtheWinged-EdgeDataStructureshene/PUBLICATIONS/2007/WE.pdfexample, to ﬁnd all incident edges of a vertex, one maysimplyretrieve anincidentedgefromthevertex

Final Review review.pdf · 2021. 1. 4. · •A matching is a set of independent edges, in which no pair shares a vertex •The vertices incident to the edges of a matching are -saturated;

Opération INTERSECT

trcshshw.wikispaces.comreview+up+to+ch6... · The altitudes of a right triangle always intersect A) ... at the vertex of the right angle of the triangle D) ... shortest side of ADEF?

91.102 - Computing II Graphs. These are generalizations of trees: They have vertices: V And edges: E But they don’t have a “distinguished vertex” called

Shortest Path Problems Directed weighted graph. Path length is sum of weights of edges on path. The vertex at which the path begins is the source vertex

CHAPTER 14 Weighted Graphs and Applications · PDF file · 2008-08-02interface, the AbstractGraph class, ... Edge-weighted graphs have more applications than vertex- ... edges in

ALGORITHMS FOR VERTEX-WEIGHTED MATCHING IN GRAPHSA matching M in a graph is a subset of edges such that no two edges in M are inci-dent on the same vertex. Matching is a fundamental

Vertex-Edge Graphs. The Basics ❖ A vertex-edge graph is a graph that includes edges and vertices. ❖A❖An edge is a side (shown by a straight line) ❖ V❖

Tree Drawing Algorithms - Brown University · 2013. 6. 24. · Planar Drawings A planar drawing is a drawing in which edges do not intersect each other in the drawing (for example,