Worst-case versus Average Case Complexity of Ray-shooting

@inproceedings{SzirmayKalosWorstcaseVA,
  title={Worst-case versus Average Case Complexity of Ray-shooting},
  author={L Aszll O Szirmay-Kalos and G Abor and Michael Arton}
}
This paper examines worst-case and average-case complexity measures of ray-shooting algorithms in order to nd the answer to the question why computer graphics practitioners prefer heuristic methods to extensively studied worst-case optimal algorithms. It demonstrates that ray-shooting requires at least logarithmic time in the worst-case and discusses the strategies how to design such worst-case optimal algorithms. It also examines the lower-bounds of storage complexity of logarithmic-time… CONTINUE READING