Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar.

Slides:



Advertisements
Similar presentations
Alpha Shapes. Used for Shape Modelling Creates shapes out of point sets Gives a hierarchy of shapes. Has been used for detecting pockets in proteins.
Advertisements

Tyler White MATH 493 Dr. Wanner
Problems in curves and surfaces M. Ramanathan Problems in curves and surfaces.
Lecture 5: Triangulations & simplicial complexes (and cell complexes). in a series of preparatory lectures for the Fall 2013 online course MATH:7450 (22M:305)
Delaunay Meshing for Piecewise Smooth Complexes Tamal K. Dey The Ohio State U. Joint work: Siu-Wing Cheng, Joshua Levine, Edgar A. Ramos.
Computational Topology for Computer Graphics Klein bottle.
CHAPTER 5: CONVEX POLYTOPES Anastasiya Yeremenko 1.
Knots and Links - Introduction and Complexity Results Krishnaram Kenthapadi 11/27/2002.
1/50 Department of Computer Science and Engineering Localized Delaunay Refinement for Sampling and Meshing Tamal K. Dey Joshua A. Levine Andrew G. Slatton.
©2008 I.K. Darcy. All rights reserved This work was partially supported by the Joint DMS/NIGMS Initiative to Support Research in the Area of Mathematical.
Motion Planning. Basic Topology Definitions  Open set / closed set  Boundary point / interior point / closure  Continuous function  Parametric curve.
Simplicial Sets, and Their Application to Computing Homology Patrick Perry November 27, 2002.
1 Numerical geometry of non-rigid shapes Mathematical background Mathematical background Tutorial 1 © Maks Ovsjanikov, Alex & Michael Bronstein tosca.cs.technion.ac.il/book.
Nicholas Lawrance | ICRA 20111Nicholas Lawrance | Thesis Defence1 1 Functional Analysis I Presented by Nick Lawrance.
Voronoi Diagrams and Delaunay Triangulations Generalized spaces and distances.
Chapter Two: Vector Spaces I.Definition of Vector Space II.Linear Independence III.Basis and Dimension Topic: Fields Topic: Crystals Topic: Voting Paradoxes.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
Fundamental spatial concepts
Lecture II.  Using the example from Birenens Chapter 1: Assume we are interested in the game Texas lotto (similar to Florida lotto).  In this game,
MA5209 Algebraic Topology Wayne Lawton Department of Mathematics National University of Singapore S ,
Guofeng Cao CyberInfrastructure and Geospatial Information Laboratory Department of Geography National Center for Supercomputing Applications (NCSA) University.
Relative Location of a Point with Respect to a Straight Line (0,0) 5 5 (2, 2) (4, 5) (0, 5) (6, 3) -3x + 2y +2 = 0 s = A x t + B y t + C s < 0 s > 0.
Department of Computer Science and Engineering Practical Algorithm for a Large Class of Domains Tamal K. Dey and Joshua A. Levine The Ohio State University.
General (point-set) topology Jundong Liu Ohio Univ.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesFunctions.
TEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF MATHEMATICAL SCIENCES An Algorithm for the Computation of the Metric.
Sets and Functions Contents  Set language  Basic knowledge on sets  Intervals  Functions (Mappings)
1/43 Department of Computer Science and Engineering Delaunay Mesh Generation Tamal K. Dey The Ohio State University.
Language: Set of Strings
CHAPTER 3 FUZZY RELATION and COMPOSITION. 3.1 Crisp relation Product set Definition (Product set) Let A and B be two non-empty sets, the product.
1 Outline Previous work on geometric and solid modeling Multiresolution models based on tetrahedral meshes for volume data analysis Current work on non-manifold.
Topology By: Jarek Esswein.
Dr. Wang Xingbo Fall , 2005 Mathematical & Mechanical Method in Mechanical Engineering.
March 24, 2006 Fixed Point Theory in Fréchet Space D. P. Dwiggins Systems Support Office of Admissions Department of Mathematical Sciences Analysis Seminar.
I.4 Polyhedral Theory 1. Integer Programming  Objective of Study: want to know how to describe the convex hull of the solution set to the IP problem.
Sets Definition: A set is an unordered collection of objects, called elements or members of the set. A set is said to contain its elements. We write a.
Introductory Notes on Geometric Aspects of Topology PART I: Experiments in Topology 1964 Stephen Barr (with some additional material from Elementary Topology.
1 k Jarek Rossignac,  2008 Topology  What is a polygon?  Set operations  Interior, boundary, exterior  Skin, Hair, Wound,
Spectral Partitioning: One way to slice a problem in half C B A.
MATH:7450 (22M:305) Topics in Topology: Scientific and Engineering Applications of Algebraic Topology Sept 9, 2013: Create your own homology. Fall 2013.
Euler characteristic (simple form):
2004/10/5fuzzy set theory chap03.ppt1 Classical Set Theory.
Summary of the Last Lecture This is our second lecture. In our first lecture, we discussed The vector spaces briefly and proved some basic inequalities.
Creating a cell complex = CW complex Building block: n-cells = { x in R n : || x || ≤ 1 } 2-cell = open disk = { x in R 2 : ||x || < 1 } Examples: 0-cell.
Sept 25, 2013: Applicable Triangulations.
Relations, Functions, and Matrices
Alexander Horned Sphere
Creating a cell complex = CW complex
Principles of GIS Fundamental spatial concepts – Part II Shaowen Wang
Chapter 3 The Real Numbers.
Non-manifold Multiresolution Modeling (some preliminary results)
Basic mathematics topology definition
Algebraic Topology and Distributed Computing
Elements of Combinatorial Topology
Wait-Free Computability for General Tasks
Additive Combinatorics and its Applications in Theoretical CS
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.
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.
Algebraic Topology and Decidability in Distributed Computing
e2 e1 e5 e4 e3 v1 v2 v3 v4 f The dimension of f = 2
Chapter 3 The Real Numbers.
I.4 Polyhedral Theory (NW)
Quantum Foundations Lecture 3
I.4 Polyhedral Theory.
Combinatorial Topology and Distributed Computing
Chapter 5: Morse functions and function-induced persistence
RAYAT SHIKSHAN SANSTHA’S S.M.JOSHI COLLEGE HADAPSAR, PUNE
e2 e1 e5 e4 e3 v1 v2 v3 v4 f The dimension of f =
Chapter 3: Simplicial Homology Instructor: Yusu Wang
Prof. Lizhuang Ma Shanghai Jiao Tong University
Presentation transcript:

Topology Preserving Edge Contraction Paper By Dr. Tamal Dey et al Presented by Ramakrishnan Kazhiyur-Mannar

Some Definitions (Lots actually) Point – a d-dimensional point is a d-tuple of real numbers. Norm of a Point – If the point x = (x 1, x 2, x 3 …x d ), the norm ||x|| = (  x i 2 ) 1/2 Euclidean Space – A d-dimensional Euclidean space R d is the set of d-dimensional points together with the euclidean distance function mapping each set of points (x,y) to ||x-y||.

More Definitions d–1 sphere: S d-1 = {x  R d | ||x|| = 1} 1-Sphere – Circle, 2-Sphere-Sphere (hollow) d-ball: B d = {x  R d | ||x||  1} 2-ball - Disk (curve+interior), 3-ball – Sphere (Solid) The surface of a d-ball is a d-1 sphere. d-halfspace: H d = {x  R d | x 1 = 1}

Even More Definitions Manifold:A d-manifold is a non-empty topological space where at each point, the neighborhood is either a R d or a H d. With Boundary/ Without Boundary

Lots more Definitions k-Simplex is the convex hull of k+1 affinely independent point k  0

Still more Definitions Face: If  is a simplex a face of ,  is defined by a non-empty subset of the k+1 points. Proper faces Example of faces: {p 0 }, {p 1 }, {p 0, p 0 p 1 }, {p 0, p 1, p 2, p 0 p 1, p 0 p 2, p 1 p 2, p 0 p 1 p 2 } p0p0 p1p1 p2p2 p3p3

Definitions (I have given up trying to get unique titles) Coface: If  is a face of , then  is a coface of , written as . The interior of the simplex is the set of points contained in  but not on any proper face of .

Simplicial Complex A collection of simplices, K, such that if  K and , then  K i.e. for each face in K, all the faces of it is there K and all their subfaces are there etc. and   ’  K =>  ’  or  ’  and  ’  ’ i.e. if two faces intersect, they intersect on their face.

Examples of a non-simplicial complex: {p 0, p 1, p 2, p 3, p 4, p 0 p 1, p 1 p 2, p 2 p 0, p 3 p 4 } Simplicial Complex Examples of a simplicial complex: {p 0 }, {p 0, p 1, p 2, p 0 p 1 } {p 0, p 1, p 2, p 0 p 1, p 0 p 2, p 1 p 2, p 0 p 1 p 2 } p0p0 p1p1 p2p2 p3p3 Examples of a non-simplicial complex: {p 0, p 0 p 1 } p0p0 p1p1 p2p2 p4p4 p3p3

Subcomplex, Closure A subcomplex of a simplicial complex one of its subsets that is a simplicial complex in itself. {p0, p1, p0p1} is a subcomplex of {p 0, p 1, p 2, p 0 p 1, p 1 p 2, p 2 p 0, p 0 p 1 p 2 } The Underlying space is the union of simplex interiors. |K| = U  K int 

Closure Let B  K (B need not be a subcomplex). Closure of B is the set of all faces of simplices of B. The Closure is the smallest subcomplex that contains B. p0p0 p1p1 p2p2

Star The star of B is the set of all cofaces of simplices in B.

Link Link of B is the set of all faces of cofaces of simplices in B that are disjoint from the simples in B

Mathematically Speaking Or Simply, 

Subdivision A subdivision of K is a complex Sd K such that |Sd K| = |K| and  K =>  Sd K

Homeomorphism Homeomorphism is topological equivalence An intuitive definition? Technical definition: Homeomorphism between two spaces X and Y is a bijection h: X  Y such that both h and h’ are continuous. If  a Homeomorphism between two spaces then they are homeomorphic X  Y and are said to be of the same topological type or genus.

Combinatorial Version Complexes stand for topological spaces in combinatorial domain. A vertex map for two complexes K and L is a function f: Vert K  Vert L. A Simplicial Map  : |K|  |L| is defined by

Combinatorial Version (contd.) f need not be injective or surjective. It is a homeomorphism iff f is bijective and f -1 is a vertex map. Here, we call it isomorphism denoted by K  L. There is a slight difference between isomorphism and homeomorphism.

Order Remember manifolds? What if the neighborhood of a point is not a ball? For  a simplex in K, if dim St  = k, the order is the smallest interger I for which there is a (k-i) simplex  such that St s  St h What is that mumbo-jumbo??

Order (contd.)

Boundary The J th boundary of a simplicial complex K is the set of simplices with order no less than j. Order Bound: J th boundary can contain only simplices of dimensions not more than dim K-j J th boundary contains (j+1) st Boundary. This is used to have a hierarchy of complexes.

Edge Contraction (Finally!!)

In the Language of Math… Contraction is a surjective simplicial map  ab :|K|  |L| defined by a surjective vertex map Outside |St ab|, the mapping is unity. Inside, it is not even injective. f(u) = u if u  Vert K – {a, b} c if u  {a, b}

One Last Term… An unfolding  of  ab is a simplicial homeomorphism |K|  |L|. It is local if it differs from  ab only inside |E| and it is relaxed if it differs from  ab only inside |St E| Now, WHAT IS THAT??!!!

How do I get there? Basically, the underlying space should not be affected in order to maintain topology.

So, What IS the Condition?! Simple. If I were to overlay the two stars, the links must be the same! The condition is: Lk a  Lk b = Lk ab

Finally, THANKS!!! Wake up now!!