We consider the problem of computing a ray R emanating from the origin (resp. a line l through the origin) such that minp ∈ S w(p) · d(p,R) is maximal.Expand

We consider the problem of computing a ray R emanating from the origin (resp. a line l through the origin) such that minp∈S w(p) · d(p, R) is maximal.Expand

In this paper, we examine the complexity of generalized motion-planning problems for planar mechanisms consisting of independently movable objects and show that they are PSPACE-hard if we use number representations by mantissa and exponent, and even undecidable if we allow that some motions require no force or an infinite amount.Expand

Exact computation is an important paradigm for the implementation of geometric algorithms. In this paper, we consider for the first time the practically important problem of collision detection under… Expand

This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space in an algebraic complexity model.Expand