Computing Exact Bottleneck Distance on Random Point Sets
Given a complete bipartite graph on two sets of points containing n points each, in a bottleneck matching problem, we want to find an one-to-one correspondence, also called a matching, that minimizes the length of its largest edge; the length of an edge is simply the Euclidean distance between its e...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Published: |
Virginia Tech
2020
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10919/98669 |