In Metric Dimension, we distinguish all pairs of vertices by few selected landmarks.
We show that Metric Dimension is NP-complete on planar graphs.
We show that Metric Dimension has a polynomial-time algorithm on outerplanar graphs.
This closes a 30-year old complexity gap for Metric Dimension.