• Publications
  • Influence
Computing a Largest Empty Anchored Cylinder, and Related Problems
TLDR
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
  • 10
  • 4
Approximate Euclidean shortest path in 3-space
TLDR
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) problem in 3-space is revisited. Expand
  • 86
  • 2
Approximate Euclidean Shortest Paths in 3-Space
TLDR
Papadimitriou's approximation approach to the Euclidean shortest path (ESP) in 3-space is revisited in the framework of bit complexity. Expand
  • 45
  • 2
Direction weighted shortest path planning
  • J. Sellen
  • Mathematics, Computer Science
  • Proceedings of IEEE International Conference on…
  • 21 May 1995
TLDR
We examine shortest path planning under a direction weighted Euclidean metric, motivated by the problem of finding optimal routes for sailboats. Expand
  • 24
  • 2
Precision-Sensitive Euclidean Shortest Path in 3-Space
TLDR
This paper introduces the concept of precision- sensitive algorithms, analogous to the well-known output-sensitive algorithms. Expand
  • 44
  • 1
  • PDF
Computing a Largest Empty Anchored Cylinder, and Related Problems
TLDR
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
  • 15
  • 1
  • PDF
Lower Bounds for Geometrical and Physical Problems
  • J. Sellen
  • Mathematics, Computer Science
  • SIAM J. Comput.
  • 1 December 1996
TLDR
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
  • 9
  • 1
Exact Geometric Collision Detection
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 underExpand
  • 3
  • 1
  • PDF
Smallest Enclosing Cylinders
TLDR
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
  • 45
  • PDF