J. Sellen

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

Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. Expand

Papadimitriou's approximation approach to the Euclidean shortest path (ESP) in 3-space is revisited in the framework of bit complexity. Expand

We examine shortest path planning under a direction weighted Euclidean metric, motivated by the problem of finding optimal routes for sailboats. Expand

This paper introduces the concept of precision- sensitive algorithms, analogous to the well-known output-sensitive algorithms. 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

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