Zonotopes are centrally symmetric polytopes with a very special structure: they are the Minkowski sum of line segments. In this paper we propose to use zonotopes as bounding volum...
In many computer vision algorithms, the well known Euclidean or SSD (sum of the squared differences) metric is prevalent and justified from a maximum likelihood perspective when t...
Qi Tian, Jie Yu, Qing Xue, Nicu Sebe, Thomas S. Hu...
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
Christian Schindelhauer, Klaus Volbert, Martin Zie...
Fitting data by a bounded complexity linear model is equivalent to low-rank approximation of a matrix constructed from the data. The data matrix being Hankel structured is equival...