{"status":"public","intvolume":"      1284","year":"1997","place":"Berlin, Heidelberg","publisher":"Springer","author":[{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"},{"id":"15523","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"full_name":"Strothmann, Willy-Bernhard","last_name":"Strothmann","first_name":"Willy-Bernhard"}],"title":"Dynamic data structures for realtime management of large geometric scenes","_id":"16568","department":[{"_id":"63"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"volume":1284,"user_id":"15415","citation":{"short":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 1157–170.","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:1157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>.","bibtex":"@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={1157–170}, collection={Lecture Notes in Computer Science} }","apa":"Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 1157–1170. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>","ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 1157–170, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science. Springer; 1997:1157-1170. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, vol. 1284, Springer, 1997, pp. 1157–70, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>."},"language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","type":"conference","date_updated":"2022-01-06T06:52:52Z","publication":"5th Annual European Symposium on Algorithms (ESA '97)","abstract":[{"text":"We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n","lang":"eng"}],"date_created":"2020-04-15T11:44:36Z","publication_status":"published","doi":"10.1007/3-540-63397-9_13","page":"1157 - 170"}