We describe fully retroactive dynamic data structures for approximate range reporting and approximate nearest neighbor reporting. We show how to maintain, for any positive constant d, a set of n points in ℝ d indexed by time such that we can perform insertions or deletions at any point in the timeline in O(logn) amortized time. We support, for any small constant ε > 0, (1 + ε)-approximate range reporting queries at any point in the timeline in O(logn + k) time, where k is the output size. We also show how to answer (1 + ε)-approximate nearest neighbor queries for any point in the past or present in O(logn) time.