Suppose that we have two polyhedra $P_1$ and $P_2$ in $\mathbb{R}^3$. I would like to define such a metric $\rho(P_1, P_2)$ that depends on several factors, but currently I don't know how to do it better.

The distance is intended to be smaller if:

"big facets" of $P_1$ have one-to-one correspondence with "big facets" of $P_2$,

"big facets" of $P_1$ and $P_2$ that correspond to each other are close to each other within Hausdorff distance,

"big facets" $f_{1,1}$ and $f_{1,2}$ of $P_1$ that share some edge $e_1$ have corresponding "big facets" $f_{2,1}$ and $f_{2,2}$ that also share some edge $e_2$, and $f_{1,1}$ is close to $f_{2,1}$, $f_{1,2}$ is close to $f_{2,2}$, and $e_1$ is close to $e_2$ within Hausdorff distance,

the same as (3), but "share some edge $e_1$" is replaced with "have close edges $e_{1,1}$ and $e_{1, 2}$" and so on.

Actually, the facet is considered to be "big" if its area $area(f)$ is "big". We may introduce some parameter $\varepsilon$ which will show whether the facet is big: $area(f) > \varepsilon$. But it seems that it would be better if the metric is parameter-free.

So my question consists of the following parts:

Is the concept described above already studied in the literature? Or at least anything related to this?

What is the most convenient way to make the metric definition? It seems that this is a hybrid of Hausdorff distance in Euclidean space and graph distance.

Actually, I'm trying to make the reconstruction in this metric, and to prove the properties of any algorithm I need to make a strict definition of this metric. So it would be great to make it as simple as possible.

Any ideas are welcome!