We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
Let f(n) be the maximum number of unit distances determined by the vertices of a convex n-gon. Erdos and Moser conjectured that this function is linear. Supporting this conjecture...
—We develop an algorithm aimed at estimating travel time on segments of a road network using a convex optimization framework. Sampled travel time from probe vehicles are assumed ...
Sebastien Blandin, Laurent El Ghaoui, Alexandre M....
This paper introduces an unsupervised color segmentation
method. The underlying idea is to segment the input
image several times, each time focussing on a different
salient part...
Michael Donoser, Martin Urschler, Martin Hirzer an...