• Aucun résultat trouvé

Algorithmic Geometry of Triangulations

N/A
N/A
Protected

Academic year: 2022

Partager "Algorithmic Geometry of Triangulations"

Copied!
14
0
0

Texte intégral

(1)

Algorithmic Geometry of Triangulations

Jean-Daniel Boissonnat Geometrica, INRIA

http://www-sop.inria.fr/geometrica

Winter School, University of Nice Sophia Antipolis January 26-30, 2015

(2)

Algorithmic Geometry of Triangulations

Jean-Daniel Boissonnat Geometrica, INRIA

http://www-sop.inria.fr/geometrica

Winter School, University of Nice Sophia Antipolis January 26-30, 2015

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 2 / 14

(3)

Triangulations and Meshes

(4)

Mesh generation

CGALmesh Achievements

Meshing with sharp features

A polyhedral example

PA-MY (INRIA Geometrica) CGALmesh ARC-ADT-AE-2010 30 / 36

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 4 / 14

(5)

Reconstructing surfaces from point clouds

One can reconstruct a surface from106 points within 1mn [CGAL]

(6)

CGAL-mesh GeometryFactory, Acute3D

CGALmesh Achievements

Meshing 3D multi-domains

Input from segmented 3D medical images [IRCAD]

PA-MY (INRIA Geometrica) CGALmesh ARC-ADT-AE-2010 21 / 36

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 6 / 14

(7)

Geometric data analysis

Images, text, speech, neural signals, GPS traces,...

Geometrisation: Data = points + distances between points Hypothesis: Data lie close to a structure of

“small” intrinsic dimension Problem: Infer the structure from the data

(8)

Image manifolds

An image with10million pixels

→a point in aspace of 10 million dimensions!

camera : 3 dof light : 2 dof

The image-points lie close to a structure ofintrinsic dimension 5 embedded in thishuge ambient space

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 8 / 14

(9)

Motion capture

TypicallyN =100,D=1003,d≤15

(10)

Dimensionality reduction Isomap results: hands

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 10 / 14

(11)

Conformation spaces of molecules e.g. C

8

H

16

Figure 1. Conformation Space of Cyclo-Octane. The set of conformations of cyclo-octane can be represented as a surface in a high dimensional space. On the left, we show various

conformations of cyclo-octane. In the center, these conformations are represented by the 3D coordinates of their atoms. On the right, a dimension reduction algorithm is used to obtain a lower dimensional visualization of the data.

Figure 2. Decomposing Cyclo-Octane. The cyclo-octane conformation space has an interesting decomposition. The local geometry of a self-intersection consists of a cylinder (top left) and a Mobius strip (top right), while the self-intersection is a ring traversing the middle of each object (shown in red). Globally, cyclo-octane conformations can be separated into a sphere (bottom left) and a Klein bottle (bottom right).

!"#$%"&%'&"&()*+%,-./-"(&*"0.-"+.-1&.,2-"+2$&01&!"#$%"&3.-,.-"+%.#4&"&5.67822$&9"-+%#&3.(,"#14&:.-&+82&;#%+2$&!+"+2'&<2,"-+(2#+&.:&=#2-/1>'&

?"+%.#"*&?)6*2"-&!26)-%+1&@$(%#%'+-"+%.#&)#$2-&6.#+-"6+&<=A@3BCADC@5EFBBBG&

Each conformation is represented as a point inR72(R24 when neglecting theHatoms)

The intrinsic dimension of the conformation space is 2 The geometry ofC8H16is highly nonlinear

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 11 / 14

(12)

Course overview

Algorithmic geometry of triangulations

1 Simplicial complexes in metric spaces

Representation of simplicial complexes (D. Mazauric) 2 Delaunay-type complexes

Exercises (A.C. De Vitis)

3 Union of balls andα-complexes Exercises (M. Rouxel-Labb ´e) 4 Mesh generation

Surface reconstruction (P. Alliez) 5 Reconstruction of submanifolds

Exam !

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 12 / 14

(13)

Further reading

CGALmesh :

https://www-sop.inria.fr/geometrica/software/cgalmesh/

Recent theses at Geometrica Sophia Antipolis Triangulation of manifolds : A. Ghosh (2012)

Data structures for computational topology : C. Maria (2014)

Course Notes

www-sop.inria.fr/geometrica/courses/supports/CGL-poly.pdf

Colloquium J. Morgenstern www-sop.inria.fr/colloquium

Vin de Silva : Point-clouds, sensor networks, and persistence:

algebraic topology in the 21st century 26/3/2009

(14)

Projects

European project Computational Geometric Learning (CGL) cgl.uni-jena.de/Home/WebHome

ANR TopData

Geometry meets statisticshttp://geometrica.saclay.inria.fr/

collaborations/TopData/Home.html

ERC Sdvanced Grant GUDHI

Geometry Understanding in Higher Dimensions https://project.inria.fr/gudhi/

On the industrial side

Californian Startup : www.ayasdi.com

Winter School 0 Algorithmic Geometry of Triangulations Sophia Antipolis 14 / 14

Références

Documents relatifs

A simple variational data assimilation problem was used as a case-study to assess the impact of various strategies for scaling and updating the L-BFGS diagonal preconditioner, both

Choisir le menu Sélection puis Cellule et cocher le critère désiré (constante, formule, blancs,...) Utile pour sélectionner les cellules contenant une base de données ou une

Écrivez en Java une fonction main qui déclare et crée un pile d’entiers p , qui empile successivement les entiers 4, −19 et 100, puis dépile la pile p et affiche le sommet de

Ainsi, si on recherche plusieurs fois un même élément, il sera alors amené progressivmeent en début de liste et la recherche sera plus rapide. Dans classe ListeTri donnée en

7 avec la méthode compterPairs qui renvoie le nombre d’entiers pairs contenu dans le fichier

Université de Nice-Sophia Antipolis POLYTECH.

Question sur 1 pt : Il faut d’abord compiler le programme Java en Java Byte Code à l’aide de la commande javac, puis on exécute le .class qui contient la méthode main à l’aide

On souhaite écrire une petite application graphique qui permet à l’utilisateur de dessiner deux points dans un carré, de les relier par une droite et d’afficher la distance entre