9 citations · 20 across the 5 of their papers we have counts for
4 papers · 1 filter
Stabbing Rectangles by Line Segments - How Decomposition Reduces the Shallow-Cell Complexity
Timothy M. Chan, Thomas C. van Dijk, Krzysztof Fleszar +2
We initiate the study of the following natural geometric optimization problem. The input is a set of axis-aligned rectangles in the plane. The objective is to find a set of horizon…
Minimum Rectilinear Polygons for Given Angle Sequences
William S. Evans, Krzysztof Fleszar, Philipp Kindermann +3
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The num…
Colored Non-Crossing Euclidean Steiner Forest
Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann +3
Given a set of -colored points in the plane, we consider the problem of finding trees such that each tree connects all points of one color class, no two trees cross, and the…
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
Aparna Das, Krzysztof Fleszar, Stephen Kobourov +3
Given a set of terminals, which are points in -dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that co…