Resolving sets and metric-based parameters capture the ability to distinguish elements of a graph through distances. While the classical metric dimension focuses on distinguishing vertices, planar graphs naturally suggest an analogous question at the level of faces. In this work we introduce the local face metric dimension, a new parameter that measures the least number of vertices needed so that every two adjacent faces have distinct distance representation. This concept extends the scope of resolvability theory from vertex-sets to the facial structure of planar graphs. We develop the basic theory of local face metric dimension for connected planar graphs, focusing on its structural properties and the conditions under which it is well defined and finite. The parameter reflects a localized notion of resolvability and highlights the interaction between graph distances and the facial structure of planar embeddings. Its behavior is explored for several standard graph families to illustrate its variability and dependence on graph structure. The local face metric dimension thus opens a new direction in the study of graph resolvability, highlighting the interplay between metric properties and planar embeddings, and suggesting further structural, extremal, and algorithmic investigations.