Dimension-Independent Data Structures for Arbitrary Simplicial Complexes

Size: px
Start display at page:

Download "Dimension-Independent Data Structures for Arbitrary Simplicial Complexes"

Transcription

1 Dimension-Independent Data Structures for Arbitrary Simplicial Complexes David Canino The Incidence Simplicial (IS) data structure The Generalized Indexed data structure with Adjacencies (IA*)

2 Directed Graph Representation for a Topological Data Structure A topological data structure can be described in terms of what simplices and what topological relations ~ k,m are directly encoded. A topological data structure, describing a simplicial complex Σ, can be represented as a directed graph G Σ =(N Σ,A Σ ), where: each node n σ in N Σ corresponds to a simplex σ each arc (n σ,n σ ) in A Σ corresponds to a topological relation ~ k,m between simplices σ and σ Any arc can be classified with respect to the topological relation ~ k,m it represents: boundary arc, if it corresponds to a boundary relation ~ k,m (with k>m) co-boundary arc, if it corresponds to a co-boundary relation ~ k,m (with k<m) adjacency arc, if it corresponds to an adjacency relation ~ k,k (with m=k) We define three spanning subgraphs of graph G Σ =(N Σ,A Σ ), namely: the boundary graph, formed by all nodes and boundary arcs the co-boundary graph, formed by all nodes and co-boundary arcs the adjacency graph, formed by all nodes and adjacency arcs

3 The Incidence Simplicial (IS) data structure The Incidence Simplicial (IS) data structure is a dimension-independent variant, restricted to simplicial complexes, of the Incidence Graph (IG), defined in Edelsbrunner, The IS data structure has been introduced recently in: L. De Floriani, A. Hui, D. Panozzo, D. Canino, A Dimension-Independent Data Structure for Simplicial Complexes, In Proceedings of the 19th International Meshing Roundtable (IMR 2010), pages , Springer, 2010 The IS data structure encodes abstract simplicial complexes of any dimension d, which are not necessarily embedded in any Euclidean space. It is an incidence-based data structure, and encodes all the simplices, plus a set of incidence relations for each simplex. Specifically, it encodes: boundary relation R p,p+1 (σ) for any p-simplex σ, with 0<p d (as in the incidence graph); partial co-boundary relation R* p,p+1 (σ) for any p-simplex σ, with 0 p<d, which consists of one arbitrary (p+1)-simplex incident at σ for each component in the star of σ, corresponding to one component in the link of σ.

4 The IS data structure (cont d) For instance, link of vertex v (in bold) is formed by two connected components, namely: vertex v, corresponding to top edge w in the star of v; triangle f t and edge e f, corresponding to tetrahedron t and to top triangle f, respectively. As a consequence, partial co-boundary relation R* 0,1 (v)=(w,e). Note that, for any maximal d-simplex, partial co-boundary relation R* d-1,d coincides with co-boundary relation R d-1,d, encoded in the IG data structure. The IS data structure is more compact than the incidence graph, since it encodes, for all simplices: the same immediate boundary relations as in the incidence graph a partial version of immediate co-boundary relations (as defined above) More mathematical details about the storage cost of the IS data structure can be found in our article.

5 Manifolds and the IS data structure The incidence graph may result in a verbose representation, which does not scale well to manifolds. On the contrary, when representing a manifold simplicial d-complex Σ through the IS data structure: immediate boundary relations R p,p-1 remain unchanged (wrt the incidence graph) immediate co-boundary relations R* p,p+1 are encoded as follows: only one (p+1)-simplex is encoded, for 0 p<d; one or two d-simplices are encoded in R d-1,d (like in the incidence graph). Recall that, in the incidence graph, all (p+1)-simplices in co-boundary relation R p,p+1 are encoded. Thus the IS data structure results in a more compact representation, which scales well to manifolds. In the incidence graph, co-boundary relation R 0,1 (v) encodes all edges incident at v (in bold lines). In the IS data structure, partial co-boundary relation R* 0,1 (v) encodes only one edge incident at v (in bold line).

6 The IS-Graph The IS-Graph is the graph-based representation of the IS data structure as directed graph: each node corresponds to a simplex, encoded in the IS data structure; each arc corresponds either to any immediate boundary relation R p,p-1 (IS Boundary arc), or to any partial co-boundary relation R* p,p+1 (IS Co-boundary arc). It is possible to define two spanning subgraphs of the IS-Graph, which we call: the IS Boundary Graph, which consists of all nodes and IS Boundary arcs; the IS Co-boundary Graph, which consists of all nodes and IS Co-boundary arcs. The IS-Graph is a spanning subgraph of the incidence graph, defined as follows: each node corresponds to a simplex, encoded in the IG data structure; each arc corresponds either to any immediate boundary relation R p,p-1 (IG Boundary arc), or to any co-boundary relation R p,p+1 (IG Co-boundary arc) Also in this case, it is possible to define two spanning subgraphs of the incidence graph, which we call: the IG Boundary Graph, which consists of all nodes and IG Boundary arcs (like in the IS-Graph); the IG Co-boundary Graph, which consists of all nodes and IG Co-boundary arcs.

7 The IS-Graph (An Example) IS Boundary Graph (but also IG Boundary Graph) IS Co-boundary Graph IG Co-boundary Graph

8 Boundary Relations in the IS data structure Let σ be a p-simplex and 0 q<p, then boundary relation R p,q (σ) can be retrieved by combining together boundary relations R k,k-1 (directly encoded) for k-faces of σ, with q<k p (like in the incidence graph). In the IS Boundary Graph, this operation is equivalent to visit nodes, describing simplices of dimension k (with q k<p), which are reachable from the node representing σ. In this traversal, all C p,q faces bounding σ are visited, where: Note that C p,q is a constant value, which depends only on p and q. Example: retrieving vertices in R 3,0 (t) We must traverse the IS Boundary Graph: first, we visit R 3,2 (t) (in red) then, we visit R 2,1 (in green) finally, we visit R 1,0 (in blue)

9 Co-boundary Relations in the IS data structure Let σ be a p-simplex and 0 p<q, then co-boundary relation R p,q (σ) is formed either by top q-simplices in the star of σ; or q-faces of top h-simplices (with h>q) incident at σ. Thus, the key operation consists of retrieving all top simplices, which are incident at σ, and select their faces in the star of σ. The starting point of this operation is given by partial co-boundary relations R* k,k+1, for p k<q (directly encoded). In order to solve this operation, we introduce the IS star-graph G σ of a p-simplex σ, which is a spanning subgraph of the IS-Graph, defined as follows: its nodes correspond to simplices in the star of σ; its arcs are either IS Boundary and IS Co-boundary arcs, which connect nodes, corresponding to simplices in the star of σ. Any co-boundary relation R p,q (σ) can be retrieved as the breadth-first traversal of graph G σ by visiting all arcs and nodes, recheable from node corresponding to σ, and by selecting nodes of G σ, describing q- simplices in the star of σ: Start from R* p,p+1 (σ) For any k-simplex, visit R* k,k+1 (σ) and R* k,k-1 (σ), restricted to the star of σ. At the end of this traversal, all nodes of G σ are visited, thus we visit all simplices in the star of σ. This operation is not optimal, unless for simplicial 2- and 3-complexes, embedded in the 3D space.

10 Co-boundary Relations in the IS data structure (Example) IS Boundary Graph IS Co-boundary Graph We consider the IS star graph G v, for vertex v=0, defined as the restriction of the IS Boundary and the Co-boundary Graphs to nodes corresponding to simplices in the star of v. IS Boundary Graph restricted to the star of v IS Co-boundary Graph restricted to the star of v

11 Co-boundary Relations in the IS data structure (Running Example) Suppose to retrieve all edges incident at vertex v=0, namely co-boundary relation R 0,1 (v). As mentioned above, it is necessary to perform a breadth-first traversal of the IS star-graph G v. Step 1: start from partial co-boundary relation R* 0,1 (0) visit partial co-boundary relation R* 1,2 (0,3) visit boundary relation R 2,1 (0,3,4). Step 2: visit partial co-boundary relation R* 1,2 (0,3) visit co-boundary relation R 2,3 (0,2,3) visit boundary relation R 2,1 (0,2,3).

12 Co-boundary Relations in the IS data structure (Running Example con td) Step 3: Step 4: visit boundary relation R 3,2 (0,1,23) visit boundary relation R 2,1 (0,1,2) visit boundary relation R 2,1 (0,1,3) At the end of this traversal, we retrieve edges in R 0,1 (0) = { (0,1), (0,2), (0,3), (0,4), (0,5) } (in red) In any case, it is necessary to visit all the top h-simplices (with h q) in the star of any p-simplex σ in order to retrieve all the q-simplices incident at σ.

13 The Generalized Indexed data structure with Adjacencies (IA*) The Generalized Indexed data structure with Adjacencies (IA*) is a dimension-independent variant, specific for representing non-manifold shapes discretized by simplicial complexes, of the Extended Indexed data structure with Adjacencies (EIA), defined in De Floriani, The IA* data structure has been introduced recently in: D. Canino, L. De Floriani, K. Weiss, IA*: an Adjacency-based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions, Computer & Graphics, 35(3): , Elsevier Press, Shape Modeling International 2011 (SMI 2011), Poster The IA* data structure encodes abstract simplicial complexes of any dimension d, which are not necessarily embedded in any Euclidean space. It is an adjacency-based data structure, and encodes only vertices and top simplices, plus a subset of incidence relations for each vertex and a subset of adjacency relations, restricted to top simplices. The IA* data structure does not exploit any property, specific of the embedding space, like the radial ordering of triangles around an edge.

14 Definition of the IA* data structure Let Σ be a simplicial d-complex, then any p-cluster is a maximal (p-1)- connected subcomplex of Σ, such that two consecutive p-simplices share a (p-1)-face. For instance, triangles {f 1,f 2,f 3,f 4 } form a 2-cluster. The IA* data structure encodes all vertices and top simplices in Σ, plus the following relations: for every top p-simplex σ, boundary relation R p,0 (σ), such that 1 p d, which consists of vertices of σ. For instance, R 1,0 (w)={1,2} and R 2,0 (f 1 )={1,3,4}. For each vertex v: partial co-boundary relation R* 0,1 (v), which consists of all top edges incident at v. For instance, R*0,1(v)={w}. partial co-boundary relation R* 0,p (v), such that 1<p d, which consists of one arbitrary top p-simplex for each cluster of top p- simplices in the star of v. For instance, R 0,2 (v)={f 1,f 5 } and R 0,3 ={t 1 }.

15 Definition of the IA* data structure (cont d) For any top p-simplex σ, such that 2 p d, the IA* data structure also encodes partial adjacency relation R* p,p (σ), which consists of all top p- simplices in Σ, adjacent to σ through one of its (p-1)-faces. For instance, R* 2,2 (f 1 )={f 2,f 3,f 4 }, R* 2,2 (f 5 )={f 6 }, and R* 3,3 (t 1 )={t 2 }. Note that adjacency relation R* p,p (σ) may consist of more than one top p-simplex, e.g., R* 2,2 (f 1 ), thus it results in a verbose representation. In order to provide a compact representation of R* p,p (σ), the IA* data structure encodes, for any (p-1)-face τ of σ such that its star contains more than two top p-simplices (non-manifold adjacency), partial co-boundary relation R* p-1,p (τ), which consists of all top p-simplices in the star of τ. For instance, R* 1,2 (e)={f 1,f 2,f 3,f 4 }. In case of a non-manifold adjacency along a (p-1)-face τ of a top p- simplex σ, then R* p-1,p (τ) is encoded only once, and R* p,p (σ) along τ is encoded as a reference to R* p-1,p (τ)/σ. For instance, R 2,2 (f 1 )=R 1,2 (e)/f 1. Otherwise, adjacency relation R* p,p (σ) along one of its (p-1)-faces τ contains at most one reference to another top p-simplex adjacent to σ along τ (manifold adjacency). For instance, R* 2,2 (f 5 )={f 6 } and R* 3,3 (t 1 )={t 2 }.

16 Manifolds and the IA* data structure To the best of our experience, the IA* data structure is one of the most compact representations for non-manifold shapes, discretized by simplicial complexes (wrt the state of the art in 2011), as shown in our article, including an some mathematical details regarding its storage cost. When representing a simplicial d-complex Σ through the IA* data structure: there are only maximal d-simplices, and only boundary relations R d,0 are not empty; there is only one d-cluster in the star of each vertex v, namely in R* 0,d (v); partial co-boundary relation R* d-1,d (τ) is empty, for each (d-1)-face τ of any top d-simplex σ; there is at most one top d-simplex in adjacency relation R* d,d (σ) for each top d-simplex σ. As a consequence, when representing manifolds, the IA* data structure reduces to the EIA data structure, which scales well to manifolds.

17 The IA* Graph The IA*-Graph is the graph-based representation of the IA* data structure as directed graph: each node corresponds to one simplex, encoded in the IA* data structure, namely: vertices and top simplices; immediate faces τ of any top simplex σ such that R* p-1,p is not empty; each arc corresponds to one topological relation, encoded in the IA* data structure, namely: boundary relation R p,0 (IA* Boundary arc) for top simplices and vertices; co-boundary relations R* 0,p (IA* Co-boundary arc) for top simplices and vertices; adjacency relation R* p,p for top simplices, and partial co-boundary relation R* p-1,p for immediate (p-1)-faces of top p-simplices (IA* Adjacency arc). It is possible to define three spanning subgraphs of the IA*-Graph, which we call: the IA* Boundary Graph, which consists of all nodes corresponding to vertices and top simplices, plus IA* Boundary arcs; the IA* Co-boundary Graph, which consists of all nodes corresponding to vertices and top simplices, plus IA* Co-boundary arcs; the IA* Adjacency Graph, which consists of top simplices and their immediate faces, plus IA* Adjacency arcs.

18 The IA*-Graph (An Example) IA* Boundary Graph IA* Adjacency Graph IA* Co-boundary Graph

19 Boundary Relations in the IA* data structure Let σ be a top p-simplex, then boundary relation R p,0 (σ) is already encoded in the IA* data structure. On the contrary, a non top p-simplex σ is not directly encoded, and it must be represented implicitly. One of the most common representation consists of describing σ in terms of its vertices [v 0,,v p ]. In this context, it is necessary to exploit a rule for enumerating faces of a p-simplex σ in terms of its vertices. Usually, the i-th face of dimension (p-1) can be obtained by discarding vertex v i. Thus, boundary relation R p,q (σ) can be retrieved by generating all C p,q faces bounding σ in terms of its vertices where: Note that C p,q is a constant value, which depends only on p and q. IMPORTANT: we do not perform any explicit visit of the IA* Boundary Graph.

20 Retrieving Co-boundary Relations in the IA* data structure Let σ be a p-simplex and 0 p<q, then co-boundary relation R p,q (σ) is formed either by top q-simplices in the star of σ; or q-faces of top h-simplices (with h>q) incident at σ (as in the IS and EIA data structures). The key operation consists of retrieving top simplices, which are incident at any vertex v. The starting point of this operation is given by partial co-boundary relations R* 0,k, for p k d (directly encoded). In order to solve this operation, we introduce the IA* star-graph G v of any vertex v, which is a spanning subgraph of the IA*-Graph, defined as follows: its nodes correspond to top simplices in the star of v; its arcs are either IA* Co-boundary and IA* Adjacency arcs, which connect those nodes, corresponding to top simplices in the star of v. All top simplices in the star of v can be retrieved as the breadth-first traversal of graph G v by visiting all arcs and nodes, recheable from node corresponding to v, and by selecting nodes of G v, describing q- simplices in the star of v. For all 0<k d: start from each top k-simplex in R* 0,k (v), which represents one k-cluster in the star of v; exploit adjacency relation R* k,k in order to expand each k-cluster and retrieve its top k-simplices.

21 Co-boundary Relations in the IA* data structure (Example) IA* Co-boundary Graph IA* Adjacency Graph We consider the IA* star graph Gv, for vertex v=1, defined as the restriction of the IA* Co-boundary and the Adjacency Graphs to nodes corresponding to top simplices in the star of v. IA* Co-boundary Graph restricted to the star of v IA* Adjacency Graph restricted to the star of v

22 Co-boundary Relations in the IA* data structure (Running Example) Suppose to retrieve all top simplices incident at vertex v=1. As mentioned above, it is necessary to perform a breadth-first traversal of the IA* star-graph Gv. Step 2: expand 2-cluster, represented by top triangle (1,3,4) in partial co-boundary relation R*0,2(v), (in red) by exploiting partial co-boundary relation R*1,2 for non-manifold adjacency along edge (1,3) Step 1: start from top edge (1,2), encoded in partial co-boundary relation R*0,1(v)

23 Co-boundary Relations in the IA* data structure (Running Example cont d) Step 2: expand 2-cluster, represented by top triangle (1,8,9) in partial co-boundary relation R* 0,2 (v), by navigating on manifold adjacency along edge (1,9), namely adjacency relation R 2,2 (in blue) Step 3: expand 3-cluster, represented by tetrahedron (1,11,12,14) in partial co-boundary relation R* 0,3 (v), by navigating on manifold adjacency along triangle (1,12,14), namely adjacency relation R 3,3 (in green) At the end of this traversal, all nodes of graph G v, i.e., all top simplices incident at v, are visited, thus this operation is optimal in the IA* data structure. This operation is the basis for retrieving any co-boundary relation in the IA* data structure.

24 Other Co-boundary Relations in the IA* data structure Let v be a vertex, then co-boundary relation R 0.p (v), with 0<p d, can be retrieved in two steps: retrieve all top h-simplices (with h p) incident at v select their p-faces, which are also in the star of v. The time complexity of this operation is dominated by retrieving top simplices in the star of v (optimal only for simplicial 2- and 3-complexes embedded in the Euclidean 3D space) Let σ a p-simplex, then co-boundary relation R p,q (σ), with 0<p<q d, can be retrieved in two steps: retrieve all q-simplices in the star of one vertex v (arbitrary) on the boundary of σ, i.e., R 0,q (v) select q-simplices from R 0,q (v), which are also incident in the remaining vertices of σ The time complexity of this operation is dominated by retrieving top simplices in the star of any vertex v, thus it is not optimal in the IA* data structure.. The number of simplices incident at v is surely larger than the number of simplices incident at all vertices of σ. For instance, co-boundary relation R 1,2 (3,7)={f 4 }, but R 0,2 (3)={f 1,f 2,f 3,f 4 }.

25 Comparisons among the IG, the IS, and the IA* data structures It is interesting to compare the storage costs of the incidence graph, the IS and the IA* data structures, when representing non-manifold shapes, discretized by simplicial 2- and 3-complexes, not necessarily embedded in any Euclidean space. Experimental results show that the incidence graph is the most expensive and verbose representation among these. On the contrary, the IA* data structure is the most compact representation. For simplicial 2-complexes The incidence graph is about: 1.26 times more expensive than the IS data structure; 1.8 times more expensive than the IA* data structure. The IS data structure is about 1.4 times more expensive than the IA* data structure

26 Comparisons among the IG, the IS, and the IA* data structures (cont d) For simplicial 3-complexes For complexes in high dimensions The incidence graph is about: 1.39 times more expensive than the IS data structure; 3.2 times more expensive than the IA* data structure. The IS data structure is about 2.2 times more expensive than the IA* data structure The incidence graph tends to be almost the same as the IS data structure for high dimensions. The IG and the IS data structures tend to be extremely more expensive than the IA* data structure for high dimensions (for instance, up to, respectively, 160 and 100 times for 8D shapes).

27 The Mangrove Topological Data Structure (Mangrove TDS) Framework Fast prototyping of topological data structures with any property and representing simplicial complexes with any domain (including non-manifolds). Common graph-based representation (mangrove) of topological data structure, which can be dynamically customized at run-time (plugin-oriented architecture). Implicit representations of all simplices, not directly encoded in any adjacency-based data structure, which we call ghost simplices. The Mangrove TDS Library contains the complete implementation of this framework and of six topological data structures (also the IS and the IA* data structure). It is a GPL software:

28 Interesting Papers and References D. Canino, L. De Floriani, K. Weiss, IA*: an Adjacency-based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions, Computer & Graphics, 35(3): , Elsevier Press, Shape Modeling International 2011 (SMI 2011), Poster L. De Floriani, D. Greenfieldboyce, and A. Hui, A Data Structure for Non-Manifold Simplicial d- complexes, In Proceedings of the 2nd Eurographics Symposium on Geometry Processing (SGP 04), pages 83-92, ACM Press, 2004 L. De Floriani and A. Hui, A Scalable Data Structure for Three-dimensional Non-manifold Objects, In Proceedings of the 1st Eurographics Symposium on Geometry Processing (SGP 03), pages 72-82, ACM Press, 2003 L. De Floriani and A. Hui, Data Structures for Simplicial Complexes: an Analysis and a Comparison, In Proceedings of the 3rd Eurographics Symposium on Geometry Processing (SGP 05), pages , ACM Press, 2005 L. De Floriani, A. Hui, D. Panozzo, D. Canino, A Dimension-Independent Data Structure for Simplicial Complexes, In Proceedings of the 19th International Meshing Roundtable, pages , Springer, 2010 L. De Floriani, P. Magillo, E. Puppo, and D. Sobrero, A Multi-resolution Topological Representation for Non-Manifold Meshes, CAD Journal, 36(2): , 2003

29 Interesting Papers and References (cont d) H. Edelsbrunner, Algorithms in Combinatorial Geometry, Springer, 1987 A. Nabutovsky, Geometry of the Space of Triangulations of a Compact Manifold, Communications in Mathematical Physics, 18(1): , 1996 A. Paoluzzi, F. Bernardini, C. Cattani, and V. Ferrucci, Dimension-independent Modeling with Simplicial Complexes, ACM Transactions on Graphics, 12(1):56-102, 1993 D. Sieger and M. Botsch, Design, Implementation, and Evaluation of the Surface_Mesh Data Structure, In Proceedings of the 20th International Meshing Roundtable, pages , Springer, 2011

IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions

IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions IA : An Adjacency-Based Representation for Non-Manifold Simplicial Shapes in Arbitrary Dimensions David Canino a, Leila De Floriani a, Kenneth Weiss b a Department of Computer Science, University of Genova,

More information

A Dimension-Independent Data Structure for Simplicial Complexes

A Dimension-Independent Data Structure for Simplicial Complexes A Dimension-Independent Data Structure for Simplicial Complexes Leila De Floriani 1, Annie Hui 2, Daniele Panozzo 1, and Daid Canino 1 1 Department of Computer Science, Uniersity of Genoa, Italy deflo@disi.unige.it,

More information

Dipartimento di Informatica e Scienze dell Informazione

Dipartimento di Informatica e Scienze dell Informazione Dipartimento di Informatica e Scienze dell Informazione Tools for Modeling and Analysis of Non-manifold Shapes by David CANINO Theses Series DISI-TH-2012-01 DISI, Università di Genova v. Dodecaneso 35,

More information

Lecture 5: Simplicial Complex

Lecture 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 information

Topological Decompositions for 3D Non-manifold Simplicial Shapes

Topological 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 information

A dimension-independent simplicial data structure for non-manifold shapes

A dimension-independent simplicial data structure for non-manifold shapes A dimension-independent simplicial data structure for non-manifold shapes Annie Hui Dept of Computer Science, Unierity of Maryland, College Park, USA e-mail:huiannie@cs.umd.edu Leila De Floriani Dept of

More information

Tutorial 3 Comparing Biological Shapes Patrice Koehl and Joel Hass

Tutorial 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 information

A Compact Cell Structure for Scientific Visualization

A Compact Cell Structure for Scientific Visualization A Compact Cell Structure for Scientific Visualization W.J. Schroeder Boris Yamrom GE Corporate Research & Development Schenectady, NY 12301 Abstract Well designed data structures and access methods are

More information

Lecture notes for Topology MMA100

Lecture 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 information

Simplicial Complexes: Second Lecture

Simplicial 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 information

Surfaces: notes on Geometry & Topology

Surfaces: notes on Geometry & Topology Surfaces: notes on Geometry & Topology 1 Surfaces A 2-dimensional region of 3D space A portion of space having length and breadth but no thickness 2 Defining Surfaces Analytically... Parametric surfaces

More information

Computing Reeb Graphs as a Union of Contour Trees

Computing Reeb Graphs as a Union of Contour Trees APPEARED IN IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 19(2), 2013, 249 262 1 Computing Reeb Graphs as a Union of Contour Trees Harish Doraiswamy and Vijay Natarajan Abstract The Reeb graph

More information

66 III Complexes. R p (r) }.

66 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 information

A primal/dual representation for discrete Morse complexes on tetrahedral meshes

A primal/dual representation for discrete Morse complexes on tetrahedral meshes Eurographics Conference on Visualization (EuroVis) 2013 B. Preim, P. Rheingans, and H. Theisel (Guest Editors) Volume 32 (2013), Number 3 A primal/dual representation for discrete Morse complexes on tetrahedral

More information

Basics of Combinatorial Topology

Basics 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 information

Mesh Repairing and Simplification. Gianpaolo Palma

Mesh Repairing and Simplification. Gianpaolo Palma Mesh Repairing and Simplification Gianpaolo Palma Mesh Repairing Removal of artifacts from geometric model such that it becomes suitable for further processing Input: a generic 3D model Output: (hopefully)a

More information

Brian Hamrick. October 26, 2009

Brian Hamrick. October 26, 2009 Efficient Computation of Homology Groups of Simplicial Complexes Embedded in Euclidean Space TJHSST Senior Research Project Computer Systems Lab 2009-2010 Brian Hamrick October 26, 2009 1 Abstract Homology

More information

Surface Reconstruction. Gianpaolo Palma

Surface Reconstruction. Gianpaolo Palma Surface Reconstruction Gianpaolo Palma Surface reconstruction Input Point cloud With or without normals Examples: multi-view stereo, union of range scan vertices Range scans Each scan is a triangular mesh

More information

Monotone Paths in Geometric Triangulations

Monotone Paths in Geometric Triangulations Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation

More information

6.2 Classification of Closed Surfaces

6.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 information

Three-Dimensional α Shapes

Three-Dimensional α Shapes Herbert Edelsbrunner and Ernst P. Mücke ACM Tran. Graph. 13(1), 1994 20 September 2005 1 2 α-complexes Edelsbrunner s Algorithm 3 Properties Surface Reconstruction Shape Question Given a set of points,

More information

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud

A Constrained Delaunay Triangle Mesh Method for Three-Dimensional Unstructured Boundary Point Cloud International Journal of Computer Systems (ISSN: 2394-1065), Volume 03 Issue 02, February, 2016 Available at http://www.ijcsonline.com/ A Constrained Delaunay Triangle Mesh Method for Three-Dimensional

More information

Euler s Theorem. Brett Chenoweth. February 26, 2013

Euler s Theorem. Brett Chenoweth. February 26, 2013 Euler s Theorem Brett Chenoweth February 26, 2013 1 Introduction This summer I have spent six weeks of my holidays working on a research project funded by the AMSI. The title of my project was Euler s

More information

DISCRETE DIFFERENTIAL GEOMETRY: AN APPLIED INTRODUCTION Keenan Crane CMU /858B Fall 2017

DISCRETE 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 information

Homology cycle bases from acyclic matchings

Homology cycle bases from acyclic matchings Homology cycle bases from acyclic matchings Dmitry Feichtner-Kozlov University of Bremen Kyoto Workshop, January 019 What is... Applied Topology? studying global features of shapes applications in other

More information

Interactive Deformation with Triangles

Interactive Deformation with Triangles Interactive Deformation with Triangles James Dean Palmer and Ergun Akleman Visualization Sciences Program Texas A&M University Jianer Chen Department of Computer Science Texas A&M University Abstract In

More information

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994)

G 6i try. On the Number of Minimal 1-Steiner Trees* Discrete Comput Geom 12:29-34 (1994) Discrete Comput Geom 12:29-34 (1994) G 6i try 9 1994 Springer-Verlag New York Inc. On the Number of Minimal 1-Steiner Trees* B. Aronov, 1 M. Bern, 2 and D. Eppstein 3 Computer Science Department, Polytechnic

More information

3D Mesh Compression in Open3DGC. Khaled MAMMOU

3D Mesh Compression in Open3DGC. Khaled MAMMOU 3D Mesh Compression in Open3DGC Khaled MAMMOU OPPORTUNITIES FOR COMPRESSION Indexed Face Set Geometry: positions Connectivity: of triangles Requires 192 bits per vertex! Redundancy Indexes repeated multiple

More information

Surface Topology ReebGraph

Surface Topology ReebGraph Sub-Topics Compute bounding box Compute Euler Characteristic Estimate surface curvature Line description for conveying surface shape Extract skeletal representation of shapes Morse function and surface

More information

On converting sets of tetrahedra to combinatorial and PL manifolds

On converting sets of tetrahedra to combinatorial and PL manifolds On converting sets of tetrahedra to combinatorial and PL manifolds Marco Attene a,, Daniela Giorgi a, Massimo Ferri b, Bianca Falcidieno a a Institute of Applied Mathematics and Information Technology

More information

Handles. The justification: For a 0 genus triangle mesh we can write the formula as follows:

Handles. 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 information

Pacific Journal of Mathematics

Pacific 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 information

Diamond Hierarchies of Arbitrary Dimension

Diamond Hierarchies of Arbitrary Dimension Eurographics Symposium on Geometry Processing 2009 Marc Alexa and Michael Kazhdan (Guest Editors) Volume 28 (2009), Number 5 Diamond Hierarchies of Arbitrary Dimension Kenneth Weiss 1 and Leila De Floriani

More information

Combinatorial models for topology-based geometric modeling

Combinatorial models for topology-based geometric modeling Combinatorial models for topology-based geometric modeling Pascal Lienhardt, Laurent Fuchs, Yves Bertrand To cite this version: Pascal Lienhardt, Laurent Fuchs, Yves Bertrand. Combinatorial models for

More information

Surfaces, meshes, and topology

Surfaces, meshes, and topology Surfaces from Point Samples Surfaces, meshes, and topology A surface is a 2-manifold embedded in 3- dimensional Euclidean space Such surfaces are often approximated by triangle meshes 2 1 Triangle mesh

More information

Topological Data Analysis - I. Afra Zomorodian Department of Computer Science Dartmouth College

Topological 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 information

Animating cuts with on-the-fly re-meshing

Animating cuts with on-the-fly re-meshing EUROGRAPHICS 2001 / Jonathan C. Roberts Short Presentations Animating cuts with on-the-fly re-meshing F. Ganovelli and C. O Sullivan Image Synthesis Group, Computer Science Department, Trinity College

More information

Planar Graphs with Many Perfect Matchings and Forests

Planar Graphs with Many Perfect Matchings and Forests Planar Graphs with Many Perfect Matchings and Forests Michael Biro Abstract We determine the number of perfect matchings and forests in a family T r,3 of triangulated prism graphs. These results show that

More information

Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees

Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees Contracting Chordal Graphs and Bipartite Graphs to Paths and Trees Pinar Heggernes Pim van t Hof Benjamin Léveque Christophe Paul Abstract We study the following two graph modification problems: given

More information

Computing the Betti Numbers of Arrangements. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology.

Computing the Betti Numbers of Arrangements. Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology. 1 Computing the Betti Numbers of Arrangements Saugata Basu School of Mathematics & College of Computing Georgia Institute of Technology. 2 Arrangements in Computational Geometry An arrangement in R k is

More information

Simplicial Objects and Homotopy Groups. J. Wu

Simplicial 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 information

The orientability of small covers and coloring simple polytopes. Nishimura, Yasuzo; Nakayama, Hisashi. Osaka Journal of Mathematics. 42(1) P.243-P.

The 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 information

Computational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry

Computational Geometry. Algorithm Design (10) Computational Geometry. Convex Hull. Areas in Computational Geometry Computational Geometry Algorithm Design (10) Computational Geometry Graduate School of Engineering Takashi Chikayama Algorithms formulated as geometry problems Broad application areas Computer Graphics,

More information

The Borsuk-Ulam theorem- A Combinatorial Proof

The Borsuk-Ulam theorem- A Combinatorial Proof The Borsuk-Ulam theorem- A Combinatorial Proof Shreejit Bandyopadhyay April 14, 2015 1 Introduction The Borsuk-Ulam theorem is perhaps among the results in algebraic topology having the greatest number

More information

Topology Preserving Tetrahedral Decomposition of Trilinear Cell

Topology Preserving Tetrahedral Decomposition of Trilinear Cell Topology Preserving Tetrahedral Decomposition of Trilinear Cell Bong-Soo Sohn Department of Computer Engineering, Kyungpook National University Daegu 702-701, South Korea bongbong@knu.ac.kr http://bh.knu.ac.kr/

More information

Lecture 5 CLASSIFICATION OF SURFACES

Lecture 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 information

Optimal Region for Binary Search Tree, Rotation and Polytope

Optimal Region for Binary Search Tree, Rotation and Polytope Optimal Region for Binary Search Tree, Rotation and Polytope Kensuke Onishi Mamoru Hoshi 2 Department of Mathematical Sciences, School of Science Tokai University, 7 Kitakaname, Hiratsuka, Kanagawa, 259-292,

More information

CONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY

CONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY South Bohemia Mathematical Letters Volume 24, (2016), No. 1, 43-48. CONSTRUCTIONS OF QUADRILATERAL MESHES: A COMPARATIVE STUDY PETRA SURYNKOVÁ abstrakt. Polygonal meshes represent important geometric structures

More information

A convenient way to construct large simplicial complexes is through specifying sets and recording their intersection patterns.

A 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 information

Some Open Problems in Graph Theory and Computational Geometry

Some Open Problems in Graph Theory and Computational Geometry Some Open Problems in Graph Theory and Computational Geometry David Eppstein Univ. of California, Irvine Dept. of Information and Computer Science ICS 269, January 25, 2002 Two Models of Algorithms Research

More information

Simplicial Global Optimization

Simplicial Global Optimization Simplicial Global Optimization Julius Žilinskas Vilnius University, Lithuania September, 7 http://web.vu.lt/mii/j.zilinskas Global optimization Find f = min x A f (x) and x A, f (x ) = f, where A R n.

More information

4.2 Simplicial Homology Groups

4.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 information

Complex conforming Delaunay triangulation

Complex conforming Delaunay triangulation . RESEARCH PAPERS. SCIENCE CHINA Information Sciences June 2010 Vol. 53 No. 6: 1130 1140 doi: 10.1007/s11432-010-0097-6 Complex conforming Delaunay triangulation MENG XianHai 1, LI JiGang 1, YANG Qin 1,

More information

Mesh Basics: Definitions, Topology & Data Structures. Standard Graph Definitions

Mesh Basics: Definitions, Topology & Data Structures. Standard Graph Definitions Mesh : Definitions, Topology & Data Structures 1 Standard Graph Definitions G = V = vertices = {A,B,C,D,E,F,G,H,I,J,K,L} E = edges = {(A,B),(B,C),(C,D),(D,E),(E,F),(F,G), (G,H),(H,A),(A,J),(A,G),(B,J),(K,F),

More information

Collars and Intestines: Practical Conforming Delaunay Refinement

Collars and Intestines: Practical Conforming Delaunay Refinement Collars and Intestines: Practical Conforming Delaunay Refinement Alexander Rand and Noel Walkington Carnegie Mellon University Summary. While several existing Delaunay refinement algorithms allow acute

More information

Computational Geometry

Computational Geometry Computational Geometry 600.658 Convexity A set S is convex if for any two points p, q S the line segment pq S. S p S q Not convex Convex? Convexity A set S is convex if it is the intersection of (possibly

More information

Compression of Tetrahedral Meshes

Compression of Tetrahedral Meshes Compression of Tetrahedral Meshes Geometry Processing CS 7960 Louis Bavoil 01/19/2006 Outline Corner Table Edgebreaker Efficiency Edgebreaker with Boundary Corner Table Two arrays of integers: V and O

More information

CURRICULUM VITAE EMPLOYMENT RESEARCH INTERESTS EDUCATION

CURRICULUM VITAE EMPLOYMENT RESEARCH INTERESTS EDUCATION CURRICULUM VITAE EDUCATION B.Sc. (computer science) University of Genova (DISI) Thesis Similarity retrieval of 3D objects Advisor Prof. Enrico Puppo M.Sc. (Computer Science). University of Genova (DIBRIS)

More information

Single Triangle Strip and Loop on Manifolds with Boundaries

Single Triangle Strip and Loop on Manifolds with Boundaries Single Triangle Strip and Loop on Manifolds with Boundaries Pablo Diaz-Gutierrez David Eppstein M. Gopi Department of Computer Science, University of California, Irvine. Abstract The single triangle-strip

More information

13 - Meshes. Acknowledgement: Enrico Puppo. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo

13 - Meshes. Acknowledgement: Enrico Puppo. CSCI-GA Computer Graphics - Fall 16 - Daniele Panozzo 13 - Meshes Acknowledgement: Enrico Puppo What is a mesh? A surface made of polygonal faces glued at common edges Origin of Meshes In nature, meshes arise in a variety of contexts: Cells in organic tissues

More information

Key Graph Theory Theorems

Key Graph Theory Theorems Key Graph Theory Theorems Rajesh Kumar MATH 239 Intro to Combinatorics August 19, 2008 3.3 Binary Trees 3.3.1 Problem (p.82) Determine the number, t n, of binary trees with n edges. The number of binary

More information

Homology of Simplicial Complexes

Homology of Simplicial Complexes Homology of Simplicial Complexes Math, David Perkinson Introduction. This is an introduction to the homology of simplicial complexes suitable for a first course in linear algebra. It uses little more than

More information

Approximating Polygonal Objects by Deformable Smooth Surfaces

Approximating 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

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES

INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES INTRODUCTION TO THE HOMOLOGY GROUPS OF COMPLEXES RACHEL CARANDANG Abstract. This paper provides an overview of the homology groups of a 2- dimensional complex. It then demonstrates a proof of the Invariance

More information

Lecture 1 Discrete Geometric Structures

Lecture 1 Discrete Geometric Structures Lecture 1 Discrete Geometric Structures Jean-Daniel Boissonnat Winter School on Computational Geometry and Topology University of Nice Sophia Antipolis January 23-27, 2017 Computational Geometry and Topology

More information

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles

Applications. Oversampled 3D scan data. ~150k triangles ~80k triangles Mesh Simplification Applications Oversampled 3D scan data ~150k triangles ~80k triangles 2 Applications Overtessellation: E.g. iso-surface extraction 3 Applications Multi-resolution hierarchies for efficient

More information

SHAPE SEGMENTATION FOR SHAPE DESCRIPTION

SHAPE SEGMENTATION FOR SHAPE DESCRIPTION SHAPE SEGMENTATION FOR SHAPE DESCRIPTION Olga Symonova GraphiTech Salita dei Molini 2, Villazzano (TN), Italy olga.symonova@graphitech.it Raffaele De Amicis GraphiTech Salita dei Molini 2, Villazzano (TN),

More information

The Quality Of 3D Models

The Quality Of 3D Models The Quality Of 3D Models Problems and Solutions for Applications Post-Design Fathi El-Yafi Senior Product Engineer Product Department of EXA Corporation 1 : Overview Status Problems Identified Defect Sources

More information

Outline of the presentation

Outline of the presentation Surface Reconstruction Petra Surynková Charles University in Prague Faculty of Mathematics and Physics petra.surynkova@mff.cuni.cz Outline of the presentation My work up to now Surfaces of Building Practice

More information

Efficient minimum spanning tree construction without Delaunay triangulation

Efficient minimum spanning tree construction without Delaunay triangulation Information Processing Letters 81 (2002) 271 276 Efficient minimum spanning tree construction without Delaunay triangulation Hai Zhou a,, Narendra Shenoy b, William Nicholls b a Electrical and Computer

More information

Finite-Resolution Simplicial Complexes

Finite-Resolution Simplicial Complexes 1 Finite-Resolution Simplicial Complexes Werner Hölbling, Werner Kuhn, Andrew U. Frank Department of Geoinformation Technical University Vienna Gusshausstrasse 27-29, A-1040 Vienna (Austria) frank@geoinfo.tuwien.ac.at

More information

An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem

An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem An Optimal Algorithm for the Euclidean Bottleneck Full Steiner Tree Problem Ahmad Biniaz Anil Maheshwari Michiel Smid September 30, 2013 Abstract Let P and S be two disjoint sets of n and m points in the

More information

UPEM Master 2 Informatique SIS. Digital Geometry. Topic 2: Digital topology: object boundaries and curves/surfaces. Yukiko Kenmochi.

UPEM Master 2 Informatique SIS. Digital Geometry. Topic 2: Digital topology: object boundaries and curves/surfaces. Yukiko Kenmochi. UPEM Master 2 Informatique SIS Digital Geometry Topic 2: Digital topology: object boundaries and curves/surfaces Yukiko Kenmochi October 5, 2016 Digital Geometry : Topic 2 1/34 Opening Representations

More information

A non-partitionable Cohen-Macaulay simplicial complex

A non-partitionable Cohen-Macaulay simplicial complex A non-partitionable Cohen-Macaulay simplicial complex Art Duval 1, Bennet Goeckner 2, Caroline Klivans 3, Jeremy Martin 2 1 University of Texas at El Paso, 2 University of Kansas, 3 Brown University Discrete

More information

Manifolds. Chapter X. 44. Locally Euclidean Spaces

Manifolds. 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 information

Shape Reconstruction from Unorganized Cross-sections

Shape Reconstruction from Unorganized Cross-sections Eurographics Symposium on Geometry Processing (2007) Alexander Belyaev, Michael Garland (Editors) Shape Reconstruction from Unorganized Cross-sections Jean-Daniel BOISSONNAT Pooran MEMARI INRIA Sophia-Antipolis,

More information

Visualizing Parametric Surfaces at Variable Resolution

Visualizing Parametric Surfaces at Variable Resolution Visualizing Parametric Surfaces at Variable Resolution Leila De Floriani 1, Paola Magillo 1, Enrico Puppo 2 1Computer and Information Science Department (DISt), University of Genova, Via Dodecaneso, 35-16146

More information

Homology and Persistent Homology Bootcamp Notes 2017

Homology and Persistent Homology Bootcamp Notes 2017 Homology and Persistent Homology Bootcamp Notes Summer@ICERM 2017 Melissa McGuirl September 19, 2017 1 Preface This bootcamp is intended to be a review session for the material covered in Week 1 of Summer@ICERM

More information

Algorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College

Algorithms for GIS. Spatial data: Models and representation (part I) Laura Toma. Bowdoin College Algorithms for GIS Spatial data: Models and representation (part I) Laura Toma Bowdoin College Outline Spatial data in GIS applications Point data Networks Terrains Planar maps and meshes Data structures

More information

Morse Theory. Investigates the topology of a surface by looking at critical points of a function on that surface.

Morse Theory. Investigates the topology of a surface by looking at critical points of a function on that surface. Morse-SmaleComplex Morse Theory Investigates the topology of a surface by looking at critical points of a function on that surface. = () () =0 A function is a Morse function if is smooth All critical points

More information

Graphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University

Graphs: Introduction. Ali Shokoufandeh, Department of Computer Science, Drexel University Graphs: Introduction Ali Shokoufandeh, Department of Computer Science, Drexel University Overview of this talk Introduction: Notations and Definitions Graphs and Modeling Algorithmic Graph Theory and Combinatorial

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 310 (2010) 2769 2775 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: www.elsevier.com/locate/disc Optimal acyclic edge colouring of grid like graphs

More information

Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research

Tiling Three-Dimensional Space with Simplices. Shankar Krishnan AT&T Labs - Research Tiling Three-Dimensional Space with Simplices Shankar Krishnan AT&T Labs - Research What is a Tiling? Partition of an infinite space into pieces having a finite number of distinct shapes usually Euclidean

More information

On the Size of Higher-Dimensional Triangulations

On the Size of Higher-Dimensional Triangulations Combinatorial and Computational Geometry MSRI Publications Volume 52, 2005 On the Size of Higher-Dimensional Triangulations PETER BRASS Abstract. I show that there are sets of n points in three dimensions,

More information

: Mesh Processing. Chapter 2

: Mesh Processing. Chapter 2 600.657: Mesh Processing Chapter 2 Data Structures Polygon/Triangle Soup Indexed Polygon/Triangle Set Winged-Edge Half-Edge Directed-Edge List of faces Polygon Soup Each face represented independently

More information

A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes

A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes A Simplex based Dimension Independent Approach for Convex Decomposition of Nonconvex polytopes Rizwan Bulbul, Farid Karimipour and Andrew U. Frank Institute of Geoinformation and Cartography Technical

More information

Braid groups and Curvature Talk 2: The Pieces

Braid groups and Curvature Talk 2: The Pieces Braid groups and Curvature Talk 2: The Pieces Jon McCammond UC Santa Barbara Regensburg, Germany Sept 2017 Rotations in Regensburg Subsets, Subdisks and Rotations Recall: for each A [n] of size k > 1 with

More information

4. Simplicial Complexes and Simplicial Homology

4. 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 information

Fast Stellar Mesh Simplification

Fast Stellar Mesh Simplification Fast Stellar Mesh Simplification ANTÔNIO W. VIEIRA 1,2, LUIZ VELHO 3, HÉLIO LOPES 1, GEOVAN TAVARES 1 AND THOMAS LEWINER 1,4 1 PUC Rio Laboratório Matmídia Rio de Janeiro 2 UNIMONTES CCET Montes Claros

More information

Combinatorics I (Lecture 36)

Combinatorics I (Lecture 36) Combinatorics I (Lecture 36) February 18, 2015 Our goal in this lecture (and the next) is to carry out the combinatorial steps in the proof of the main theorem of Part III. We begin by recalling some notation

More information

Theorem 2.9: nearest addition algorithm

Theorem 2.9: nearest addition algorithm There are severe limits on our ability to compute near-optimal tours It is NP-complete to decide whether a given undirected =(,)has a Hamiltonian cycle An approximation algorithm for the TSP can be used

More information

Efficient Handling of Implicit Entities in Reduced Mesh Representations

Efficient Handling of Implicit Entities in Reduced Mesh Representations Waldemar Celes Tecgraf/PUC-Rio, Computer Science Department, Pontifical Catholic University of Rio de Janeiro, Rua Marquês de São Vicente 225, Rio de Janeiro, RJ, 22450-900, Brazil Glaucio H. Paulino 1

More information

Analysis 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 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 information

Chordal Graphs: Theory and Algorithms

Chordal Graphs: Theory and Algorithms Chordal Graphs: Theory and Algorithms 1 Chordal graphs Chordal graph : Every cycle of four or more vertices has a chord in it, i.e. there is an edge between two non consecutive vertices of the cycle. Also

More information

A Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005

A Developer s Survey of Polygonal Simplification algorithms. CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 A Developer s Survey of Polygonal Simplification algorithms CS 563 Advanced Topics in Computer Graphics Fan Wu Mar. 31, 2005 Some questions to ask Why simplification? What are my models like? What matters

More information

EE512 Graphical Models Fall 2009

EE512 Graphical Models Fall 2009 EE512 Graphical Models Fall 2009 Prof. Jeff Bilmes University of Washington, Seattle Department of Electrical Engineering Fall Quarter, 2009 http://ssli.ee.washington.edu/~bilmes/ee512fa09 Lecture 11 -

More information

Linear Complexity Hexahedral Mesh Generation

Linear Complexity Hexahedral Mesh Generation Linear Complexity Hexahedral Mesh Generation David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717 http://www.ics.uci.edu/ eppstein/ Tech. Report 95-51

More information

Chapter 4 Concepts from Geometry

Chapter 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 information

A Counterexample to the Dominating Set Conjecture

A Counterexample to the Dominating Set Conjecture A Counterexample to the Dominating Set Conjecture Antoine Deza Gabriel Indik November 28, 2005 Abstract The metric polytope met n is the polyhedron associated with all semimetrics on n nodes and defined

More information

Elementary Combinatorial Topology

Elementary 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 information