A Faster Algorithm for the Limited-Capacity Many-to-Many Point Matching in One Dimension

04/04/2019

∙

by   Fatemeh Rajabi-Alni, et al.

∙

0

∙

share

Given two point sets S and T on a line, we present a linear time algorithm for the limited capacity many-to-many matching between S and T which improves the previous quadratic algorithm.