We present a simple and e cient paradigm for computing the exact solution of the motionplanning problem in environments with a low obstacle density. Such environments frequently o...
A. Frank van der Stappen, Mark H. Overmars, Mark d...
It is proved that in R3 the volume of any polyhedron is a root of some polynomial with coefficients depending only on the combinatorial structure and the metric of the polyhedron....
Given a set of points S = fp1; : : : ; png in Euclidean d-dimensional space, we address the problem of computing the d-dimensional annulus of smallest width containing the set. We...
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...