M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Based on the paper by M. Farber and D. Schütz Presented by Yair.

Slides:



Advertisements
Similar presentations
Finding Gold In The Forest …A Connection Between Fractal Trees, Topology, and The Golden Ratio.
Advertisements

Vector Spaces A set V is called a vector space over a set K denoted V(K) if is an Abelian group, is a field, and For every element vV and K there exists.
Completeness and Expressiveness
Shortest Vector In A Lattice is NP-Hard to approximate
The Topology of Graph Configuration Spaces David G.C. Handron Carnegie Mellon University
Ho m o l ogy. Not to be confused with: Homeomorphism Homomorphism Homotopy Oh, and it is NOT the mixing of the cream and skim milk.
Singularity of a Holomorphic Map Jing Zhang State University of New York, Albany.
Configuration Space. Recap Represent environments as graphs –Paths are connected vertices –Make assumption that robot is a point Need to be able to use.
Graph-02.
Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Geometric Transitions 25 Giugno 2007 Michele Rossi.
Omer Bobrowski Mathematics Department Duke University Joint work with Sayan Mukherjee 6/19/13.
Feasible trajectories for mobile robots with kinematic and environment constraints Paper by Jean-Paul Laumond I am Henrik Tidefelt.
A Topological Approach to Voxelization Samuli Laine NVIDIA.
Computational Topology for Computer Graphics Klein bottle.
Kinematics & Grasping Need to know: Representing mechanism geometry Standard configurations Degrees of freedom Grippers and graspability conditions Goal.
Linear Programming and The Carpenter’s Ruler Presentation by Perouz Taslakian COMP566 – Fall 2004.
5.3 Linear Independence.
Topology Senior Math Presentation Nate Black Bob Jones University 11/19/07.
Generalized Derangements Anthony Fraticelli Missouri State University REUJuly 30, 2009 Advisor: Dr. Les Reid.
3. Delaunay triangulation
1 Discrete Structures & Algorithms Graphs and Trees: II EECE 320.
Graph Drawing Introduction 2005/2006. Graph Drawing: Introduction2 Contents Applications of graph drawing Planar graphs: some theory Different types of.
Rational Trigonometry Applied to Robotics
Chapter 5 Orthogonality
Configuration Space CS 326 A: Motion Planning
International Workshop on Computer Vision - Institute for Studies in Theoretical Physics and Mathematics, April , Tehran 1 IV COMPUTING SIZE.
1 Last lecture  Path planning for a moving Visibility graph Cell decomposition Potential field  Geometric preliminaries Implementing geometric primitives.
Planning Paths for Elastic Objects Under Manipulation Constraints Florent Lamiraux Lydia E. Kavraki Rice University Presented by: Michael Adams.
EULER INTEGRATION OF GAUSSIAN RANDOM FIELDS AND PERSISTENT HOMOLOGY O MER B OBROWSKI & M ATTHEW S TROM B ORMAN Presented by Roei Zohar.
CS 326A: Motion Planning Configuration Space. Motion Planning Framework Continuous representation (configuration space and related spaces + constraints)
Gradient Methods May Preview Background Steepest Descent Conjugate Gradient.
Wilson-’t Hooft operators and the theta angle Måns Henningson Chalmers University of Technology.
BINARY MORPHOLOGY and APPLICATIONS IN ROBOTICS. Applications of Minkowski Sum 1.Minkowski addition plays a central role in mathematical morphology 2.It.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2003/index.htm Configuration Space – Basic Path-Planning Methods.
ME Robotics DIFFERENTIAL KINEMATICS Purpose: The purpose of this chapter is to introduce you to robot motion. Differential forms of the homogeneous.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Inverse Kinematics Jacobian Matrix Trajectory Planning
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
Introduction to ROBOTICS
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Wei Wang Xi’an Jiaotong University Generalized Spectral Characterization of Graphs: Revisited Shanghai Conference on Algebraic Combinatorics (SCAC), Shanghai,
MCS312: NP-completeness and Approximation Algorithms
Section 2: Finite Element Analysis Theory
Computing and Communicating Functions over Sensor Networks A.Giridhar and P. R. Kumar Presented by Srikanth Hariharan.
V. Space Curves Types of curves Explicit Implicit Parametric.
Measuring The Elliptic Genus Gregory Moore Rutgers AndyFest, Harvard, July 31, 2015.
CS B659: Principles of Intelligent Robot Motion Configuration Space.
Random volumes from matrices Sotaro Sugishita (Kyoto Univ.) Masafumi Fukuma & Naoya Umeda (Kyoto Univ.) arXiv: (accepted in JHEP)
The Geometry of Moduli Space and Trace Anomalies. A.Schwimmer (with J.Gomis,P-S.Nazgoul,Z.Komargodski, N.Seiberg,S.Theisen)
Lines in the plane, slopes, and Euler’s formula by Tal Harel
Outline: Introduction Solvability Manipulator subspace when n<6
On the Notion of Pseudo-Free Groups Ronald L. Rivest MIT Computer Science and Artificial Intelligence Laboratory TCC 2/21/2004.
On generalization of Khovanov link homologies
Heegaard Floer Homology and Existence of Incompressible Tori in Three-manifolds Eaman Eftekhary IPM, Tehran, Iran.
Math 3121 Abstract Algebra I Lecture 14 Sections
1 Covering Non-uniform Hypergraphs Endre Boros Yair Caro Zoltán Füredi Raphael Yuster.
Basic Theory (for curve 01). 1.1 Points and Vectors  Real life methods for constructing curves and surfaces often start with points and vectors, which.
Donghyun (David) Kim Department of Mathematics and Physics North Carolina Central University 1 Chapter 2 Context-Free Languages Some slides are in courtesy.
Euler characteristic (simple form):
Extending a displacement A displacement defined by a pair where l is the length of the displacement and  the angle between its direction and the x-axix.
Complex Variables. Complex Variables Open Disks or Neighborhoods Definition. The set of all points z which satisfy the inequality |z – z0|
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
Steven Lindell Scott Weinstein
Polyhedron Here, we derive a representation of polyhedron and see the properties of the generators. We also see how to identify the generators. The results.
How to Get Where you Want to Go
TOPOLOGICAL COMPLEXITY OF KINEMATIC MAPS
Chapter 5: Morse functions and function-induced persistence
Chapter 3: Simplicial Homology Instructor: Yusu Wang
Presentation transcript:

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Based on the paper by M. Farber and D. Schütz Presented by Yair Carmon

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Contents Linkages: Introduction/Reminder Main result: Betti numbers of a planar linkage Remarks on main results (very informal) Outline of proof 2

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Acknowledgement I would like to thank my brother Dan for helpful discussions 3

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon The mechanical linkage “rigid links connected with joints to form a closed chain, or a series of closed chains” Linkages are useful! We limit ourselves to a single 2d chain w/ two fixed joints Definition and animations courtesy of WikipediaWikipedia Klann linkage Peaucellier–Lipkin linkage Chebyshev linkage 4

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Configuration space of a planar linkage Informally: the set of angles in an n –edges polygon Formally: Modulo SO(2) is equivalent to two fixed joints 5

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Configuration space – properties M l is n –3 dimensional l is called “generic” if M l contains no collinear cfgs For generic l, M l is a closed smooth manifold For non–generic l, M l is a compact manifold with finitely many singular points (the collinear configurations) 6

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Configuration space – examples 7

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Betti numbers of a planar linkage A subset is called short/median/long if Assume l 1 is maximal, and define, s k ( m k ) – the number of short (median) subsets of size k+1 containing the index 1 Then H k (M l ; Z) is free abelian of rank 8

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Back to the examples 9

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon The non-generic cases (n=4) 10

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon The non-generic cases (n=4) 11

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon The non-generic cases (n=4) 12

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Remark (1) – order of the edges The order of edges doesn’t matter – not surprising! M l is explicitly independent on edge order: Also, there is a clear isomorphism between permutations of l : 13

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Remark (2) – b 0 (M l ) Assume w.l.o For nontrivial M l, s 0 = 1 and m 0 = 0 s n–3 = 1 iff {2,3} is long, and s n–3 = 0 otherwise  b 0 (M l ) = 2 iff {2,3} is long, and = 1 otherwise Geometric meaning: existence of path between a configuration and its reflection 14

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Remark (2) – b 0 (M l ), geometric proof w.l.o assume the longest edge is connected to both second longest edges, and their lengths are l 1, l 2, l 3 In a path from a config to its reflection, each angle must pass through 0 or  If {2,3} is long the angle between l 1 and l 2 can’t be  Let’s see if it can be zero: 15

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Remark (2’) – topology when b 0 (M l ) If b 0 (M l ) = 2, every set that contains 1 and contains neither 2 nor 3 is short, therefore: The Poincaré polynomial is 2(1+t) n–3 In this case M l was proven to have the topology of two disjoint tori of dimension n–3 : 16

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Remark (3) – Equilateral case Nongeneric for even n Betti numbers can be computed from simple combinatorics (boring) Sum of betti numbers is maximal in the equilateral case (proven in the paper) 17

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Remark (4) – Euler characteristic In the generic case A striking difference between even and odd n ! For the nongeneric case, add 18

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon (some of) The ideas behind the proof Warning – hand waving ahead! 19

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon The short version Define W, the configuration space of an open chain Define W a, by putting a ball in the end of the chain The homology of W is simple to calculate (it’s a torus) The homology of W a is derived (for small enough a ) – using Morse theory and reflection symmetry The homology of M l is derived from their “difference” 20

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon W – “the robot arm” Not dependant on l This is an n – 1 dimensional cfg space that contains M l W J  W is the subspace for which i.e. locked robot arm W J  M l =  iff J is long 21

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon f l – the robot arm distance metric a < 0 chosen so that W J  W a iff J is long f l is Morse on W, W a The critical points of f l are collinear configurations p I ( I long) such that, p I  W J iff J  I, and has index n – | I | (for long J ) p J is the global maximum of W J (for long J ) 22

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Homology of W Reminder: W is diffeomorphic to T n–1 H i (W ; Z) is free abelian and generated by the homology classes of the sub–tori of dimension i These are exactly the manifolds W J for which 1  J and i = n – |J| Therefore, 23

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Homology of W a Everything ( W, W a, W J, f l ) is invariant to reflection! Critical points of f l are fixed points for reflection! Every critical point of f l in W a is contained in a W J in which it’s a global maximum (all the long J ’s) [Apply some fancy Morse theory…] 24

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon H i (W a ) and H i (W ) revisited Rewrite the homology calsses Where, S i / M i / L i are generated by the set of classes [ W J ] for which J which is short/median/long, |J| = n – i and 1  J is like L i but with 1  J 25

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Homomorphism Define a natural homomorphism, By treating every homology class in W a as a class in W Clearly, It can be shown that Therefore, 26

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Homology of M l M l is a deformation retract of [somehow] Obtain the short exact sequence: Every point in H i (M l ) can expressed with two “coordinates” from the other groups, and it’s an isomorphism since we’re free abelian 27

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon Homology of M l – the end Putting it all together, 28

M. Farber and D. Schütz | Homology of Planar Polygon Spaces | Presented by Yair Carmon 29