GreedyMapper

Match items using greedy nearest-neighbor strategy.

Uses spatial distance to greedily match items. When counts differ, extra items on one side become creations or destructions. Algorithm: 1. For the smaller set, greedily assign each to nearest in larger set 2. Remaining unmatched items become creations or destructions Visual effect: Items morph to their spatially nearest counterparts.

GreedyMapper(args, kwargs)

map(
    start_items: List[T],
    end_items: List[T],
    get_position: Callable[[T], Point2D]
) -> List[Match[T]]