nayana-c1.867c992ae9100904cc61c84591adf0f8f863e0387e30f0d0dbc86640e9f50a1a.en.train.256515

The task

Which of the following is NOT a reason why walking algorithms are often efficient in practice? A. They leverage spatial uniformity in practical point sets. B. They avoid modifying the Delaunay data structure. C. They always guarantee O(log n) time complexity. D. They use local geometric information to traverse the tessellation. Return only the single uppercase letter of the correct option.