Français Anglais
Accueil Annuaire Plan du site
Accueil > Evenements > Séminaires
Séminaire d'équipe(s) GALaC
On Kinetic Delaunay Triangulations
Natan Rubin

07 February 2014, 11h00 - 07 February 2014, 12h00
Salle/Bat : 475/PCRI-N
Contact :

Activités de recherche : Théorie des graphes

Résumé :
Given a finite collection P of points in the plane, three points of P form a Delaunay triangle if their circumscribing circle contains no further points of P. These triangles form the famous Delaunay triangulation which, along with its dual Voronoi diagram, is central to Combinatorial and Computational Geometry.

Despite several decades of intensive study, our understanding of the combinatorial behaviour of Voronoi and Delaunay structures is still far from satisfactory. For example, if the points of P are moving along lines at some uniform speed, it has been long conjectured that the Delaunay triangulation experiences at most near-quadratically many discrete changes during the motion.

Our recent study affirms the above conjecture. This is done in a far more general, purely topological setting, which covers uniform-speed linear motions.
We discuss this work in the view of some other fundamental results on the combinatorial complexity of geometric structures.
No prior knowledge of combinatorial geometry is assumed.

Pour en savoir plus :
Séminaires
Knowledge Graph Refinement based on Triplet BERT-N
Gestion de données du Web
Monday 29 November 2021 - 13h00
Salle : 455 - PCRI-N
Armita Khajeh Nassiri .............................................

A Hyper-graph Approach for Computing EL+-Ontology
Raisonnement automatique
Monday 15 November 2021 - 13h00
Salle : 445 - PCRI-N
Hui Yang .............................................

Semantic approaches to predict the presence of asb
Intégration de données et de connaissances
Monday 08 November 2021 - 13h00
Salle : 455 - PCRI-N
Thamer Mecharnia .............................................

Pierre Andrieu - Agrégation de classements pour le
Thursday 21 October 2021 - 00h00
Salle : 435 - PCRI-N
.............................................

A counting argument for graph colouring
Théorie des graphes
Friday 08 October 2021 - 11h00
Salle : 445 - PCRI-N
Francois Pirot .............................................