New dynamic search data structures developed recently guarantee constan t execution time per search and update, i.e., they fulfil the real-time requirem ents necessary for interactive walkthrough in large geometric scenes. Yet, super iority or even applicability of these new methods in practice was still an open question.

Their prototypical implementation presented in this work uses common libraries o n standard workstations and thus represents a first strut to bridge this gap. In deed our experimental results give an indication on the actual performance of th ese theoretical ideas on real machines and possible bottlenecks in future develo pments. By special algorithmic enhancements, we can even avoid the otherwise ess ential preprocessing step.