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.

Slides:



Advertisements
Similar presentations
Polygon Triangulation
Advertisements

Walks, Paths and Circuits Walks, Paths and Circuits Sanjay Jain, Lecturer, School of Computing.
Planar Orientations Chapter 4 ( ) in the book Written By: Tomer Heber.
 Distance Problems: › Post Office Problem › Nearest Neighbors and Closest Pair › Largest Empty and Smallest Enclosing Circle  Sub graphs of Delaunay.
Applications of Euler’s Formula for Graphs Hannah Stevens.
Section 7.4: Closures of Relations Let R be a relation on a set A. We have talked about 6 properties that a relation on a set may or may not possess: reflexive,
By Groysman Maxim. Let S be a set of sites in the plane. Each point in the plane is influenced by each point of S. We would like to decompose the plane.
Incidences and Many Faces via cuttings Sivanne Goldfarb
Computational Geometry Seminar Lecture 1
8 TECHNIQUES OF INTEGRATION. In defining a definite integral, we dealt with a function f defined on a finite interval [a, b] and we assumed that f does.
Recognizing Strings in NP Marcus Schaefer, Eric Sedgwick, Daniel Štefankovič Presentation by Robert Salazar.
VECTOR CALCULUS Fundamental Theorem for Line Integrals In this section, we will learn about: The Fundamental Theorem for line integrals and.
Tucker, Applied Combinatorics, Section 1.4, prepared by Patti Bodkin
Definition Dual Graph G* of a Plane Graph:
MULTIPLE INTEGRALS Double Integrals over General Regions MULTIPLE INTEGRALS In this section, we will learn: How to use double integrals to.
Chapter 4: Straight Line Drawing Ronald Kieft. Contents Introduction Algorithm 1: Shift Method Algorithm 2: Realizer Method Other parts of chapter 4 Questions?
Complex Model Construction Mortenson Chapter 11 Geometric Modeling
Area Between Two Curves
Partially Ordered Sets (POSets)
Area Between Two Curves
Box and Whisker Plots. Order numbers 3, 5, 4, 2, 1, 6, 8, 11, 14, 13, 6, 9, 10, 7 First, order your numbers from least to greatest: 1, 2, 3, 4, 5, 6,
Efficient Partition Trees Jiri Matousek Presented By Benny Schlesinger Omer Tavori 1.
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.
Subdivision of Edge In a graph G, subdivision of an edge uv is the operation of replacing uv with a path u,w,v through a new vertex w.
Zvi Kohavi and Niraj K. Jha 1 Capabilities, Minimization, and Transformation of Sequential Machines.
Copyright © Cengage Learning. All rights reserved Double Integrals over General Regions.
DOUBLE INTEGRALS OVER GENERAL REGIONS
 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.
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.:
Planning Near-Optimal Corridors amidst Obstacles Ron Wein Jur P. van den Berg (U. Utrecht) Dan Halperin Athens May 2006.
APPLICATIONS OF DIFFERENTIATION 4. Many applications of calculus depend on our ability to deduce facts about a function f from information concerning.
Quadratrix of Hippias Viet To, Jackie Gomez, Deon Nguyen.
Chapter 3 – Set Theory  .
Notes for self-assembly of thin rectangles Days 19, 20 and 21 of Comp Sci 480.
How to Cut Pseudoparabolas into Segments Seminar on Geometric Incidences By: Almog Freizeit.
Volume: The Disk Method
Geometric Constructions
Planar Graphs Graph Coloring
Copyright © Cengage Learning. All rights reserved. 7 Techniques of Integration.
Chapter SETS DEFINITION OF SET METHODS FOR SPECIFYING SET SUBSETS VENN DIAGRAM SET IDENTITIES SET OPERATIONS.
Connectivity and Paths 報告人:林清池. Connectivity A separating set of a graph G is a set such that G-S has more than one component. The connectivity of G,
Problem Statement How do we represent relationship between two related elements ?
Applied Geometry Lesson 1-5 Tools of the Trade Objective: Learn to use geometry tools.
Copyright © Cengage Learning. All rights reserved. 14 Partial Derivatives.
Chapter 8: Relations. 8.1 Relations and Their Properties Binary relations: Let A and B be any two sets. A binary relation R from A to B, written R : A.
JCT – uniqueness of the bounded component of the complement Suppose otherwise; then there are at least two disjoint bounded connected open regions in the.
Descriptive Geometry. Introduction  What is Descriptive Geometry? →It is the study of points, lines, and planes in space to determine their locations.
Copyright © Cengage Learning. All rights reserved Maximum and Minimum Values.
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.
12. Lecture WS 2012/13Bioinformatics III1 V12 Menger’s theorem Borrowing terminology from operations research consider certain primal-dual pairs of optimization.
Planar Graphs prepared and Instructed by Arie Girshson Semester B, 2014 June 2014Planar Graphs1.
Chapter Area between Two Curves 7.2 Volumes by Slicing; Disks and Washers 7.3 Volumes by Cylindrical Shells 7.4 Length of a Plane Curve 7.5 Area.
Venn Diagrams.
Euclidean space Euclidean space is the set of all n-tuples of real numbers, formally with a number called distance assigned to every pair of its elements.
Line Integral II Line integral in an irrotational vector field Green’s theorem.
Slide 4- 1 Copyright © 2010 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Slide 1- 1 Copyright © 2010 Pearson Education, Inc. Publishing.
1 Chapter 4 Geometry of Linear Programming  There are strong relationships between the geometrical and algebraic features of LP problems  Convenient.
Capabilities, Minimization, and Transformation of Sequential Machines
3.6 Rational Functions.
Geometric Graphs and Quasi-Planar Graphs
Construct an Octagon Inside of a Circle
Planarity Testing.
Depth Estimation via Sampling
5.3 – The Definite Integral and the Fundamental Theorem of Calculus
HAND DRAWING AN ELLIPSE
Box and Whisker Plots.
Boundaries of the components of the complement of a Jordan curve – II
SYMMETRY Even and Odd Suppose f is continuous on [-a, a] and even
Properties of Transversal Lines
Presentation transcript:

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 the union from the unbounded component of the complement of its closure) is a Jordan curve. – Consider such a connected finite union of open discs. The boundary of the collection includes the boundary of the unbounded component of the complement of the union. This “outer boundary”is composed of subarcs of the collection of circles which bound the discs contained in the finite union. The union of these subarcs is a Jordan curve. This is readily seen by induction on the number of discs, upon the observation that each the boundary circle of each additional disc must intersect the assembly of boundary circles in an even number of points, regardless of whether the disk intersects only contiguous discs, or not, so that it is impossible to have a “free end” of a boundary circle at any point in the induction.

Finite connected unions of open discs: the boundary of the unbounded component of the complement of the discs is always a Jordan curve.

Another Lemma: Two Jordan arcs in a rectangle: Suppose two disjoint Jordan arcs lie within a rectangle such that one arc intersects the boundary of the rectangle only at one point on the left hand side of the rectangle, and the other intersects the boundary of the rectangle only at one point of the right hand side of the rectangle. Then one can draw an arc from the top of the rectangle to the bottom which does not intersect either arc.

Two Jordan arcs in a rectangle: Proof: Draw a vertical line from the top to the bottom of the rectangle closer to the right- hand side than any point of the arc which intersects the left- hand side. If vertical line omits the arc which intersects the right-hand side, we are done; If not, cover the right-side arc with a finite, connected, collection of open discs, none mutually tangent, which do not intersect the left-side arc:

The outer boundary of this collection is a Jordan curve. Now construct a compound arc beginning with the vertical segment until it meets the outer boundary of the collection of discs; then continue along the outer boundary (in the direction which does not intersect the rectangle) until the last intersection of the vertical line with the outer boundary; then continue along the vertical line until the bottom of the rectangle is reached. The compound arc satisfies the requirements of the Lemma.

Proof of the Jordan Arc Theorem: A Jordan arc does not separate the plane. Suppose otherwise. Then the complement of the arc must include at least one bounded component. The boundary of this component must be a closed subset of the arc. If it is not the entire arc, it must be contained within a subset of the arc, and via the ordering inherited from the underlying closed interval, we can identify the greatest lower bound and least upper bound for the boundary, which, as a closed set, must include its endpoints.

Directing attention to this minimal arc containing the boundary, identify the points of maximal separation (A. B), and place them on a horizontal line; Surround the curve with a rectangle, with A, B falling on the left and right sides of the rectangle, respectively. Let C, D be the endpoints of the arc. By the Lemma above, if C, D are not coincident with A, B, we can draw an arc from the upper side of the rectangle to the lower side, say EF, which does not intersect subarcs AC and BD. (If C or D coincides with A or B, EF should omit A and/or B.)

Proof of JAT, cont. By the Crossed Arcs Lemma, EF intersects AB, say, for the first time at G and the last time at H. Splicing together the subarc GH of AB with the initial and final portions of EF, we obtain a compound arc EGHF; this arc cannot meet the bounded component of the complement of CD –­ as this would constitute a path connecting the bounded component to the unbounded component, which would then have to coincide; the middle portion GH, as a subarc of AB, is complementary to the bounded component.

Now pick a point, J, in the bounded component; connect it with arcs within the bounded component to accessible points C’ and D’ of the boundary, near C and D. Then by the Crossed Arcs Lemma, the compound arc AC’D’B must intersect EGFH in a point, K, in the bounded component (as EF is by construction disjoint from arcs AC and BD; and the interior of arc C’D’ lies by construction in the bounded component.). But the compound arc EGHF is disjoint from the bounded component – the contradiction confirms that CD, and thus the original Jordan arc, does not separate the plane.