Euler Characteristics and Genus

Slides:



Advertisements
Similar presentations
Wrapping spheres around spheres Mark Behrens (Dept of Mathematics)
Advertisements

DISCRETE MATH DAY at WPI Saturday, April WHEN DOES A CURVE BOUND A DISTORTED DISK? Jack Graver Syracuse University This presentation is based on.
Embeddings with all triangles faces Dan Archdeacon The University of Vermont.
Surfaces and Topology Raymond Flood Gresham Professor of Geometry.
Topology YAN JIE (Ryan).
CS447/ Realistic Rendering -- Solids Modeling -- Introduction to 2D and 3D Computer Graphics.
Cutting a surface into a Disk Jie Gao Nov. 27, 2002.
Applied Combinatorics, 4th Ed. Alan Tucker
Computational Geometry Seminar Lecture 1
EECS Computer Science Division University of California, Berkeley Carlo H. Séquin Art and Math Behind and Beyond the 8-fold Way.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Chapter 5.1 Systems of linear inequalities in two variables.
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
Maps. Graphs on Surfaces We are mainly interested in embeddings of graphs on surfaces:  : G ! S. An embedding should be differentiated from immersion.
COMPUTER AIDED DESIGN -(CAD)-3
Math Vocabulary
Linear Inequalities and Linear Programming Chapter 5 Dr.Hayk Melikyan Department of Mathematics and CS
Euler’s characteristic and the sphere
Section 5.1 Rubber Sheet Geometry Discovering the Topological Idea of Equivalence by Distortion. “The whole of mathematics is nothing more than a refinement.
Planar Graphs Graph Coloring
Bridges 2012 From Möbius Bands to Klein Knottles EECS Computer Science Division University of California, Berkeley Carlo H. Séquin.
Euler characteristic (simple form):
Capacitance Chapter 25. Capacitance A capacitor consists of two isolated conductors (the plates) with charges +q and -q. Its capacitance C is defined.
Computer Graphics CC416 Lecture 04: Bresenham Line Algorithm & Mid-point circle algorithm Dr. Manal Helal – Fall 2014.
Topology and The Euler Number
CS 39R Single-Sided Surfaces EECS Computer Science Division University of California, Berkeley Carlo H. Séquin.
Mental Arithmetic Strategies Scotts Primary School. Mental Arithmetic Scheme.
Associate Professor, ECE Dept.
Great Theoretical Ideas In Computer Science
Chapter 3: Playing with numbers
Outline 1 Properties of Planar Graphs 5/4/2018.
Bay Area Science Festival, 2013
Eigenfaces (for Face Recognition)
Mental Arithmetic Strategies
Graphs: Definitions and Basic Properties
Celebration of the Mind, MSRI, 2013
Introduction to Polygons
POLYGON MESH Advance Computer Graphics
Mathematical problems in knot theory
Applied Combinatorics, 4th Ed. Alan Tucker
Fill Area Algorithms Jan
2-Manifold Sculptures & Surface Classification
MSRI, Celebration of Mind, October 15, 2017
Single-Sided Surfaces
Chapter 3.1 Probability Students will learn several ways to model situations involving probability, such as tree diagrams and area models. They will.
Recent Sculptures Graphics Lunch, Feb. 1, 2013 Carlo H. Séquin
Playing with Graphs Alex Andreotti.
Quantum Hall effect & Topology
Probability.
Planarity Cox, Sherman, Tong.
Graph.
Inequalities in Two Variables
The Möbius Strip or The Möbius Band
MSRI – Manifolds Carlo H. Séquin.
Applied Combinatorics, 4th Ed. Alan Tucker
Warm Up – Wednesday.
Fractions ( Part 2 ) Created By Dr. Cary Lee
University of California, Berkeley
One way to find the surface area of ANY SOLID:
Chapter 15 Graph Theory © 2008 Pearson Addison-Wesley.
Euler Characteristics and Genus
Gaph Theory Planar Graphs
Applied Combinatorics, 4th Ed. Alan Tucker
Poincare’s Conjecture
A Portrait of a Group on a Surface with Boundary
K12 and the Genus-6 Tiffany Lamp
Lecture 5: Triangulations & simplicial complexes (and cell complexes).
2-Manifold Sculptures & Surface Classification
Single-Sided Surfaces
Presentation transcript:

Euler Characteristics and Genus Florida 1999 CS 39, 2017 Euler Characteristics and Genus Carlo H. Séquin EECS Computer Science Division University of California, Berkeley A chose a very mathematical title …

Surface Classification Theorem: Granada 2003 Topological Analysis Surface Classification Theorem: All 2-manifolds embedded in Euclidean 3-space can be characterized by 3 parameters: Number of borders, b: # of 1D rim-lines; Orientability, σ: single- / double- sided; Genus, g, or: Euler Characteristic, χ, specifying “connectivity” . . . But now I want to focus on the topological analysis of these sculptures, -- and the “mathematical meat” of this presentation: The “Surface Classification Theorem” says: All 2-manifolds embedded in Euclidean 3-space can be characterized by 3 parameters: The number of its borders, b: i.e., # of 1D rim-lines; Orientability, σ: whether the surface is single- or double-sided; and its connectivity, specified either by the Genus, g, or by the Euler Characteristic, χ, -- Let’s look at these three characteristics more closely: . . .

Determining the Number of Borders Granada 2003 Determining the Number of Borders Run along a rim-line until you come back to the starting point; count the number of separate loops. Here, there are 4 borders: This is a sculpture by Charles Parry. Determining the number of borders is the easiest of the 3 tasks: Run along a rim-line until you come back to the starting point and count this as ONE border. Count the number of separate loops. In this sculpture, there are 4 borders, all circular rings, marked by 4 different colors.

Determining the Surface Orientability Granada 2003 Determining the Surface Orientability Flood-fill_paint the surface without stepping across rim. If whole surface is painted, it is a single-sided surface (“non-orientable”). If only half is painted, it is a two-sided surface (“orientable”). The other side can then be painted a different color. The orientability of a surface can be determined by starting to flood-fill-paint the surface without ever stepping across the rim. If, in the end, all surface areas have been painted, then the surface is single-sided. If only half of it got painted, and the rest of the surface can be painted with a different color, then the surface is double sided. If something else happens, then the surface was not a proper 2-manifold in the first place. A double-sided surface

Determining Surface Orientability (2) Granada 2003 Determining Surface Orientability (2) A shortcut: If you can find a path to get from “one side” to “the other” without stepping across a rim, it is a single-sided surface. Sometimes there is a quick way to determine surface orientability: If you can find a path to get from “one side” to “the same point on other side” without stepping across a rim, it is a single-sided surface.

Determining the Genus of a 2-Manifold Granada 2003 Determining the Genus of a 2-Manifold The number of independent closed-loop cuts that can be made on a surface, while leaving all its pieces connected to one another. Closed surfaces (handle-bodies) Surfaces with borders (disks with punctures) The genus of a surface specifies its connectivity. It is defined as: The number of independent closed-loop cuts that can be made on the surface, while still leaving all its pieces connected to one another. On the left, I show 3 examples of handle-bodies: A sphere has genus 0: any closed loop will cut out a disconnected region. On the two-hole torus, we can make two cuts shown by the red lines, and the surface will still be connected into a single piece. On the genus-4 handle-body, we can make the 4 red loop-cuts, and still move from anywhere to anywhere on this surface. --- On the right, I show a few disks with a varying number of punctures or holes. All of them have genus 0: any closed loop will cut out a disconnected region. The number of punctures does not change anything! genus 0 genus 2 All: genus 0 genus 4

Euler Characteristic of Handle-Bodies Granada 2003 Euler Characteristic of Handle-Bodies For polyhedral surfaces: Euler Characteristic = χ = V – E + F Platonic Solids: V: 4 6 8 12 20 E: 6 12 12 30 30 F: 4 8 6 20 12 χ: 2 2 2 2 2 Sometimes it is simpler to determine first the Euler Characteristic, and then calculate the genus from that. One way to find the E.C. is to draw a mesh onto the surface and then apply the formula that E.C. is equal to # of V-E+F.  Genus = (2 – χ – b) / 2 for double-sided surfaces.

“ EC-Mathematics”  Genus = (2 – χ – b) / 2 for double-sided surfaces. Granada 2003 “ EC-Mathematics” Fuse the two together: EC=2; g=0 EC=1; b=1; g=0 Sometimes it is simpler to determine first the Euler Characteristic, and then calculate the genus from that. One way to find the E.C. is to draw a mesh onto the surface and then apply the formula that E.C. is equal to # of V-E+F. EC=2; b=0; g=0 Punch multiple holes: the missing faces are replaced by additional borders.  Genus = (2 – χ – b) / 2 for double-sided surfaces.

Granada 2003 EC-Mathematics (2) Two or more stuck together end-to-end: EC=2; g=0 At each joint, n vertices and n edges are removed;  EC does not change! Without end-faces: Torus: EC=0; b=0; g=1 Sometimes it is simpler to determine first the Euler Characteristic, and then calculate the genus from that. One way to find the E.C. is to draw a mesh onto the surface and then apply the formula that E.C. is equal to # of V-E+F. EC=0; b=2; g=0 EC=0; b=2; g=0  Genus = (2 – χ – b) / 2 for double-sided surfaces.

Determining the Euler Characteristic of Tubular Structures Granada 2003 Determining the Euler Characteristic of Tubular Structures Cutting a tube (“circular” cut) does not change χ : χ = V – E + F = Euler Characteristic How many cuts to obtain a tree-like connected graph? A tree-like tubular graph structure has genus = 0  It is a “sphere” with (2 “cuts”) = 2 punctures. Each cut done adds +1 to the genus of the structure  E.g., a tubular Tetrahedral frame has genus = 3 If the structure was single-sided (Klein bottle), multiply by 2 the calculated genus

Determining the Euler Characteristic of Disks with Punctures & Borders Granada 2003 Determining the Euler Characteristic of Disks with Punctures & Borders E=V; F=1 V+F=E+1 V=E=F=1  Disk: χ = 1 Closing the gap eliminates 1 edge and 2 vertices; EC := EC 1 b := b +1 Genus unchanged Disk Sometimes it is simpler to determine first the Euler Characteristic, and then calculate the genus from that. One way to find the E.C. is to draw a mesh onto the surface and then apply the formula that E.C. is equal to # of V-E+F. But often there is a short-cut; particularly for sculptures that are composed from many interconnected ribbon elements: We simply count the number of ribbons that we have to cut, until we are left with a jagged piece of surface with a single rim, that is topologically equivalent to a disk. The Euler characteristic of our original surface is then 1 minus the # of cuts made. When we do this to the “Tetra” frame we have to make 3 cuts, so its E.C is -2. From the E.C. we can then calculate the genus of the surface according to these two formulas. Genus = (2 – χ – b) / 2 for double-sided surfaces.

EC-Mathematics (3) Genus = 2 – χ – b for non-orientable surfaces; Granada 2003 EC-Mathematics (3) A ribbon is a “disk”; EC =1 Closing the ribbon into a loop yields EC = 1  1 = 0 Odd number of half-twists  1-sided Möbius band with 1 border; genus = 1 Even number of half-twists  2-sided annulus/cylinder with 2 borders; genus = 0 . Genus = 2 – χ – b for non-orientable surfaces; Genus = (2 – χ – b) / 2 for double-sided surfaces.

Determining the Euler Characteristic Granada 2003 Determining the Euler Characteristic Sometimes a simpler approach: Find χ χ = V – E + F = Euler Characteristic How many cuts (rim-to-rim) are needed to obtain a single connected disk? Disk: χ = 1; do the inverse process: every cut re-join lowers χ by 1;  thus “Tetra” ribbon frame: χ = –2 Sometimes it is simpler to determine first the Euler Characteristic, and then calculate the genus from that. One way to find the E.C. is to draw a mesh onto the surface and then apply the formula that E.C. is equal to # of V-E+F. But often there is a short-cut; particularly for sculptures that are composed from many interconnected ribbon elements: We simply count the number of ribbons that we have to cut, until we are left with a jagged piece of surface with a single rim, that is topologically equivalent to a disk. The Euler characteristic of our original surface is then 1 minus the # of cuts made. When we do this to the “Tetra” frame we have to make 3 cuts, so its E.C is -2. From the E.C. we can then calculate the genus of the surface according to these two formulas. From this: Genus = 2 – χ – b for non-orientable surfaces; Genus = (2 – χ – b)/2 for double-sided surfaces.

“Endless Ribbon” Max Bill, 1953, stone Granada 2003 “Endless Ribbon” Max Bill, 1953, stone Single-sided (non-orientable) Number of borders b = 1 E.C. χ = 2 – 3 + 1 = 0 Genus g = 2 – χ – b = 1 Independent cutting lines: 1 Let’s start with a simple one: “Endless Ribbon” by Max Bill. This is a non-orientable Moebius-band; it has a single border. Its E.C. can be found most easily by laying a simple mesh on this surface, consisting of 2 vertices, 3 edges and a single rectangular, twisted face. It’s E.C. thus is 0, and from this we calculate a genus of 1. And indeed there is one cut we can make on a Moebius band that keeps the surface still connected. You probably have seen this trick how a Moebius band can be cut down the middle, resulting in a double-sized, 2-sided loop with a full twist in it.

Costa_in_Cube Carlo Séquin, 2004, bronze Granada 2003 Costa_in_Cube Carlo Séquin, 2004, bronze Double-sided (orientable) Number of borders b = 3 Euler characteristic χ = –5 Genus g = (2 – χ – b)/2 = 2 Independent cutting lines: 2 Playing this same game on this more complicated surface, we find 3 borders: a 3-segment curve on the upper left, and equal one on the lower right; and a 6-segment border around the equator. We have to make six cuts to open up all the tunnels, and from this we calculate a genus of 2, which means we can make two loop cuts that leave the surface connected. >>> Now let’s look at some non-orientable surfaces. . .

“Möbius Shell” Brent Collins, 1993, wood Granada 2003 “Möbius Shell” Brent Collins, 1993, wood Single-sided (non-orientable) Number of borders b = 2 (Y,R) Euler characteristic χ = –1 Genus g = 2 – χ – b = 1 Independent cutting lines: 1 blue or green – but not both, they would intersect! Brent Collins’ “Moebius Shell” is also single-sided (as shown earlier) but it has two borders (outlined in yellow and red). Its E.C. is -1, (2 cuts are required to break all the ribbon loops). And from this we calculate again a genus of 1. >>> We can make ONE cut – either along the blue OR the green curve and keep the surface still connected – but not both! Since the two curves intersect each other, the second one would no longer be a closed loop.