Optimal Homologous Chain Problem (OHCP)
Given a chain , the OHCP seeks to find a chain which minimizes
and . One may generalize to
which now also minimizes the area of triangles used.
As an optimization problem, we get
Now consider the generalized median shape LP for a single input chain :
Thus, our median shape code doubles as an OHCP solver by simply passing in a single input chain. The result is sensitive to and .
Starting Current:
Flat Norm:
Chain Version:
Parameters: and
3D Example: Vase
Parameters: and