Asymmetry in the atmosphere of the ultra-hot Jupiter WASP-76 b
Decomposition and modeling in the non manifold domain
1. Decomposition and Modeling
in the Non-Manifold Domain
Phd. Thesis; Phd student: Franco Morando
University of Genoa
Genoa (Italy)
1
2. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
2
What is a Non-Manifold Object?
Manifold object in nD:: every point has
a neighborhood homeomorphic to
either a n-ball (internal point) or to a n-
dimensional closed half-plane
(boundary point).
Non-manifold points do not have a
neighborhood that fulfills the definition
above.
Non-manifold objects contain some
non-manifold point.
Singularity:: a connected set of non-
manifold points
3. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
3
A k-dimensional simplex (or k-simplex) σ in Ed
is the locus of the points in Ed
that can be
expressed as the convex combination of k+1
linearly independent points.
Such points are called vertices of σ
Given a k-simplex σ, any s-simplex τ
generated by a subset of s+1<= k vertices of σ
is called an s-face of σ.
Geometric Simplex
5. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
5
Non-Manifold Modeling: Why?
To represent and manipulate objects which
combine wire-frames, surfaces, and solid parts
in CAD/CAM applications.
Complex spatial objects are described by
meshes with a non-manifoldnon-manifold and non-regularnon-regular
domain.
Non-manifold and non-regular meshes are
generated by topology-modifying simplificationtopology-modifying simplification
algorithms.
6. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
6
Non-Manifold Objects are Difficult
The mathematics of non-manifolds is not well
understood.
Identifying and classifying singularities is not
easy.
Data structures must support object traversal and
editing, but traversing singularities could be
difficult.
7. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
7
Related work - Non-manifold
decomposition
Non-manifold spineNon-manifold spine [Desaulniers and Stewart, 1992]
Manifold components, efficient, supports extended Euler
operators
2D only, r-sets only
Cutting and StitchingCutting and Stitching [Gueziec et al., 1998]
Manifold components, efficient, supports compression
2D only, r-sets only
MatchmakerMatchmaker [Rossignac and Cardoze, 1999]
Compact and efficient
Pseudomanifold components, 2D only, r-sets only
8. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
8
Outline
Modeling with simplicial complexes
A scalable data structure for the 2D case
Decomposition of non-manifold meshes
The decomposition lattice
The standard decomposition
The class of initial-quasi manifold complexes
A two-level data structure for the 2D and 3D
cases
Conclusions
Applications
9. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
9
A finite collection Σ of simplexes such that:
for each simplex σ ∈ Σ, all faces of σ belong to Σ
for each pair of simplexes σ and τ, either σ∩τ = ∅ or
σ∩τ is a face of both σ and τ.
Simplicial complex
10. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
10
The 2D case (triangle-segment
meshes)
Wire-edge:Wire-edge: no
triangle incident at it
Different types of edges (in red)
Triangle-edge:Triangle-edge: at least one
triangle incident at it
Connected simplicial complex
in 2D (triangle-segmenttriangle-segment mesh)
11. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
11
Manifold and non-manifold edges
in 2D
Manifold edge:Manifold edge: exactly one or two triangles
incident at it
in red 8 manifold triangle
edges
in red a non manifold edge
12. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
12
Manifold and non-manifold vertices in 2D
Manifold vertex:Manifold vertex:
– No incident triangle and one/two incident edges
OR
– No incident wire-edges and incident triangles form a
single fan
in red 6 manifold vertices in red 3 non-manifold vertices
13. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
13
Decomposition
Basic idea in this thesis:
Cut the complex at non-manifold cells
Duplicate cells at cuts
Cuts remove singularities and reveal
components.
Object disconnected into components:components:
Each component has a regular structure
Components are linked together at non-
manifold jointsjoints
14. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
14
The nD case - Decomposition
A uniform approach to the nD case:
2D decompose mesh of triangles and segments
3D decompose 2D+tetrahedralizations
4D and above.
18. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
18
Examples of Decomposition (2D-3D)
2D
2D 3D
19. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
19
Examples of Decomposition
This decomposition is possible only if the object on the left is
represented as a surface
20. F. Morando Decomposition and Modeling in the Non-Manifold Domain
20
Examples of Decomposition (2D)
Minimal decomposition adding just one point is possible in
2D (surface mesh) and not possible in 3D (volume mesh)
21. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
21
Examples of Decomposition
Hard to decide where to cut. Need a standard
solution.
In 3D, we can only cut through the volume
22. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
22
Examples of Decomposition
In 2D, we can also inflate the surface
introducing another point
q
p'
p
p
r
23. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
23
Requirements for decomposition
Eliminate as many singularities as possible
Do not cut through manifold parts
Do not create too many parts (Compactness)
Algorithm must be deterministic (Uniqueness)
Contrasting requirements:
Uniqueness
Compactness
24. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
24
Requirements for decomposition
Eliminate as many singularities as
possible (red edge must be fixed)
Do not cut through manifold parts
(green edge must stay)
25. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
25
Requirements for decomposition
Compactness: Do not create too
many parts (2 parts seems
enough)
Shall we avoid this?
26. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
26
Uniqueness
In green the three possible manifold
decompositions with least number of parts
Minimal decomposition is not unique
In yellow maximal decomposition
Maximal decomposition is
unique
27. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
27
A formal approach to decomposition
Consider all possible decompositions of a complex
Reject decompositions:
that cut through manifold faces (too much decomposed)
that still contain singularities which could be eliminated
without cutting through manifold faces (not decomposed
enough)
The remaining decompositions are admissible
[De Floriani, Mesmoudi, Morando, Puppo, DGCI01]
28. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
28
The decomposition lattice
Decompositions form a lattice having its bottom at
the input complex and its top at the totally
exploded version of the same complex
Top
Bottom
29. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
29
Stitching equivalences
Each arc in the lattice is an operation that
identifies/splits two vertices (stitching
equivalence)
30. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
30
The standard decomposition
The standard decompositionstandard decomposition is the least upper
bound (the most decomposed complex) in the
sub-lattice of admissible decompositions that
do not cut through manifold faces
The standard decomposition can be computed
in linear time w.r.t. the number of vertices in
the output and in t log t w.r.t. the number of
simplices t in the input.
32. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
32
Standard
decomposition
Admissible
decompositions
33. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
33
Takes the most decomposed among
admissible decompositions (blue area)
is Unique
disconnects only at singular joints
The standard decomposition
34. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
34
The most compact among admissible
decompositions
is not unique.
there could be decompositions with the same
number of parts that are not even
topologically equivalent
may not reveal parts correctly
Non standard decompositions…
35. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
35
More compact decompositions that are
not topologically equivalent
Non standard decompositions…
Non orientable
Orientable
Standard
Decomposition
36. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
36
The standard decomposition
The standard decomposition can be computed
in linear time w.r.t. the number of vertices in
the output and in t log t w.r.t. the number of
simplices t in the input.
37. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
38
A local and recursive algorithm
Initialize output complex ∇ at input complex Σ
Analyze iteratively each vertex v of Σ :
Consider the link of v. It’s a (d-1)-complex
Decompose it
If the link decomposition has more than one
connected component split v in ∇
Introduce a copy of v for each connected
component in the decomposed link
(the link of a vertex v is the set of faces of cells in
the star of v, which are not incident at v)
38. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
39
An example of decomposition
Link of u
Link of v
39. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
40
An example of decomposition
Decomposed link of v in Σ
v splits into
two copies
40. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
41
An example of decomposition
Decomposed link of u in Σ
u splits into
four
copies
41. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
42
An example of decomposition
The result is the standard decomposition
42. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
44
A light decomposition algorithm
Computational complexity: O(n + t log t) where
n is the number of vertices in the output
decomposition
t is the number of top cells in the input complex
43. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
45
The standard decomposition
The standard decomposition may leave non
manifoldness whenever it unclear how to split.
This reveals a new class of non-manifolds we
called initial quasi-manifoldinitial quasi-manifold (IQM).
The connected components of the standard
decomposition are initial quasi-manifold..
44. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
46
Initial quasi-manifolds
The connected components of the standard
decomposition are initial quasi-manifoldinitial quasi-manifold (IQM)
Some examples:
The pinched pie considered as a set of tetrahedra
is a 3D IQM. Its boundary is not a 2D IQM since
the standard decomposition inflate it (on the right).
p'
pp
45. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
47
Some examples of IQM…
The double pinched pie considered as a
set of tetrahedra is a 3D IQM. Its
boundary is not a 2D IQM the standard
decomposition inflate it.
a
ba
46. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
48
Initial quasi manifoldness is not…
If we add a vertex in on the pinched
edge the resulting complex is not an
IQM
The standard decomposition decompose
it into a torus hence...
47. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
49
Initial quasi manifoldness is not…
Initial quasi manifoldness depends on
the particular triangulation
It is not a topoligical property
It is a combinatorial property
48. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
50
Initial quasi-manifolds facts…
A complex is initial quasi-manifold if and only if
the star of each vertex is (d-1)-manifold
connected
The class of initial quasi-manifolds is the class
of all those complexes that cannot be
decomposed without cutting through manifold
faces
NO
YES
49. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
51
Initial quasi-manifolds facts…
In 2D: initial quasi-manifold coincides with
manifold
The standard 2-decomposition is made of
manifold components
For D≥3 initial quasi-manifolds could be non-
manifold and possibly even non-pseudomanifold
There are IQM tetrahedralizations where, 3
tetrahedra are incident to a triangle.
For D=3 an IQM complex embedded in 3D
space, must be a pseudomanifold
Thus the standard decomposition is made of
pseudomanifold components: it is easy to
navigate components through face adjacencies
50. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
52
Initial quasi-manifolds
Encoding IQMs:
In an IQM the star of each vertex is (d-1)-manifold
connected
This means that we can easily navigate the whole
star of each vertex through (d-1)-adjacencies
This is important to design data structures
51. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
53
A two-level data structure for 3D
meshes in E3
Encode separately decomposition and IQM
components.
In IQMs the star of each vertex is (d-1)-
manifold connected so we can easily encode
the whole star of each vertex through (d-1)-
adjacencies
[De Floriani, Morando, Puppo, ongoing work]
52. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
54
Related work - Non-manifold data
structures
Radial-edge and extensionsRadial-edge and extensions [Weiler, 1988; Gursoz
et al., 1990; Yamaguchi and Kimura, 1995; Lee and Lee,
2001; McCains and Hellerstein, 2001]
General and efficient
Expensive, 2D only
Selective Geometric ComplexesSelective Geometric Complexes [Rossignac and
O’Connor, 1990]
Very general, nD
Not efficient in mesh traversal (implemented with incidence
graphs)
Directed edgesDirected edges [Campagna et al., 1999]
Compact and efficient
2D only, regular objects only
53. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
55
A data structure for triangle-
segment meshes [De Floriani, Magillo, Puppo, Sobrero,
ACM-SMA 2002]
Stores only triangles and vertices. Edges are stored
implicitly as either triangle sides (triangle-edges) or vertex
adjacencies (wire-edges).
Maintains a reduced set of relations that permit to
retrieve all relations involving triangles and vertices in
optimal time
54. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
56
A data structure for triangle-
segment meshes[De Floriani, Magillo, Puppo, Sobrero,
ACM-SMA 2002]
For each triangle t stores links to its three
vertices (Triangle-Vertex relationTriangle-Vertex relation)
For each edge e of t stores two triangles adjacent
to t if e is non-manifold, one triangle otherwise
(partial Triangle-Triangle relationpartial Triangle-Triangle relation)
55. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
57
A data structure for triangle-
segment meshes [De Floriani, Magillo, Puppo,
Sobrero, ACM-SMA 2002]
For each vertex v maintain:For each vertex v maintain:
All vertices adjacent to v
through wire-edges
(Vertex-Vertex relationVertex-Vertex relation)
One triangle incident for each
edge-connected component of
triangles incident at v
(partial Vertex-Trianglepartial Vertex-Triangle
relationrelation)
56. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
58
A data structure for triangle-
segment meshes [De Floriani, Magillo, Puppo,
Sobrero, ACM-SMA 2002]
Storage cost:Storage cost:
24m + 16n + 16l + 8c + 4a bytes and 3m +2n bits, where
n number of vertices
m number of triangles
l number of wire edges
c number of edge-connected components of triangles at
non-manifold vertices
a number of triangles incident at non-manifold edges
In the manifold case:In the manifold case:
m ≈ 2n, l=c=a=0
Total cost is ≈ 65n bytes, only one byte more than
indexed structure with adjacencies
57. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
59
A data structure for triangle-
segment meshes [De Floriani, Magillo, Puppo,
Sobrero, ACM-SMA 2002]
It can be traversed through edge adjacencies and it
can be traversed around a vertex both in optimal timeoptimal time
(in linear w.r.t. the output size)
Downscale well to manifold meshes.Downscale well to manifold meshes. Overhead
limited to one byte per vertexone byte per vertex w.r.t. indexed data
structure with adjacencies when applied to manifold
meshes
More compactMore compact than specialization of existing non-
manifold data structures to 2D simplicial complexes
(cons?)… it does not represent explicitly singularitiessingularities
and componentscomponents of the object
58. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
60
A two-level data structure for 3D
meshes in E3
For each non-manifold vertex split by decomposition,
maintain a table of its vertex copies in the components of
the standard decomposition.
Vertex tables can be accessed through hashing.
Vertex tables are sufficient to navigate among different
components.
Vertex-based and Tetrahedron-based relations can be
retrieved in optimal time.
Edge-based and Triangle-based relations can be
retrieved in time proportional to the size of star of their
vertices
[De Floriani, Morando, Puppo, ongoing work]
59. F. Morando Decomposition and Modeling in the Non-Manifold Domain
61
A two-level data structure for 3D
meshes in E3
For each component of the standard decomposition:
Store only tetrahedra and vertices
For each vertex maintain:
One incident tetrahedron (partial Vertex-
Tetrahedron relation)
For each tetrahedron maintain
List of vertices (Tetrahedron-Vertex relation)
List of adjacent tetrahedra (Tetrahedron-
Tetrahedron relation)
60. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
62
Summary
A decomposition of nD complexes into initial quasi-
manifold components:
Mathematically sound and unique decomposition
Efficient algorithm
A data structure for direct encoding of triangle-
segment meshes:
Efficient
More compact than other existing structures
Scalable to the manifold case
A two-level data structure for 3D meshes based on
standard decomposition:
Compact and efficient
Represents components and non-manifold joints explicitly
61. F. Morando Decomposition and Modeling in the Non-Manifold Domain
63
Current and future work
Extension of data structures to arbitrary
dimensions
Non-manifold multiresolution modeling
Non-manifold simplification
Retrieval-by-sketch from 3D object databases
3D icons
62. F. Morando Decomposition and Modeling in the Non-Manifold Domain
64
Non-manifold simplification
Iterative local simplification of geometry
Simplification may change topology and
dimension
Reveals the part-based structure of the object
[De Floriani, Mo, Morando, Pupagillpo, IWVF01]
63. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
65
22288
triangles
161 triangles + 14 edges
18 tri + 7 edges 4 tri + 5 edges 6 edges
Non-manifold simplification
64. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
67
11098
triangles
166 triangles
22 tri + 2 edges 3 edges5 tri + 1 edge
Non-manifold simplification
65. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
68
1906 triangles 10 tri +30 edges
Non-manifold simplification
66. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
69
Non-Manifold Multi-Tessellation (NMT)
[De Floriani, Magillo, Puppo, Sobrero, ACM-SMA 2002]
Non-manifold simplification define a Directed Acyclic
Graph (NMT-DAG)
67. F. Morando: Decomposition and Modeling in the Non-Manifold Domain
70
Selective refinement on a
NMT
Selective refinement:Selective refinement: extract a mesh from a NMT
satisfying some application-dependent requirements
(LOD criterion + maximal size)
Extracted meshesExtracted meshes correspond to set S of
modifications closedclosed with respect to the partial
order defined by the DAG.
68. F. Morando Decomposition and Modeling in the Non-Manifold Domain
71
Different shapes are merged into a single non-manifold
3D icon by overlapping NMT-DAGs
The standard decomposition of the non-manifold 3D
icon can be the starting point to define keys for the
database
Retrieval-by-sketch from 3D
object databases
69. F. Morando Decomposition and
Modeling in the Non-Manifold
Domain72
Thank you!
Joint work with:
L. De Floriani, P. Magillo, E. Puppo,
M.Mesmoudi, D. Sobrero.