JCT – uniqueness of the bounded component of the complement Suppose otherwise; then there are at least two disjoint bounded connected open regions in the.

Slides:



Advertisements
Similar presentations
Graphs, Planar graphs Graph coloring
Advertisements

Map-making as Graph Drawing Alan Saalfeld Mathematical Cartographer.
Technique of nondimensionalization Aim: –To remove physical dimensions –To reduce the number of parameters –To balance or distinguish different terms in.
Planar Orientations Chapter 4 ( ) in the book Written By: Tomer Heber.
Introduction to Graphs
What do these knots have in common? Hint: Numbers can be categorized as this, also.
Krakow, Summer 2011 Schnyder’s Theorem and Relatives William T. Trotter
I. The Problem of Molding Does a given object have a mold from which it can be removed? object not removable mold 1 object removable Assumptions The object.
Chapter 6 Polygons. A polygon is a closed plane figure formed by three or more segments that intersect only at their endpoints. PolygonsNot Polygons.
Incidences and Many Faces via cuttings Sivanne Goldfarb
Chapter 18 Section 18.5 Green’s Theorem. Closed Curves and Simple Closed Curves Closed curves are figures that can be drawn so that you begin and end.
Chapter 11 GRUDGE REVIEW.
Computational Geometry Seminar Lecture 1
Recognizing Strings in NP Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič Presentation by Robert Salazar.
Crossing Lemma - Part I1 Computational Geometry Seminar Lecture 7 The “Crossing Lemma” and applications Ori Orenbach.
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Section 10.1 cont. Tangents. A tangent to a circle is This point of intersection is called the a line, in the plane of the circle, that intersects the.
Geometry Honors Section 9.2 Tangents to Circles. A line in the plane of a circle may or may not intersect the circle. There are 3 possibilities.
Chapter 2. One of the basic axioms of Euclidean geometry says that two points determine a unique line. EXISTENCE AND UNIQUENESS.
Efficient Partition Trees Jiri Matousek Presented By Benny Schlesinger Omer Tavori 1.
1.1 The Building Blocks of Geometry
Matthew Bowling Euler’s Theorem Mathfest Spring ‘15.
Graph Theory Ch6 Planar Graphs. Basic Definitions  curve, polygon curve, drawing  crossing, planar, planar embedding, and plane graph  open set  region,
Graph Theory Chapter 6 Planar Graphs Ch. 6. Planar Graphs.
 Jim has six children.  Chris fights with Bob,Faye, and Eve all the time; Eve fights (besides with Chris) with Al and Di all the time; and Al and Bob.
Chapter 9 Geometry © 2008 Pearson Addison-Wesley. All rights reserved.
Copyright © Cengage Learning. All rights reserved.
Planar Graphs: Euler's Formula and Coloring Graphs & Algorithms Lecture 7 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
(a +b) 2 (a+b) 3 Children, Have you come across figures of the following types?
Section 9.1 Similar Right Triangles OBJECTIVE: To find and use relationships in similar right triangles BIG IDEAS: REASONING AND PROOF VISUALIZATIONPROPORTIONALITY.
Chapter 9: Geometric Selection Theorems 11/01/2013
Polygons A Polygon is a closed plane figure formed by 3 or more segments Each segment intersects exactly 2 other segments only at their endpoints. No.
Similar Right Triangle Theorems Theorem 8.17 – If the altitude is drawn to the hypotenuse if a right triangle, then the two triangles formed are similar.
MAT 2720 Discrete Mathematics Section 8.7 Planar Graphs
Planar Graphs Graph Coloring
Planar Graphs Prepared by: Asa Dan, Ofer Kiselov, Hillel Mendelson & Ofir Pupko Graph Theory with CE Applications Technion 2015.
Planar graphs with no 5- cycles, 6-cycles or intersecting triangles are 3-colorable Carl Yerger, Davidson College Clemson Mini-Conference 2012.
Flow Algorithms Prepared by John Reif, Ph.D. Distinguished Professor of Computer Science Duke University Analysis of Algorithms Week 9, Lecture 2.
Beyond planarity of graphs Eyal Ackerman University of Haifa and Oranim College.
9-5 Tangents Objectives: To recognize tangents and use properties of tangents.
Chapter 9.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 6th ed., by Kenneth H.
MTH 232 Section 9.3 Figures in Space. From 2-D to 3-D In the previous section we examined curves and polygons in the plane (all the points in the plane.
11 Chapter Introductory Geometry
JCT – boundaries of the components of the complement of a Jordan curve - I The boundary of a component of the complement of a Jordan curve is a subset.
SAT Prep. Postulates and Theorems Relating Points, Lines, and Planes Use postulates and theorems relating points, lines, and planes.
Planar Graphs prepared and Instructed by Arie Girshson Semester B, 2014 June 2014Planar Graphs1.
The Jordan Arc theorem. A Lemma: For a connected, finite union of open discs, no two of which are mutually tangent, the outer boundary (which separates.
1 Schnyder’s Method. 2 Motivation Given a planar graph, we want to embed it in a grid We want the grid to be relatively small And we want an efficient.
Postulate 1-1 Through any two points, there is exactly one line. Can you imagine making more than one unique line (as defined in this class) that passes.
Algorithms and Networks
A sketch proof of the Gilbert-Pollak Conjecture on the Steiner Ratio
The Art Gallery Problem
The Art Gallery Problem
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Planarity and Euler’s Formula
Depth Estimation via Sampling
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
11 Chapter Introductory Geometry
I. The Problem of Molding
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Boundaries of the components of the complement of a Jordan curve – II
Linear Notations AB or BA AB
MAT 2720 Discrete Mathematics
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 8th ed., by Kenneth H.
Math 132 Day 2 (2/1/18) CCBC Dundalk.
Areas of Plane Figures 11-6 Arc Lengths and Areas of Sectors
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Chapter 10.7 Planar Graphs These class notes are based on material from our textbook, Discrete Mathematics and Its Applications, 7th ed., by Kenneth H.
Presentation transcript:

JCT – uniqueness of the bounded component of the complement Suppose otherwise; then there are at least two disjoint bounded connected open regions in the complement of the Jordan curve, in addition to the unique unbounded component. Partition the Jordan curve into three Jordan subarcs, which intersect only in their endpoints. Choose a point in the exterior of the curve; from this point, draw three disjoint arcs to accessible points within each of the three subarcs of the original curve. Similarly, draw an arc within one of the interior components from an interior point to accessible points, one in each subarc, different from the accessible points used in the previous step. Now draw an arc from an interior point of the other bounded component to 3 more different accessible points in each of the three subarcs.

As previously, these three arcs cannot intersect any of the arcs previously drawn from the other two chosen points, as the three components of the complement are disjoint. But if this is the case, we have drawn a realization of K3,3 in the plane, which does not exist! [In the figure, the two sets of three points which are the nodes of K3,3 are depicted in black and turquoise.] The contradiction demonstrates that there are at most two (hence exactly two) components of the complement of the Jordan curve, QED.

Our proof of Jordan Separation for Polygons follows Courant and Robbins What is Mathematics? An Elementary Approach to Ideas and Methods. The connection between K3,3 and JCT is derived from Thomassen (1992), “The Jordan-Schonflies Theorem and the Classification of Surfaces” This treatment of the Crossed Arcs Lemma simplifies the proof of Maehara (1984), “The Jordan Curve theorem via the Brouwer Fixed Point Theorem.” The treatment of the Jordan Arc Theorem is derived from Moise, Geometric topology in dimensions 2 and 3, (hopefully) modified for clarity. Maehara deduces JAT from the Brouwer Fixed Point Theorem and the Tietze Extension Theorem