Professional Documents
Culture Documents
Simplicial Complexes:
Theory and Implementation
Marek K. Misztal
Affine independence
Examples:
• three non-colinear points in E 2 are affinely independent;
• four non-coplanar points in E 3 are affinely independent;
Simplex
Simplex
• σ is a closed set in E n .
Simplex
• σ is a closed set in E n .
• p is the dimension of σ (equivalently σ is an Euclidean
p-simplex).
Simplices
Faces
Faces
Faces
Faces
Simplex sets
Simplex sets
Topological relations
For a p-simplex σ p in a simplicial complex K we define the following
topological relations:
Topological relations
For a p-simplex σ p in a simplicial complex K we define the following
topological relations:
• for p > q, the boundary relation Bp,q (σ p ) is the set of all q-faces
of σ p :
Bp,q (σ p ) = filterq {σ ∈ K : vert(σ ) ⊂ vert(σ p )},
Topological relations
For a p-simplex σ p in a simplicial complex K we define the following
topological relations:
• for p > q, the boundary relation Bp,q (σ p ) is the set of all q-faces
of σ p :
Bp,q (σ p ) = filterq {σ ∈ K : vert(σ ) ⊂ vert(σ p )},
• for p < q, the coboundary relation Cp,q (σ p ) is the set of all
q-simplices that have σ p as a face:
Cp,q (σ p ) = filterq {σ ∈ K : vert(σ p ) ⊂ vert(σ )},
Topological relations
For a p-simplex σ p in a simplicial complex K we define the following
topological relations:
• for p > q, the boundary relation Bp,q (σ p ) is the set of all q-faces
of σ p :
Bp,q (σ p ) = filterq {σ ∈ K : vert(σ ) ⊂ vert(σ p )},
• for p < q, the coboundary relation Cp,q (σ p ) is the set of all
q-simplices that have σ p as a face:
Cp,q (σ p ) = filterq {σ ∈ K : vert(σ p ) ⊂ vert(σ )},
• for p > 0, the adjacency relation Ap (σ p ) is the set of all
p-simplices, which are (p − 1)-adjacent to σ p (which means
those simplices, that share a (p − 1)-face with σ p ):
Ap (σ p ) = filterp {σ ∈ K : |vert(σ p ) ∩ vert(σ )| = p},
Star
Definition (star)
We define the star of a simplex σ as a set of all the simplices in K,
which have σ as a face:
n
st(σ p ) = {σ ∈ K : vert(σ p ) ⊂ vert(σ )} = Cp,q (σ p ).
[
q =p+1
Star
Closure
Definition (closure)
We define the closure of a simplex σ p ∈ K as a set
p
cl(σ p ) = Bp,q (σ p ).
[
q =0
Closure
Link
Definition (link)
The link of a simplex σ is defined as the set of all the the simplices in
the closure of the star of σ , which do not share a face with σ :
Link
Carrier
Definition
The carrier kKk of a simplicial complex K (also called the polyhedron
kKk) is a subset of E n defined by the union, as point sets, of all the
simplices in K.
Definition
For each point v ∈ kKk there exists exactly one simplex σ ∈ K
containing v in its relative interior. This simplex is denoted by supp(v )
and called the support of the point v .
Manifoldness
Manifoldness
Orientations
If p > 0, |Oσ | = 2, meaning that there are two possible orientations for
any simplex defined on a set of p + 1 points from E n .
Oriented volume
V (σ ) = V (v1 , . . . , vp+1 )
1
= det(v1 − v2 , v2 − v3 , . . . , vp − vp+1 , vp+1 − v1 ).
p!
Consistency
Consistency
Consistency
Consistency
Triangle meshes
Edge flip
Edge split
Face split
Edge collapse
Tetrahedral meshes
Tetrahedral mesh
Data structures
Data structures
Data structures
Data structures
Our implementation
• Our implementation of the IS data structure is restricted to
simplicial complexes of dimension three or less.
Our implementation
• Our implementation of the IS data structure is restricted to
simplicial complexes of dimension three or less.
• Our implementation is orientation-aware: we identify an oriented
simplex σ p with an ordered tuple of its (p − 1)-faces:
h i
σ1p−1 , . . . , σpp−1
+1 ,
which implies:
h i
σ p = vert σ p /vert σ1p−1 , . . . , vert σ p /vert σpp−1
+1 ,
where:
d[
+1
vert σ d = vert σid−1 ,
i =1
Our implemetation
Operations
Operations
Operations
Operations
Operations
Operations
Operations
References
References
References