We describe space-efficient algorithms for solving problems related to finding maxima among points in two and three dimensions. Our algorithms run in optimal O(n log n) time and oc...
Define a "slice" curve as the intersection of a plane with the surface of a polytope, i.e., a convex polyhedron in three dimensions. We prove that a slice curve develops...
—In this paper we consider the problem of controlling multiple robots manipulating and transporting a payload in three dimensions via cables. We develop robot configurations tha...
In this paper the authors extend their previous work on Boundary Perturbation methods for scattering calculations from families of diffraction gratings to three dimensions and the...
To broaden the scope of decision procedures for linear arithmetic, they have to be integrated into theorem provers. Successful approaches e.g. in NQTHM or ACL2 suggest a close int...