The paper focuses on computing a large number of non-intersecting geometrical objects. Recently, Joseph Mitchell has introduced a new partitioning technique that implies a fast and efficient approximation algorithm for computing non-intersecting rectangles in the plane. In the SODA 2022 paper, Mathieu Mari and his colleagues extended and improved Mitchell’s techniques to obtain an even better approximation ratio for this problem. This algorithm can contribute to the improvement of the solutions in logistics, transport, or medicine. Congratulations!
Authors: Mathieu Mari, Waldo Gálvez, Arindam Khan, Tobias Mömke, Madhusudhan Reddy, Andreas Wiese.
Link to the conference program: SODA22 Program and Abstracts