Abstract We study (1+ e)-factor approximation algorithms for several well-known
optimization problems on a given npoint set:(a) diameter,(b) width,(c) smallest enclosing …

We are interested in computing effectively cylinders through 5 points, and in other problems
involved in metrology. In particular, we consider the cylinders through 4 points with a fix …

3D Computer Vision algorithms are a subject of research and application for several
industrial processes. The Volume of Interest (VOI) usually refer to sub-objects with basic …

Nonrobustness refers to qualitative or catastrophic failures in geometric algorithms arising
from numerical errors. Section 45.1 provides background on these problems. Although …

A multi-camera setup allows a much greater throughput rate than the two-mirror setup
described in the previous chapter, but this comes at the coSt of grealer monetary expense …

In many cases, the facilities to be located cannot be represented by isolated points, but may
be modeled as dimensional structures. Examples for one-dimensional facilities are straight …

We investigate the problem of finding a minimal volume parallelepiped enclosing a given set
of n three-dimensional points. We give two mathematical properties of these …

Given n points in Euclidean space E d, we propose an algebraic algorithm to compute the
best fitting (d− 1)-cylinder. This algorithm computes the unknown direction of the axis of the …

LINES TANGENT TO 2n − 2 SPHERES IN Rn 1. Introduction We study the following
problem from (real) enumerative geometry. Given: Page 1 TRANSACTIONS OF THE …

In manufacturing, the current trend-shift from mass-production to mass-personalization is
enabled, among others, by the emerging field of human-robot collaboration (HRC), in which …