I don't know a simple formula for ICM(P),
but we can compute it for any convex polygon P recursively,
by taking as an ansatz the assumed property that ICM(P)
will be some (mysteriously) weighted average of the ICMs of its parts,
where and that it will be the same regardless of which partitioning is chosen.
The appropriate kind of partitioning here is dual, in a sense, to the kind of partitioning
down to a triangulation which is done during the computation of CCM.
That is, partitioning is done at a chosen pair of sides, rather than a pair of vertices, of P,
and repeated partitioning eventually arrives at a fully refined set of side-triples, rather than vertex-triples (triangles). We can see immediately that this makes sense when the polygon is tangential-- all side-triples will agree on a common point which is the incenter of P.