Introduction to Computational Manifolds and Applications
|
|
- Norah Douglas
- 5 years ago
- Views:
Transcription
1 IMPA - Institto de Matemática Pra e Aplicada, Rio de Janeiro, RJ, Brazil Introdction to Comptational Manifolds and Applications Part 1 - Constrctions Prof. Marcelo Ferreira Siqeira mfsiqeira@dimap.frn.br Departmento de Informática e Matemática Aplicada Universidade Federal do Rio Grande do Norte Natal, RN, Brazil
2 Simplicial Srfaces We will start investigating the constrction of 2-dimensional PPM s in E 3. In the previos lectre, we considered a polygon as a sketch of the shape of the crve we wanted to bild. Now, we need another object to play the same role the polygon did. We can think of a few choices, bt the easiest one is argably a polygonal mesh. So, let s start with a triangle mesh, which is a formally known as a simplicial srface. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 2
3 Simplicial Srfaces Definition 9.1. Given a finite family, (a i ) i I, of points in E n, we say that (a i ) i I is affinely independent if the family of vectors, (a i a j ) j (I {i}), is linearly independent for some i I. E 2 E 2 E 2 a 1 a 0 a 0 a 2 a 1 A. I. a 0 E 2 E 2 a 3 a 1 a 0 a 2 a 1 a 2 a 0 NOT A. I. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 3
4 Simplicial Srfaces Definition 9.2. Let a 0,...,a d be any d + 1 affinely independent points in E n, where d is a non-negative integer. The simplex spanned by the points a 0,...,a d is the convex hll of these points, and is denoted by [a 0,...,a d ]. The points a 0,...,a d are the vertices of. The dimension, dim( ), of the simplex is d, and is also called a d-simplex. In E n, the largest nmber of affinely independent points is n + 1. So, in E n, we have simplices of dimension 0, 1,..., n. A 0-simplex is a point, a 1- simplex is a line segment, a 2-simplex is a triangle, and a 3-simplex is a tetrahedron. Frthermore, the convex hll of any nonempty sbset of vertices of a simplex is a simplex. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 4
5 Simplicial Srfaces Definition 9.3. Let =[a 0,...,a d ] be a d-simplex in E n. A face of is a simplex spanned by a nonempty sbset of {a 0,...,a d }; if this sbset is proper then the face is called a proper face. A face of whose dimension is k, i.e., a k-simplex, is called a k-face. a 2 a 0 a 1 a 2 a 2 a 2 a 0 a 1 a 2-face: [a 0, a 1, a 2 ] a 0 a 1 3 proper 1-faces: [a 0, a 1 ], [a 0, a 2 ], [a 1, a 2 ] a 0 a 1 3 proper 0-faces: [a 0 ], [a 1 ], [a 2 ] Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 5
6 Simplicial Srfaces Definition 9.4. A simplicial complex K in E n is a finite collection of simplices in E n sch that (1) if a simplex is in K, then all its faces are in K; (2) if, K are simplices sch that =, then is a face of both and. violates (1) violates (2) a simplicial complex Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 6
7 Simplicial Srfaces Definition 9.5. The dimension, dim(k), of a simplicial complex, K, is the largest dimension of a simplex in K, i.e., dim(k) =max{dim( ) K}. We refer to a d-dimensional simplicial complex as simply a d-complex. The set consisting of the nion of all points in the simplices of K is called the nderlying space of K, and it is denoted by K. The nderlying space, K, of K is also called the geometric realization of K. a 2-complex Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 7
8 Simplicial Srfaces A simplicial complex is a combinatorial object (i.e., a finite collection of simplices). The nderlying space of a simplicial complex is a topological object, a sbset of some E n. a 2-complex Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 8
9 Simplicial Srfaces Definition 9.6. Let K be a simplicial complex in E n. Then, for any simplex in K, we define two other complexes, the star, st(, K), and the link, lk(, K), of in K, as follows: st(, K) ={ K in K sch that is a face of and is a face of } and lk(, K) ={ K is in st(, K) and and have no face in common}. K st(, K) lk(, K) Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 9
10 Simplicial Srfaces Definition 9.7. A 2-complex K in E n is called a simplicial srface withot bondary if every 1-simplex of K is the face of precisely two simplices of K, and the nderlying space of the link of each 0-simplex of K is homeomorphic to the nit circle, S 1 = {x E 2 x = 1}. The set consisting of the 0-, 1-, and 2-faces of a 3-simplex is a simplicial srface withot bondary. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 10
11 Simplicial Srfaces The simplicial complex consisting of the proper faces of two 3-simplices (i.e., two tetrahedra) sharing a common vertex is not a simplicial srface withot bondary as the link of the common vertex of the two 3-simplices is not homeomorphic to the nit circle, S 1. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 11
12 Simplicial Srfaces From now on, we will refer to a simplicial srface withot bondary as simply a simplicial srface. The nderlying space of a simplicial srface is called its nderlying srface. The nderlying srface of a simplicial srface is a topological 2-manifold in E n. K K Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 12
13 Simplicial Srfaces Definition 9.8. Let K be a simplicial complex in E n. For each integer i, with 0 i dim(k), we define K (i) as the simplicial complex consisting of all j-simplices of K, for every j sch that 0 j i. Moreover, if L is a simplicial complex in E m, then a map f : K (0) L (0) is called a simplicial map if whenever [a 0,...,a d ] is a simplex in K, then [ f (a 0 ),..., f (a d )] is a simplex in L. A simplicial map is a simplicial isomorphism if it is a bijective map, and if its inverse is also a simplicial map. Finally, if there exists a simplicial isomorphism from K to L, then we say that K and L are simplicially isomorphic. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 13
14 Simplicial Srfaces a 2 E 3 E 2 b 1 b 2 a 3 a 0 a 1 b 0 b 5 a 4 b 3 K a 5 b 4 L K and L are simplicially isomorphic. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 14
15 Simplicial Srfaces a 2 E 3 E 2 b 1 b 2 a 3 a 0 a 1 b 0 b 5 a 4 b 3 K a 5 b 4 L Let f : K (0) L (0) be given by f (a 0 )=b 5, f (a 1 )=b 3, f (a 2 )=b 2, f (a 3 )=b 1, f (a 4 )=b 0, f (a 5 )=b 4. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 15
16 Simplicial Srfaces a 2 E 3 E 2 b 1 b 2 a 3 a 0 a 1 b 0 b 5 a 4 b 3 K a 5 b 4 L It is easily verified that f is a simplicial isomorphism. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 16
17 Gling Data Given a simplicial srface, K, in E 3, we are interested in bilding a parametric psedo-srface, M, in E 3 sch that the image, M, of M is homeomorphic to the nderlying srface, K, of K, and sch that M also approximates the geometry of K. K M Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 17
18 Gling Data As we did before, let s first focs on the definition of a set of gling data. Unfortnately, this task is not as easy as it was in the one-dimensional case. The key is to notice that the simplicial srface, K, which is a combinatorial object, explicitly defines a topological strctre on K (via the adjacency relations of all simplices). So, we shold define p-domains, gling domains, and transition fnctions based on K. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 18
19 Gling Data As we will see dring the next lectres, there are many choices for p-domains. Bt, in general, p-domains are associated with simplices of K. For instance, the vertices of K. We can define a one-to-one correspondence between p-domains and vertices of K. E 3 E 2 v w v w Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 19
20 Gling Data The previos correspondence implies that the nmber of p-domains is eqal to the nmber of vertices of K. A distinct choice of correspondence may yield a different nmber. The choice of a geometry for the p-domains is a key decision too. E 3 E 2 v w v w Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 20
21 Gling Data Intitively, each p-domain is an open "disk" that is consistently gled to other p- domains in order to define the topology of the image, M, of the parametric psedosrface. Since a vertex of K is connected only to the vertices of K that belong to the link, lk(, K), of in K, it is natral to think of the p-domain,, which is associated with vertex, as the interior of a polygon in E 2 with the same nmber of vertices as lk(, K). E 3 E 2 Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 21
22 Gling Data To simplify calclations, we can assme that is a reglar polygon inscribed in a nit circle centered at the origin of a local coordinate system of E 2. We can also assme that one vertex of is located at the point (0, 1). Now, is niqely defined. E 3 E 2 (0, 0) (0, 1) Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 22
23 Gling Data Formally, let I = { is a vertex in K}, n be the nmber of vertices of the link, lk(, K), of in K, and P be the reglar, n -polygon whose vertices are located at the points cos i 2 n, sin i 2 n, for all i = 0, 1,..., n 1. Then, we can define = P, where P is the interior of P. E 3 E 2 (0, 0) (0, 1) Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 23
24 Gling Data Checking... (1) For every i I, the set i is a nonempty open sbset of E n called parametrization domain, for short, p-domain, and any two distinct p-domains are pairwise disjoint, i.e., i j =, for all i = j. Or p-domains are (connected) open sbsets of E 2. If we assme that they live in distinct copies of E 2, then they will not overlap, and hence condition (1) of Definition 7.1 holds. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 24
25 Gling Data What abot gling domains? choice: The following pictre shold help s find a good E 3 w (0, 0) (0, 1) (0, 0) (0, 1) E 2 w Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 25
26 Gling Data To precisely define gling domains, we associate a 2-dimensional simplicial complex, K, with each p-domain. The complex K satisfies the following two conditions: (1) K, is the closre,, of and (2) K is isomorphic to the star, st(, K), of in K. An obvios choice for K is the canonical trianglation of : E 3 E 2 K Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 27
27 Gling Data Fix any conterclockwise enmeration, 0, 1,..., m, of the vertices in lk(, K). E 3 E K Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 28
28 Gling Data Let 0 be the vertex of K located at the point (0, 1). Let 0, 1,..., m be the conterclockwise enmeration of the vertices of lk(, K ) starting with 0. E E K (0, 1) 3 4 Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 29
29 Gling Data Let f : st(, K) (0) K (0) be the simplicial map given by f () = and f ( i )= i, for i = 0,..., m. It is easily verified that f is a simplicial isomorphism. E E K (0, 1) 3 4 Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 30
30 Gling Data Let and w be any two vertices of K sch that [, w] is an edge in K. Let x and y be the other two vertices of K that also belong to both st(, K) and st(w, K). E 3 y x w Assme that x precedes w in a conterclockwise traversal of the vertices of lk(, K) starting at y. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 31
31 Gling Data We can now define the gling domains, w and w, as w =Q w and w =Q w, where Q w =[f (), f (x), f (w), f (y)] and Q w =[f w (w), f w (y), f w (), f w (x)] are the qadrilaterals given by the vertices f (), f (x), f (w), f (y) of K and the vertices f w (w), f w (y), f w (), f w (x) of K w, and Q w and Q w are the interiors of Q w and Q w. E 2 E 3 f (x) f y (w) f () x w f w (w) f w (y) (0, 1) (0, 1) f (y) f w () f w (x) Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 32 w E 2
32 Gling Data Formally, for every (, w) I I, we let if = w, w = if = w and [, w] is not an edge of K, Q w if = w and [, w] is an edge of K. E 2 f (w) f (x) f () (0, 1) E 3 x y w f w (y) w E 2 f w (w) (0, 1) f (y) f w () f w (x) Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 33
33 Gling Data Checking... (2) For every pair (i, j) I I, the set ij is an open sbset of i. Frthermore, ii = i and ji = if and only if ij =. Each nonempty sbset ij (with i = j) is called a gling domain. By definition, the sets,, and Q w are open in E 2. Frthermore, the sets Q w and Q w are well-defined and nonempty, for every, w I sch that [, w] is an edge of K. So, for every, w I, we have that w = iff [, w] is an edge of K. Ths, for every, w I, w = iff w =, and hence condition (2) of Definition 7.1 also holds. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 34
34 Gling Data Or definitions of p-domain and gling domain natrally lead s to a gling process indced by the gling of the stars of the vertices of K along their common edges and triangles. The gling strategy we adopted here does not depend on the geometry of the p- domains and gling domains, bt on the adjacency relations of vertices and edges of K. However, the geometry of the p-domains and gling domains have a strong inflence in the level of difficlty of the transition maps and parametrizations we choose to se. Despite of or commitment to a particlar geometry, we will present next an axiomatic way of defining the transition maps. Or axiomatic definition shold be as mch independent of the geometry of the p-domains and gling domains as possible. Comptational Manifolds and Applications (CMA) , IMPA, Rio de Janeiro, RJ, Brazil 35
Introduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Constructions Prof. Marcelo Ferreira Siqueira mfsiqueira@dimap.ufrn.br
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationh-vectors of PS ear-decomposable graphs
h-vectors of PS ear-decomposable graphs Nima Imani 2, Lee Johnson 1, Mckenzie Keeling-Garcia 1, Steven Klee 1 and Casey Pinckney 1 1 Seattle University Department of Mathematics, 901 12th Avene, Seattle,
More informationCOMPOSITION OF STABLE SET POLYHEDRA
COMPOSITION OF STABLE SET POLYHEDRA Benjamin McClosky and Illya V. Hicks Department of Comptational and Applied Mathematics Rice University November 30, 2007 Abstract Barahona and Mahjob fond a defining
More informationTriangle-Free Planar Graphs as Segments Intersection Graphs
Triangle-ree Planar Graphs as Segments Intersection Graphs N. de Castro 1,.J.Cobos 1, J.C. Dana 1,A.Márqez 1, and M. Noy 2 1 Departamento de Matemática Aplicada I Universidad de Sevilla, Spain {natalia,cobos,dana,almar}@cica.es
More informationMTL 776: Graph Algorithms. B S Panda MZ 194
MTL 776: Graph Algorithms B S Panda MZ 194 bspanda@maths.iitd.ac.in bspanda1@gmail.com Lectre-1: Plan Definitions Types Terminology Sb-graphs Special types of Graphs Representations Graph Isomorphism Definitions
More informationLecture notes for Topology MMA100
Lecture notes for Topology MMA100 J A S, S-11 1 Simplicial Complexes 1.1 Affine independence A collection of points v 0, v 1,..., v n in some Euclidean space R N are affinely independent if the (affine
More informationBasics of Combinatorial Topology
Chapter 7 Basics of Combinatorial Topology 7.1 Simplicial and Polyhedral Complexes In order to study and manipulate complex shapes it is convenient to discretize these shapes and to view them as the union
More informationIntroduction to Computational Manifolds and Applications
IMPA - Instituto de Matemática Pura e Aplicada, Rio de Janeiro, RJ, Brazil Introduction to Computational Manifolds and Applications Part 1 - Foundations Prof. Jean Gallier jean@cis.upenn.edu Department
More informationLecture 5: Simplicial Complex
Lecture 5: Simplicial Complex 2-Manifolds, Simplex and Simplicial Complex Scribed by: Lei Wang First part of this lecture finishes 2-Manifolds. Rest part of this lecture talks about simplicial complex.
More information4. Simplicial Complexes and Simplicial Homology
MATH41071/MATH61071 Algebraic topology Autumn Semester 2017 2018 4. Simplicial Complexes and Simplicial Homology Geometric simplicial complexes 4.1 Definition. A finite subset { v 0, v 1,..., v r } R n
More informationSimplicial Complexes: Second Lecture
Simplicial Complexes: Second Lecture 4 Nov, 2010 1 Overview Today we have two main goals: Prove that every continuous map between triangulable spaces can be approximated by a simplicial map. To do this,
More informationTopological Drawings of Complete Bipartite Graphs
Topological Drawings of Complete Bipartite Graphs Jean Cardinal Stefan Felsner y Febrary 017 Abstract Topological drawings are natral representations of graphs in the plane, where vertices are represented
More informationAugmenting the edge connectivity of planar straight line graphs to three
Agmenting the edge connectivity of planar straight line graphs to three Marwan Al-Jbeh Mashhood Ishaqe Kristóf Rédei Diane L. Sovaine Csaba D. Tóth Pavel Valtr Abstract We characterize the planar straight
More informationGeometric and Solid Modeling. Problems
Geometric and Solid Modeling Problems Define a Solid Define Representation Schemes Devise Data Structures Construct Solids Page 1 Mathematical Models Points Curves Surfaces Solids A shape is a set of Points
More information66 III Complexes. R p (r) }.
66 III Complexes III.4 Alpha Complexes In this section, we use a radius constraint to introduce a family of subcomplexes of the Delaunay complex. These complexes are similar to the Čech complexes but differ
More informationConstrained Routing Between Non-Visible Vertices
Constrained Roting Between Non-Visible Vertices Prosenjit Bose 1, Matias Korman 2, André van Renssen 3,4, and Sander Verdonschot 1 1 School of Compter Science, Carleton University, Ottawa, Canada. jit@scs.carleton.ca,
More informationp 1 p 2 p 3 S u( ) θ
Preprint of a paper pblished in inimal Srfaces, Geometric Analysis and Symplectic Geometry Adv. Std. Pre ath, 34 (2002) 129 142. SOLUTION TO THE SHADOW PROBLE IN 3-SPACE OHAAD GHOI Abstract. If a convex
More informationTutte Embeddings of Planar Graphs
Spectral Graph Theory and its Applications Lectre 21 Ttte Embeddings o Planar Graphs Lectrer: Daniel A. Spielman November 30, 2004 21.1 Ttte s Theorem We sally think o graphs as being speciied by vertices
More informationPacific Journal of Mathematics
Pacific Journal of Mathematics SIMPLIFYING TRIANGULATIONS OF S 3 Aleksandar Mijatović Volume 208 No. 2 February 2003 PACIFIC JOURNAL OF MATHEMATICS Vol. 208, No. 2, 2003 SIMPLIFYING TRIANGULATIONS OF S
More informationTri-Edge-Connectivity Augmentation for Planar Straight Line Graphs
Tri-Edge-Connectivity Agmentation for Planar Straight Line Graphs Marwan Al-Jbeh 1, Mashhood Ishaqe 1, Kristóf Rédei 1, Diane L. Sovaine 1, and Csaba D. Tóth 1,2 1 Department of Compter Science, Tfts University,
More information6.2 Classification of Closed Surfaces
Table 6.1: A polygon diagram 6.1.2 Second Proof: Compactifying Teichmuller Space 6.2 Classification of Closed Surfaces We saw that each surface has a triangulation. Compact surfaces have finite triangulations.
More informationFault Tolerance in Hypercubes
Falt Tolerance in Hypercbes Shobana Balakrishnan, Füsn Özgüner, and Baback A. Izadi Department of Electrical Engineering, The Ohio State University, Colmbs, OH 40, USA Abstract: This paper describes different
More information4.2 Simplicial Homology Groups
4.2. SIMPLICIAL HOMOLOGY GROUPS 93 4.2 Simplicial Homology Groups 4.2.1 Simplicial Complexes Let p 0, p 1,... p k be k + 1 points in R n, with k n. We identify points in R n with the vectors that point
More informationLecture 3A: Generalized associahedra
Lecture 3A: Generalized associahedra Nathan Reading NC State University Cluster Algebras and Cluster Combinatorics MSRI Summer Graduate Workshop, August 2011 Introduction Associahedron and cyclohedron
More informationarxiv: v3 [math.co] 7 Sep 2018
Cts in matchings of 3-connected cbic graphs Kolja Knaer Petr Valicov arxiv:1712.06143v3 [math.co] 7 Sep 2018 September 10, 2018 Abstract We discss conjectres on Hamiltonicity in cbic graphs (Tait, Barnette,
More informationDynamic Maintenance of Majority Information in Constant Time per Update? Gudmund S. Frandsen and Sven Skyum BRICS 1 Department of Computer Science, Un
Dynamic Maintenance of Majority Information in Constant Time per Update? Gdmnd S. Frandsen and Sven Skym BRICS 1 Department of Compter Science, University of arhs, Ny Mnkegade, DK-8000 arhs C, Denmark
More informationTu P7 15 First-arrival Traveltime Tomography with Modified Total Variation Regularization
T P7 15 First-arrival Traveltime Tomography with Modified Total Variation Reglarization W. Jiang* (University of Science and Technology of China) & J. Zhang (University of Science and Technology of China)
More informationFast Ray Tetrahedron Intersection using Plücker Coordinates
Fast Ray Tetrahedron Intersection sing Plücker Coordinates Nikos Platis and Theoharis Theoharis Department of Informatics & Telecommnications University of Athens Panepistemiopolis, GR 157 84 Ilissia,
More informationManifolds. Chapter X. 44. Locally Euclidean Spaces
Chapter X Manifolds 44. Locally Euclidean Spaces 44 1. Definition of Locally Euclidean Space Let n be a non-negative integer. A topological space X is called a locally Euclidean space of dimension n if
More informationCurves and Surfaces. CS 537 Interactive Computer Graphics Prof. David E. Breen Department of Computer Science
Crves and Srfaces CS 57 Interactive Compter Graphics Prof. David E. Breen Department of Compter Science E. Angel and D. Shreiner: Interactive Compter Graphics 6E Addison-Wesley 22 Objectives Introdce types
More informationToric Cohomological Rigidity of Simple Convex Polytopes
Toric Cohomological Rigidity of Simple Convex Polytopes Dong Youp Suh (KAIST) The Second East Asian Conference on Algebraic Topology National University of Singapore December 15-19, 2008 1/ 28 This talk
More informationLecture 5 CLASSIFICATION OF SURFACES
Lecture 5 CLASSIFICATION OF SURFACES In this lecture, we present the topological classification of surfaces. This will be done by a combinatorial argument imitating Morse theory and will make use of the
More informationCurve Modeling (Spline) Dr. S.M. Malaek. Assistant: M. Younesi
Crve Modeling Sline Dr. S.M. Malae Assistant: M. Yonesi Crve Modeling Sline Crve Control Points Convex Hll Shae of sline crve Interolation Slines Aroximation Slines Continity Conditions Parametric & Geometric
More informationbstract By a cooperative game in coalitional strctre or shortly coalitional game we mean the standard cooperative non-transferable tility game describ
Cooperative Games in Graph Strctre 1 P. Jean-Jacqes Herings 2 Gerard van der Laan 3 Dolf Talman 4 gst 9, 2000 1 This research is part of the VF-program "Competition and Cooperation". 2 P.J.J. Herings,
More informationOn Plane Constrained Bounded-Degree Spanners
On Plane Constrained Bonded-Degree Spanners Prosenjit Bose 1, Rolf Fagerberg 2, André an Renssen 1, Sander Verdonschot 1 1 School of Compter Science, Carleton Uniersity, Ottaa, Canada. Email: jit@scs.carleton.ca,
More informationSimplicial Objects and Homotopy Groups. J. Wu
Simplicial Objects and Homotopy Groups J. Wu Department of Mathematics, National University of Singapore, Singapore E-mail address: matwuj@nus.edu.sg URL: www.math.nus.edu.sg/~matwujie Partially supported
More informationToday. B-splines. B-splines. B-splines. Computergrafik. Curves NURBS Surfaces. Bilinear patch Bicubic Bézier patch Advanced surface modeling
Comptergrafik Matthias Zwicker Uniersität Bern Herbst 29 Cres Srfaces Parametric srfaces Bicbic Bézier patch Adanced srface modeling Piecewise Bézier cres Each segment spans for control points Each segment
More informationThe Classification Theorem for Compact Surfaces
The Classification Theorem for Compact Surfaces Jean Gallier CIS Department University of Pennsylvania jean@cis.upenn.edu October 31, 2012 The Classification of Surfaces: The Problem So you think you know
More informationLecture 0: Reivew of some basic material
Lecture 0: Reivew of some basic material September 12, 2018 1 Background material on the homotopy category We begin with the topological category TOP, whose objects are topological spaces and whose morphisms
More informationPOWER-OF-2 BOUNDARIES
Warren.3.fm Page 5 Monday, Jne 17, 5:6 PM CHAPTER 3 POWER-OF- BOUNDARIES 3 1 Ronding Up/Down to a Mltiple of a Known Power of Ronding an nsigned integer down to, for eample, the net smaller mltiple of
More informationHowever, this is not always true! For example, this fails if both A and B are closed and unbounded (find an example).
98 CHAPTER 3. PROPERTIES OF CONVEX SETS: A GLIMPSE 3.2 Separation Theorems It seems intuitively rather obvious that if A and B are two nonempty disjoint convex sets in A 2, then there is a line, H, separating
More informationMultiple-Choice Test Chapter Golden Section Search Method Optimization COMPLETE SOLUTION SET
Mltiple-Choice Test Chapter 09.0 Golden Section Search Method Optimization COMPLETE SOLUTION SET. Which o the ollowing statements is incorrect regarding the Eqal Interval Search and Golden Section Search
More information2018 AMS short course Discrete Differential Geometry. Discrete Mappings. Yaron Lipman Weizmann Institute of Science
2018 AMS short course Discrete Differential Geometry 1 Discrete Mappings Yaron Lipman Weizmann Institute of Science 2 Surfaces as triangulations Triangles stitched to build a surface. 3 Surfaces as triangulations
More informationReconstructing Generalized Staircase Polygons with Uniform Step Length
Jornal of Graph Algorithms and Applications http://jgaa.info/ ol. 22, no. 3, pp. 431 459 (2018) DOI: 10.7155/jgaa.00466 Reconstrcting Generalized Staircase Polygons with Uniform Step Length Nodari Sitchinaa
More informationA convenient way to construct large simplicial complexes is through specifying sets and recording their intersection patterns.
III.2 Convex Set Systems 53 III.2 Convex Set Systems A convenient way to construct large simplicial complexes is through specifying sets and recording their intersection patterns. Nerves. Let F be a finite
More informationEECS 487: Interactive Computer Graphics f
Interpolating Key Vales EECS 487: Interactive Compter Graphics f Keys Lectre 33: Keyframe interpolation and splines Cbic splines The key vales of each variable may occr at different frames The interpolation
More informationEvaluating Influence Diagrams
Evalating Inflence Diagrams Where we ve been and where we re going Mark Crowley Department of Compter Science University of British Colmbia crowley@cs.bc.ca Agst 31, 2004 Abstract In this paper we will
More informationTrinities, hypergraphs, and contact structures
Trinities, hypergraphs, and contact structures Daniel V. Mathews Daniel.Mathews@monash.edu Monash University Discrete Mathematics Research Group 14 March 2016 Outline 1 Introduction 2 Combinatorics of
More informationElementary Combinatorial Topology
Elementary Combinatorial Topology Frédéric Meunier Université Paris Est, CERMICS, Ecole des Ponts Paristech, 6-8 avenue Blaise Pascal, 77455 Marne-la-Vallée Cedex E-mail address: frederic.meunier@cermics.enpc.fr
More informationCS 4204 Computer Graphics
CS 424 Compter Graphics Crves and Srfaces Yong Cao Virginia Tech Reference: Ed Angle, Interactive Compter Graphics, University of New Mexico, class notes Crve and Srface Modeling Objectives Introdce types
More informationarxiv: v1 [cs.cg] 26 Sep 2018
Convex partial transversals of planar regions arxiv:1809.10078v1 [cs.cg] 26 Sep 2018 Vahideh Keikha Department of Mathematics and Compter Science, University of Sistan and Balchestan, Zahedan, Iran va.keikha@gmail.com
More informationOn Plane Constrained Bounded-Degree Spanners
Algorithmica manscript No. (ill be inserted by the editor) 1 On Plane Constrained Bonded-Degree Spanners 2 3 Prosenjit Bose Rolf Fagerberg André an Renssen Sander Verdonschot 4 5 Receied: date / Accepted:
More informationApplication of Gaussian Curvature Method in Development of Hull Plate Surface
Marine Engineering Frontiers (MEF) Volme 2, 204 Application of Gassian Crvatre Method in Development of Hll Plate Srface Xili Zh, Yjn Li 2 Dept. of Infor., Dalian Univ., Dalian 6622, China 2 Dept. of Naval
More informationOPTI-502 Optical Design and Instrumentation I John E. Greivenkamp Homework Set 9 Fall, 2018
OPTI-502 Optical Design and Instrmentation I John E. Greivenkamp Assigned: 10/31/18 Lectre 21 De: 11/7/18 Lectre 23 Note that in man 502 homework and exam problems (as in the real world!!), onl the magnitde
More informationarxiv: v1 [cs.cg] 1 Feb 2016
The Price of Order Prosenjit Bose Pat Morin André van Renssen, arxiv:160.00399v1 [cs.cg] 1 Feb 016 Abstract We present tight bonds on the spanning ratio of a large family of ordered θ-graphs. A θ-graph
More informationA Flavor of Topology. Shireen Elhabian and Aly A. Farag University of Louisville January 2010
A Flavor of Topology Shireen Elhabian and Aly A. Farag University of Louisville January 2010 In 1670 s I believe that we need another analysis properly geometric or linear, which treats place directly
More informationThe Cyclic Cycle Complex of a Surface
The Cyclic Cycle Complex of a Surface Allen Hatcher A recent paper [BBM] by Bestvina, Bux, and Margalit contains a construction of a cell complex that gives a combinatorial model for the collection of
More informationarxiv: v1 [cs.cg] 27 Nov 2015
On Visibility Representations of Non-planar Graphs Therese Biedl 1, Giseppe Liotta 2, Fabrizio Montecchiani 2 David R. Cheriton School of Compter Science, University of Waterloo, Canada biedl@waterloo.ca
More informationReflection groups 4. Mike Davis. May 19, Sao Paulo
Reflection groups 4 Mike Davis Sao Paulo May 19, 2014 https://people.math.osu.edu/davis.12/slides.html 1 2 Exotic fundamental gps Nonsmoothable aspherical manifolds 3 Let (W, S) be a Coxeter system. S
More informationOn Bichromatic Triangle Game
On Bichromatic Triangle Game Gordana Manić Daniel M. Martin Miloš Stojakoić Agst 16, 2012 Abstract We stdy a combinatorial game called Bichromatic Triangle Game, defined as follows. Two players R and B
More informationDISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017
DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU 15-458/858B Fall 2017 LECTURE 2: THE SIMPLICIAL COMPLEX DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU
More informationHandles. The justification: For a 0 genus triangle mesh we can write the formula as follows:
Handles A handle in a 3d mesh is a through hole. The number of handles can be extracted of the genus of the 3d mesh. Genus is the number of times we can cut 2k edges without disconnecting the 3d mesh.
More informationA sufficient condition for spiral cone beam long object imaging via backprojection
A sfficient condition for spiral cone beam long object imaging via backprojection K. C. Tam Siemens Corporate Research, Inc., Princeton, NJ, USA Abstract The response of a point object in cone beam spiral
More informationAlgebraic Topology: A brief introduction
Algebraic Topology: A brief introduction Harish Chintakunta This chapter is intended to serve as a brief, and far from comprehensive, introduction to Algebraic Topology to help the reading flow of this
More informationApproximating Polygonal Objects by Deformable Smooth Surfaces
Approximating Polygonal Objects by Deformable Smooth Surfaces Ho-lun Cheng and Tony Tan School of Computing, National University of Singapore hcheng,tantony@comp.nus.edu.sg Abstract. We propose a method
More informationγ 2 γ 3 γ 1 R 2 (b) a bounded Yin set (a) an unbounded Yin set
γ 1 γ 3 γ γ 3 γ γ 1 R (a) an unbounded Yin set (b) a bounded Yin set Fig..1: Jordan curve representation of a connected Yin set M R. A shaded region represents M and the dashed curves its boundary M that
More informationChapter 4 Concepts from Geometry
Chapter 4 Concepts from Geometry An Introduction to Optimization Spring, 2014 Wei-Ta Chu 1 Line Segments The line segment between two points and in R n is the set of points on the straight line joining
More informationAs a consequence of the operation, there are new incidences between edges and triangles that did not exist in K; see Figure II.9.
II.4 Surface Simplification 37 II.4 Surface Simplification In applications it is often necessary to simplify the data or its representation. One reason is measurement noise, which we would like to eliminate,
More informationMinimum Spanning Trees Outline: MST
Minimm Spanning Trees Otline: MST Minimm Spanning Tree Generic MST Algorithm Krskal s Algorithm (Edge Based) Prim s Algorithm (Vertex Based) Spanning Tree A spanning tree of G is a sbgraph which is tree
More informationClassifications in Low Dimensions
Chapter XI Classifications in Low Dimensions In different geometric subjects there are different ideas which dimensions are low and which high. In topology of manifolds low dimension means at most 4. However,
More informationPicking and Curves Week 6
CS 48/68 INTERACTIVE COMPUTER GRAPHICS Picking and Crves Week 6 David Breen Department of Compter Science Drexel University Based on material from Ed Angel, University of New Mexico Objectives Picking
More informationToric Varieties and Lattice Polytopes
Toric Varieties and Lattice Polytopes Ursula Whitcher April 1, 006 1 Introduction We will show how to construct spaces called toric varieties from lattice polytopes. Toric fibrations correspond to slices
More informationMathematica(l) Roller Coasters
Mathematica(l) Roller Coasters Selwyn Hollis Department of Mathematics Armstrong Atlantic State University Savannah, GA 31419 shollis@armstrong.ed à Introdction Mathematica animations that simlate roller
More informationThe orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.
Title Author(s) The orientability of small covers and coloring simple polytopes Nishimura, Yasuzo; Nakayama, Hisashi Citation Osaka Journal of Mathematics. 42(1) P.243-P.256 Issue Date 2005-03 Text Version
More informationREPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS. M. Meulpolder, D.H.J. Epema, H.J. Sips
REPLICATION IN BANDWIDTH-SYMMETRIC BITTORRENT NETWORKS M. Melpolder, D.H.J. Epema, H.J. Sips Parallel and Distribted Systems Grop Department of Compter Science, Delft University of Technology, the Netherlands
More informationSummer 2017 MATH Suggested Solution to Exercise Find the tangent hyperplane passing the given point P on each of the graphs: (a)
Smmer 2017 MATH2010 1 Sggested Soltion to Exercise 6 1 Find the tangent hyperplane passing the given point P on each of the graphs: (a) z = x 2 y 2 ; y = z log x z P (2, 3, 5), P (1, 1, 1), (c) w = sin(x
More informationAnalysis of high dimensional data via Topology. Louis Xiang. Oak Ridge National Laboratory. Oak Ridge, Tennessee
Analysis of high dimensional data via Topology Louis Xiang Oak Ridge National Laboratory Oak Ridge, Tennessee Contents Abstract iii 1 Overview 1 2 Data Set 1 3 Simplicial Complex 5 4 Computation of homology
More informationarxiv: v1 [math.co] 3 Nov 2017
DEGREE-REGULAR TRIANGULATIONS OF SURFACES BASUDEB DATTA AND SUBHOJOY GUPTA arxiv:1711.01247v1 [math.co] 3 Nov 2017 Abstract. A degree-regular triangulation is one in which each vertex has identical degree.
More informationGeometric structures on manifolds
CHAPTER 3 Geometric structures on manifolds In this chapter, we give our first examples of hyperbolic manifolds, combining ideas from the previous two chapters. 3.1. Geometric structures 3.1.1. Introductory
More information9 About Intersection Graphs
9 About Intersection Graphs Since this lecture we focus on selected detailed topics in Graph theory that are close to your teacher s heart... The first selected topic is that of intersection graphs, i.e.
More informationConvex body semigroups and their applications
Alberto Vigneron-Tenorio Dpto. Matemáticas Universidad de Cádiz INdAM meeting: International meeting on numerical semigroups 2014 Cortona, 8-12/9/2014 some joint works with J.I. García-García, A. Sánchez-R.-Navarro
More informationMATH 890 HOMEWORK 2 DAVID MEREDITH
MATH 890 HOMEWORK 2 DAVID MEREDITH (1) Suppose P and Q are polyhedra. Then P Q is a polyhedron. Moreover if P and Q are polytopes then P Q is a polytope. The facets of P Q are either F Q where F is a facet
More informationFinite Domain Cuts for Minimum Bandwidth
Finite Domain Cts for Minimm Bandwidth J. N. Hooker Carnegie Mellon University, USA Joint work with Alexandre Friere, Cid de Soza State University of Campinas, Brazil INFORMS 2013 Two Related Problems
More informationThe Domination and Competition Graphs of a Tournament. University of Colorado at Denver, Denver, CO K. Brooks Reid 3
The omination and Competition Graphs of a Tornament avid C. Fisher, J. Richard Lndgren 1, Sarah K. Merz University of Colorado at enver, enver, CO 817 K. rooks Reid California State University, San Marcos,
More informationTechnische Universität München Zentrum Mathematik
Technische Universität München Zentrum Mathematik Prof. Dr. Dr. Jürgen Richter-Gebert, Bernhard Werner Projective Geometry SS 208 https://www-m0.ma.tum.de/bin/view/lehre/ss8/pgss8/webhome Solutions for
More informationEUCLIDEAN SKELETONS USING CLOSEST POINTS. Songting Luo. Leonidas J. Guibas. Hong-Kai Zhao. (Communicated by the associate editor name)
Volme X, No. 0X, 200X, X XX Web site: http://www.aimsciences.org EUCLIDEAN SKELETONS USING CLOSEST POINTS Songting Lo Department of Mathematics, University of California, Irvine Irvine, CA 92697-3875,
More informationLecture 18: Groupoids and spaces
Lecture 18: Groupoids and spaces The simplest algebraic invariant of a topological space T is the set π 0 T of path components. The next simplest invariant, which encodes more of the topology, is the fundamental
More informationRectangle-of-influence triangulations
CCCG 2016, Vancoer, British Colmbia, Ag 3 5, 2016 Rectangle-of-inflence trianglations Therese Biedl Anna Lbi Saeed Mehrabi Sander Verdonschot 1 Backgrond The concept of rectangle-of-inflence (RI) draings
More informationCLASSIFICATION OF ORDERABLE AND DEFORMABLE COMPACT COXETER POLYHEDRA IN HYPERBOLIC SPACE
CLASSIFICATION OF ORDERABLE AND DEFORMABLE COMPACT COXETER POLYHEDRA IN HYPERBOLIC SPACE DHRUBAJIT CHOUDHURY, SUHYOUNG CHOI, AND GYE-SEON LEE Abstract. The aim of this work is to investigate properties
More informationTopological Decompositions for 3D Non-manifold Simplicial Shapes
Topological Decompositions for 3D Non-manifold Simplicial Shapes Annie Hui a,, Leila De Floriani b a Dept of Computer Science, Univerity of Maryland, College Park, USA b Dept of Computer Science, University
More informationOn total regularity of the join of two interval valued fuzzy graphs
International Jornal of Scientific and Research Pblications, Volme 6, Isse 12, December 2016 45 On total reglarity of the join of two interval valed fzzy graphs Soriar Sebastian 1 and Ann Mary Philip 2
More informationSubgraph Matching with Set Similarity in a Large Graph Database
1 Sbgraph Matching with Set Similarity in a Large Graph Database Liang Hong, Lei Zo, Xiang Lian, Philip S. Y Abstract In real-world graphs sch as social networks, Semantic Web and biological networks,
More informationCOMBINATORIAL METHODS IN ALGEBRAIC TOPOLOGY
COMBINATORIAL METHODS IN ALGEBRAIC TOPOLOGY 1. Geometric and abstract simplicial complexes Let v 0, v 1,..., v k be points in R n. These points determine a hyperplane in R n, consisting of linear combinations
More information751 Problem Set I JWR. Due Sep 28, 2004
751 Problem Set I JWR Due Sep 28, 2004 Exercise 1. For any space X define an equivalence relation by x y iff here is a path γ : I X with γ(0) = x and γ(1) = y. The equivalence classes are called the path
More informationTutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass
Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass University of California, Davis, USA http://www.cs.ucdavis.edu/~koehl/ims2017/ What is a shape? A shape is a 2-manifold with a Riemannian
More informationOptimal Sampling in Compressed Sensing
Optimal Sampling in Compressed Sensing Joyita Dtta Introdction Compressed sensing allows s to recover objects reasonably well from highly ndersampled data, in spite of violating the Nyqist criterion. In
More informationTopological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College
Topological Data Analysis - I Afra Zomorodian Department of Computer Science Dartmouth College September 3, 2007 1 Acquisition Vision: Images (2D) GIS: Terrains (3D) Graphics: Surfaces (3D) Medicine: MRI
More informationRay shooting from convex ranges
Discrete Applied Mathematics 108 (2001) 259 267 Ray shooting from convex ranges Evangelos Kranakis a, Danny Krizanc b, Anil Maheshwari a;, Jorg-Rudiger Sack a, Jorge Urrutia c a School of Computer Science,
More informationINTRODUCTION TO FINITE ELEMENT METHODS
INTRODUCTION TO FINITE ELEMENT METHODS LONG CHEN Finite element methods are based on the variational formulation of partial differential equations which only need to compute the gradient of a function.
More information