The concepts of monitoring the elements of triangulation graphs by edges and faces at a distance k were defined by Hernández and Martins (2014, Electr. Notes Discrete Math., 46, 145–152). Furthermore, for any n-vertex maximal outerplanar graph, they provide combinatorial bounds when k=2. In this paper, we continue their study, generalizing its results to any value of k