The path existence problem and the collision detection problem for time-varying objects in a geometric scene are discussed. For a large class of spherical nonrigid objects, exact solutions of the path existence problem are developed based on decomposition techniques and graph traversal. For the collision detection problem of a single moving circle in the plane, efficient data structures are presented for linear/circular and polynomial paths.