Article ID Journal Published Year Pages File Type
438980 Theoretical Computer Science 2011 17 Pages PDF
Abstract

We show that for some special functions (called k-multigrid equidistributed functions), we can compute the limit of the frequency of patterns in the discretization of their graph, when the resolution tends to zero. This result is applied to parabolas. We deduce also that local length estimators almost never converge to the length for the parabolas.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics