map with 30 different cities
Source: Chile Finals 2011 L2 p4
October 5, 2022
combinatoricscombinatorial geometry
Problem Statement
It is intended to make a map locating different cities on it. For this, all the distances between these cities are available as data (each of these distances is considered as a “data”). Three of these cities are already laid out on the map, and they turn out to be non-collinear. How much data must be used as a minimum to complete the map?