# Bipartite diameter and other measures under translation

Boris Aronov, Omrit Filtser, Matthew J. Katz, Khadijeh Sheikhan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

## Abstract

Let A and B be two sets of points in Rd, where |A| = |B| = n and the distance between them is defined by some bipartite measure dist(A, B). We study several problems in which the goal is to translate the set B, so that dist(A, B) is minimized. The main measures that we consider are (i) the diameter in two and three dimensions, that is diam(A, B) = max{d(a, b) | a ∈ A, b ∈ B}, where d(a, b) is the Euclidean distance between a and b, (ii) the uniformity in the plane, that is uni(A, B) = diam(A, B) − d(A, B), where d(A, B) = min{d(a, b) | a ∈ A, b ∈ B}, and (iii) the union width in two and three dimensions, that is union_width(A, B) = width(A ∪ B). For each of these measures we present efficient algorithms for finding a translation of B that minimizes the distance: For diameter we present near-linear-time algorithms in R2 and R3, for uniformity we describe a roughly O(n9/4)-time algorithm, and for union width we offer a near-linear-time algorithm in R2 and a quadratic-time one in R3

Original language English (US) 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 Rolf Niedermeier, Christophe Paul Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing 9783959771009 https://doi.org/10.4230/LIPIcs.STACS.2019.8 Published - Mar 1 2019 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 - Berlin, GermanyDuration: Mar 13 2019 → Mar 16 2019

### Publication series

Name Leibniz International Proceedings in Informatics, LIPIcs 126 1868-8969

### Conference

Conference 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 Germany Berlin 3/13/19 → 3/16/19

## Keywords

• Geometric optimization
• Minimum-width annulus
• Translation-invariant similarity measures

• Software