Download as pptx, pdf, or txt
Download as pptx, pdf, or txt
You are on page 1of 13

CHAPTER 10

Geometry

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 1


10.7
Beyond Euclidean Geometry

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 2


Objective

1. Gain an understanding of some of the general


ideas of other kinds of geometries.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 3


The Geometry of Graphs
(Graph Theory)

The Swiss mathematician Leonhard Euler (1707 –


1783) proved that it was not possible to stroll through
the city of Kőnigsberg, Germany by crossing each of 7
bridges exactly once.

His solution opened up a new kind of geometry called


graph theory.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 4


Graph Definitions
Vertex is a point.

Edge is a line segment or curve that starts and ends at a


vertex.

Graph consists of vertices and edges

Odd vertex has an odd number of attached edges.

Even vertex has an even number of attached edges.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 5


Rules of Traversability

A graph is traversable if it can be traced without


lifting the pencil from the paper and without tracing
an edge more than once.

1. A graph with all even vertices is traversable. One can


start at any vertex and end where one began.
2. A graph with two odd vertices is traversable. One
must start at either of the odd vertices and finish at
the other.
3. A graph with more than two odd vertices is not
traversable.
A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 6
Example: To Traverse or Not to
Traverse?
a. Is this graph traversable?
Solution
Begin by determining if each vertex is
even or odd.
This graph has two odd vertices, by
Euler’s second rule, it is traversable.
b. Describe the path to traverse it.
Solution
By Euler’s second rule, start at one of
the odd vertices and finish at the other.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 7


Topology
The Study of Shapes
Objects are classified according to the number of holes
in them, called their genus.
Genus is the number of cuts that can be made in the
object without cutting the object in two pieces.
Topologically Equivalent objects have the same genus.
The topology of knots is used to identify viruses and
how they invade our cells.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 8


Examples of Topological Equivalency

The three shapes below have the same genus: 0. No


complete cuts can be made without cutting these
objects into two pieces.

A doughnut and a coffee cup have a genus of 1.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 9


Klein Bottle
The figures below show the transformation into the
figure called the Klein bottle. Because the inside
surface loops back on itself to merge with the outside, it
has neither an outside nor an inside. It passes through
itself without the existence of a hole, which is
impossible in three-dimensional space. It only exists
when generated on a computer.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 10


Comparing the Three Systems of Geometry
(Euclidean and non-Euclidean)

Euclidean Geometry Hyperbolic Geometry Elliptic Geometry


Euclid (300 B.C.) Lobachevsky, Bolyai (1830) Riemann(1850)
Given a point not on a Given a point not on a line, There are no parallel
line, there is one and there are an infinite number of lines.
only one line through lines through the point that do
the point parallel to not intersect the given line.
the given line.
Geometry is on a Geometry is on a pseudosphere: Geometry is on a
plane: sphere:

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 11


Comparing the Three Systems of Geometry
(Euclidean and non-Euclidean) continued

Euclidean Geometry Hyperbolic Geometry Elliptic Geometry


Euclid (300 B.C.) Lobachevsky, Bolyai (1830) Riemann(1850)
The sum of the The sum of the measures of The sum of the
measures of the angles the angles of a triangle is measures of the
of a triangle is 180. less than 180. angles of a triangle
is greater than 180.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 12


Fractal Geometry

Developed by Benoit Mandelbrot


using computer programming.
Geometry of natural shapes.
Self-similarity is the quality of
smaller versions of an object
appearing in the object itself.
Iteration is the process of
repeating a rule again and again to
create a self-similar fractal.

A L WAY S L E A R N I N G Copyright © 2019, 2015, 2011 Pearson Education, Inc. Slide 13

You might also like