Séminaire de mathématiques appliquées – Conor McCoid

Parsimony in simplicial intersection algorithms

Conor McCoid

Stagiaire postdoctoral au GIREF
Département de mathématiques et de statistique, Université Laval

Résumé

It is important in intersection algorithms that the final result have enough points in the given dimension, i.e. when intersecting triangles it is not acceptable that the intersection has only 1 or 2 points. To ensure this the numerics of the algorithm must be consistent with the geometry of the problem. To maintain consistency one can use the principle of parsimony, using the fewest number of calculations necessary. This talk looks at how to apply parsimony to intersection algorithms and certain related practical considerations.

Le séminaire aura lieu au local 3870 du pavillon Alexandre-Vachon et en ligne.