This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
Hassene Aissi, Cristina Bazgan, Daniel Vanderpoote...
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...
Abstract. In this paper we present an approach to approximate reachability computation for nonlinear continuous systems. Rather than studying a complex nonlinear system ˙x = g(x),...
An active contour model for parametric curve and surface approximation is presented. The active curve or surface adapts to the model shape to be approximated in an optimization al...
Helmut Pottmann, Stefan Leopoldseder, Michael Hofe...
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...