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

The task

Which of the following statements is true about the algorithms proposed in the thesis? A. Pivot Walk is analyzed for its worst-case performance. B. Cone Walk includes a detailed average-case analysis with explicit bounds on the worst possible path. C. Both Pivot Walk and Cone Walk are designed for Poisson line tessellations. D. The algorithms are used exclusively for locality sensitive hashing. Return only the single uppercase letter of the correct option.