Worst case and average case cardinality of strictly acute stencils for two dimensional anisotropic fast marching
Résumé
We study a one dimensional approximation-like problem arising in the discretization of a class of Partial Differential Equations, providing worst case and average case complexity results. The analysis is based on the Stern-Brocot tree of rationals, and on a non-Euclidean notion of angles. The presented results generalize and improve on earlier work.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...