Geometric and Topological Inference

Boissonnat, Jean‐Daniel; Chazal, Frédéric; Yvinec, Mariette

doi:10.1017/9781108297806

Cited by 96 publications

(101 citation statements)

References 111 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Research on combinatorial models has introduced high-dimensional generalisations of graphs from topological data analysis. These include hypergraphs, in which links can join any set of nodes [36], and more recently simplicial complexes, in which simplices can join any set of nodes and all subsets of those nodes [37, 38].…”

Section: Modelling Higher-order Dependencies In Complex Systemsmentioning

confidence: 99%

From networks to optimal higher-order models of complex systems

2019

View full text Add to dashboard Cite

show abstract

Section: Modelling Higher-order Dependencies In Complex Systemsmentioning

confidence: 99%

From networks to optimal higher-order models of complex systems

2019

View full text Add to dashboard Cite

show abstract

“…Example 5.6. The second three-dimensional example is the cylinder defined by 2]. For this example we take N = 3200.…”

Section: Numerical Examplesmentioning

confidence: 99%

A surface moving mesh method based on equidistribution and alignment

Kolasinski¹,

Huang²

2020

Journal of Computational Physics

View full text Add to dashboard Cite

A surface moving mesh method is presented for general surfaces with or without explicit parameterization. The method can be viewed as a nontrivial extension of the moving mesh partial differential equation method that has been developed for bulk meshes and demonstrated to work well for various applications. The main challenges in the development of surface mesh movement come from the fact that the Jacobian matrix of the affine mapping between the reference element and any simplicial surface element is not square. The development starts with revealing the relation between the area of a surface element in the Euclidean or Riemannian metric and the Jacobian matrix of the corresponding affine mapping, formulating the equidistribution and alignment conditions for surface meshes, and establishing a meshing energy function based on the conditions. The moving mesh equation is then defined as the gradient system of the energy function, with the nodal mesh velocities being projected onto the underlying surface. The analytical expression for the mesh velocities is obtained in a compact, matrix form, which makes the implementation of the new method on a computer relatively easy and robust. Moreover, it is analytically shown that any mesh trajectory generated by the method remains nonsingular if it is so initially. It is emphasized that the method is developed directly on surface meshes, making no use of any information on surface parameterization. It utilizes surface normal vectors to ensure that the mesh vertices remain on the surface while moving, and also assumes that the initial surface mesh is given. The new method can apply to general surfaces with or without explicit parameterization since the surface normal vectors can be computed even when the surface only has a numerical representation. A selection of twoand three-dimensional examples are presented.

show abstract

“…The idea behind TDA is to build upon some continuous space on top of the data that faithfully encodes the topology and the geometry of the underlying shape; one of these techniques is the simplicial complex, [10]. To be able to work with simplicial complexes, each element in f RF M i must be transformed into a point cloud through a time delay embedding (TDE) Z j .…”

Section: B Time Delay Embeddingmentioning

confidence: 99%