We consider the problem of finding two parallel rectangles, in arbitrary orientation, covering a given set of n points in a plane, such that the area of the larger rectangle is m...
Maximum margin clustering (MMC) is a recently proposed clustering method, which extends the theory of support vector machine to the unsupervised scenario and aims at finding the m...
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...