[1]} introduced an approach for elastic partial matching to tackle trailing incompleteness.
Before registering each curve to its template using the complete curve SRVF approach of
[2]} they estimate the time scaling necessary to (partially) match
the observed domain of a specific curve to the domain of the template curve and perform the
registration only on the intersection of the curves' domains.
Both steps are combined in a joint, gradient-based algorithm.
At the time of writing, no implementation of their method was available on request.
