[{"year":"2011","citation":{"short":"T. Suess, C. Koch, C. Jähn, M. Fischer, in: S. Brooks, P. Irani (Eds.), Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, Canadian Human-Computer Communications Society, 2011, pp. 79--86.","bibtex":"@inproceedings{Suess_Koch_Jähn_Fischer_2011, title={Approximative occlusion culling using the hull tree}, booktitle={Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada}, publisher={Canadian Human-Computer Communications Society}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias}, editor={Brooks, Stephen and Irani, Pourang}, year={2011}, pages={79--86} }","mla":"Suess, Tim, et al. “Approximative Occlusion Culling Using the Hull Tree.” <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, edited by Stephen Brooks and Pourang Irani, Canadian Human-Computer Communications Society, 2011, pp. 79--86.","apa":"Suess, T., Koch, C., Jähn, C., &#38; Fischer, M. (2011). Approximative occlusion culling using the hull tree. In S. Brooks &#38; P. Irani (Eds.), <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i> (pp. 79--86). Canadian Human-Computer Communications Society.","ama":"Suess T, Koch C, Jähn C, Fischer M. Approximative occlusion culling using the hull tree. In: Brooks S, Irani P, eds. <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>. Canadian Human-Computer Communications Society; 2011:79--86.","ieee":"T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling using the hull tree,” in <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, 2011, pp. 79--86.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, and Matthias Fischer. “Approximative Occlusion Culling Using the Hull Tree.” In <i>Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, edited by Stephen Brooks and Pourang Irani, 79--86. Canadian Human-Computer Communications Society, 2011."},"page":"79--86","title":"Approximative occlusion culling using the hull tree","publisher":"Canadian Human-Computer Communications Society","date_updated":"2022-01-06T06:53:11Z","author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"first_name":"Clemens","full_name":"Koch, Clemens","last_name":"Koch"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"}],"date_created":"2020-07-27T19:17:03Z","editor":[{"full_name":"Brooks, Stephen","last_name":"Brooks","first_name":"Stephen"},{"first_name":"Pourang","full_name":"Irani, Pourang","last_name":"Irani"}],"abstract":[{"lang":"eng","text":"Occlusion culling is a common approach to accelerate real-time rendering of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes, it is necessary to remove occluded objects to achieve a frame rate that provides an interactive environment. In order to benefit from the culling properly, often hierarchical data structures are used. These data structures typically create a spatial subdivision of a given scene into axis-aligned bounding boxes. These boxes can be tested quickly, but they are not very precise. By using these boxes, the included objects are detected as visible, even if other objects occlude them (false-positives). To get perfect results, the models’ original geometry included in the box has to be tested, but this would require too much computational power. To overcome this problem, original objects’ approximations could be used, but typical methods for mesh simplification cannot be applied, because they do not create an outer hull for a given object. We present a model simplification algorithm, which generates simple outer hulls, consisting of only few more triangles than a box, while preserving an object’s shape better than a corresponding bounding box. This approach is then extended to a hierarchical data structure, the so-called hull tree, that can be generated for a given scene to improve the visibility tests. Next, we present an approximative rendering algorithm, which combines the features of the hull tree with the use of inner hulls for efficient occlusion detection and global state-sorting of the visible objects.\r\n"}],"status":"public","type":"conference","publication":"Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada","language":[{"iso":"eng"}],"_id":"17420","user_id":"15415","department":[{"_id":"63"}]},{"language":[{"iso":"eng"}],"_id":"17421","department":[{"_id":"63"}],"user_id":"15415","status":"public","publication":"Proceedings of the 2011 Winter Simulation Conference (WSC)","type":"conference","title":"Simulation aided, knowledge based routing for AGVs in a distribution warehouse","doi":"10.1109/wsc.2011.6147883","date_updated":"2022-01-06T06:53:11Z","date_created":"2020-07-27T19:21:18Z","author":[{"last_name":"Klaas","full_name":"Klaas, Alexander","first_name":"Alexander"},{"first_name":"Christoph","full_name":"Laroque, Christoph","last_name":"Laroque"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"}],"year":"2011","citation":{"ama":"Klaas A, Laroque C, Dangelmaier W, Fischer M. Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In: <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>. ; 2011. doi:<a href=\"https://doi.org/10.1109/wsc.2011.6147883\">10.1109/wsc.2011.6147883</a>","chicago":"Klaas, Alexander, Christoph Laroque, Wilhelm Dangelmaier, and Matthias Fischer. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” In <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>, 2011. <a href=\"https://doi.org/10.1109/wsc.2011.6147883\">https://doi.org/10.1109/wsc.2011.6147883</a>.","ieee":"A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge based routing for AGVs in a distribution warehouse,” in <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>, 2011.","apa":"Klaas, A., Laroque, C., Dangelmaier, W., &#38; Fischer, M. (2011). Simulation aided, knowledge based routing for AGVs in a distribution warehouse. In <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>. <a href=\"https://doi.org/10.1109/wsc.2011.6147883\">https://doi.org/10.1109/wsc.2011.6147883</a>","short":"A. Klaas, C. Laroque, W. Dangelmaier, M. Fischer, in: Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.","bibtex":"@inproceedings{Klaas_Laroque_Dangelmaier_Fischer_2011, title={Simulation aided, knowledge based routing for AGVs in a distribution warehouse}, DOI={<a href=\"https://doi.org/10.1109/wsc.2011.6147883\">10.1109/wsc.2011.6147883</a>}, booktitle={Proceedings of the 2011 Winter Simulation Conference (WSC)}, author={Klaas, Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2011} }","mla":"Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>, 2011, doi:<a href=\"https://doi.org/10.1109/wsc.2011.6147883\">10.1109/wsc.2011.6147883</a>."},"publication_identifier":{"isbn":["9781457721090","9781457721083","9781457721069","9781457721076"]},"publication_status":"published"},{"intvolume":"       295","page":"185--197","citation":{"chicago":"Suess, Tim, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide, and Clemens Koch. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 295:185--197. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011.","ieee":"T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2011, vol. 295, pp. 185--197.","ama":"Suess T, Jähn C, Fischer M, Meyer auf der Heide F, Koch C. Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 295. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2011:185--197.","short":"T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, C. Koch, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2011, pp. 185--197.","mla":"Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 295, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011, pp. 185--197.","bibtex":"@inproceedings{Suess_Jähn_Fischer_Meyer auf der Heide_Koch_2011, place={Paderborn}, title={Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze}, volume={295}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Suess, Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm and Koch, Clemens}, year={2011}, pages={185--197} }","apa":"Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., &#38; Koch, C. (2011). Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>295</i>, 185--197."},"year":"2011","place":"Paderborn","volume":295,"date_created":"2020-07-29T12:19:22Z","author":[{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"last_name":"Koch","full_name":"Koch, Clemens","first_name":"Clemens"}],"publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","date_updated":"2022-01-06T06:53:12Z","title":"Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze","publication":"Augmented & Virtual Reality in der Produktentstehung","type":"conference","status":"public","department":[{"_id":"63"},{"_id":"26"}],"user_id":"15415","_id":"17450","language":[{"iso":"eng"}]},{"year":"2011","citation":{"ama":"Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In: <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>. ; 2011.","chicago":"Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” In <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011.","ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” in <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011.","apa":"Renken, H., Laroque, C., &#38; Fischer, M. (2011). An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>.","mla":"Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011.","bibtex":"@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings of The 25th European Simulation and Modelling Conference - ESM2011}, author={Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 2011."},"date_updated":"2022-01-06T06:53:26Z","author":[{"last_name":"Renken","full_name":"Renken, Hendrik","first_name":"Hendrik"},{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"}],"date_created":"2020-08-24T14:01:49Z","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM2011","type":"conference","status":"public","_id":"18193","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"type":"preprint","abstract":[{"text":"We present a parallel rendering system for PC-Clusters to visualize large 3D scenes. One single visualization node, equipped with a high-end graphics adapter, is supported by a group of backend nodes with weak graphics performance. The objects of the scene are distributed among these backend nodes, they serve two purposes: First, they provide an out-of-core memory system for the visualization node. Second, they assist the visualization node's rendering by performing visibility calculations and only sending visible objects to the visualization node. In order to obtain fast rendering with our system, we have to distribute the objects among the backend nodes in a way that does not only guarantee an even distribution of the objects, but also an even distribution of the visibility calculations and the amount of data send to the visualization node. We identify necessary properties of the distribution and argue that a random distribution is a good candidate. Further, in order to reduce the number of objects sent to the visualization node per frame, we employ an approximate hierarchical occlusion culling in each backend node. For this, they are equipped, in addition to the objects assigned to them, with simplified versions of the other objects of the 3D scene. The visualization node is equipped with 512 MiB video memory and supported by 15 backend nodes. This system is able to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model between 20 - 30 fps and thus allows a walkthrough in real-time.","lang":"eng"}],"status":"public","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2020-08-24T14:13:46Z","creator":"koala","date_updated":"2020-08-24T14:13:46Z","file_name":"pre-03-2011-5220.pdf","access_level":"closed","file_id":"18195","file_size":3091853}],"_id":"18194","department":[{"_id":"63"}],"user_id":"15415","ddc":["000"],"file_date_updated":"2020-08-24T14:13:46Z","language":[{"iso":"eng"}],"has_accepted_license":"1","year":"2011","citation":{"apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2011). <i>Parallel Out-of-Core Occlusion Culling</i>.","mla":"Suess, Tim, et al. <i>Parallel Out-of-Core Occlusion Culling</i>. 2011.","bibtex":"@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011} }","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core Occlusion Culling. Published online 2011."},"date_updated":"2022-01-06T06:53:27Z","date_created":"2020-08-24T14:14:10Z","author":[{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"},{"first_name":"Clemens","last_name":"Koch","full_name":"Koch, Clemens"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"}],"title":"Parallel Out-of-Core Occlusion Culling"},{"doi":"10.1007/978-3-642-18381-2_15","title":"Collisionless Gathering of Robots with an Extent","author":[{"last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas","first_name":"Andreas"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"full_name":"Hüllmann, Martina","last_name":"Hüllmann","first_name":"Martina"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Alexander","last_name":"Klaas","full_name":"Klaas, Alexander"},{"first_name":"Peter","full_name":"Kling, Peter","last_name":"Kling"},{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"},{"last_name":"Märtens","full_name":"Märtens, Marcus","first_name":"Marcus"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"last_name":"Swierkot","full_name":"Swierkot, Kamil","first_name":"Kamil"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"first_name":"Christoph","full_name":"Weddemann, Christoph","last_name":"Weddemann"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"date_created":"2020-04-06T07:52:42Z","publisher":"Springer","date_updated":"2022-01-06T06:52:50Z","citation":{"bibtex":"@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>}, number={6543}, booktitle={37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }","mla":"Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.” <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, no. 6543, Springer, 2011, pp. 178–89, doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>.","short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011, pp. 178–189.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i> (pp. 178–189). Springer. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots with an Extent. In: <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>. Springer; 2011:178-189. doi:<a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">10.1007/978-3-642-18381-2_15</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “Collisionless Gathering of Robots with an Extent,” in <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 2011, no. 6543, pp. 178–189.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering of Robots with an Extent.” In <i>37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)</i>, 178–89. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-18381-2_15\">https://doi.org/10.1007/978-3-642-18381-2_15</a>."},"page":"178-189","year":"2011","issue":"6543","publication_status":"published","publication_identifier":{"isbn":["9783642183805","9783642183812"],"issn":["0302-9743","1611-3349"]},"language":[{"iso":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16410","status":"public","abstract":[{"text":"Gathering n mobile robots in one single point in the Euclidean plane is a widely studied problem from the area of robot formation problems. Classically, the robots are assumed to have no physical extent, and they are able to share a position with other robots. We drop these assumptions and investigate a similar problem for robots with (a spherical) extent: the goal is to gather the robots as close together as possible. More exactly, we want the robots to form a sphere with minimum radius around a predefined point. We propose an algorithm for this problem which synchronously moves the robots towards the center of the sphere unless they block each other. In this case, if possible, the robots spin around the center of the sphere. We analyze this algorithm experimentally in the plane. If R is the distance of the farthest robot to the center of the sphere, the simulations indicate a runtime which is linear in n and R. Additionally, we prove a theoretic upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations also suggest a runtime of O(n + R) for the discrete version.","lang":"eng"}],"type":"conference","publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)"},{"date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Andreas","full_name":"Cord-Landwehr, Andreas","last_name":"Cord-Landwehr"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"last_name":"Hüllmann","full_name":"Hüllmann, Martina","first_name":"Martina"},{"last_name":"Kempkes","full_name":"Kempkes, Barbara","first_name":"Barbara"},{"first_name":"Alexander","last_name":"Klaas","full_name":"Klaas, Alexander"},{"last_name":"Kling","full_name":"Kling, Peter","first_name":"Peter"},{"first_name":"Sven","full_name":"Kurras, Sven","last_name":"Kurras"},{"first_name":"Marcus","full_name":"Märtens, Marcus","last_name":"Märtens"},{"last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm"},{"last_name":"Raupach","full_name":"Raupach, Christoph","first_name":"Christoph"},{"full_name":"Swierkot, Kamil","last_name":"Swierkot","first_name":"Kamil"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel"},{"full_name":"Weddemann, Christoph","last_name":"Weddemann","first_name":"Christoph"},{"last_name":"Wonisch","full_name":"Wonisch, Daniel","first_name":"Daniel"}],"date_created":"2020-04-06T07:47:55Z","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","doi":"10.1007/978-3-642-22012-8_52","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","place":"Berlin, Heidelberg","year":"2011","citation":{"short":"A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas, P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot, D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming, Berlin, Heidelberg, 2011.","bibtex":"@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for Analyzing Convergence Algorithms for Mobile Robots}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>}, booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes, Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }","mla":"Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” <i>Automata, Languages and Programming</i>, 2011, doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>.","apa":"Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>","ama":"Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing Convergence Algorithms for Mobile Robots. In: <i>Automata, Languages and Programming</i>. Berlin, Heidelberg; 2011. doi:<a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">10.1007/978-3-642-22012-8_52</a>","ieee":"A. Cord-Landwehr <i>et al.</i>, “A New Approach for Analyzing Convergence Algorithms for Mobile Robots,” in <i>Automata, Languages and Programming</i>, Berlin, Heidelberg, 2011.","chicago":"Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann, Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing Convergence Algorithms for Mobile Robots.” In <i>Automata, Languages and Programming</i>. Berlin, Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-22012-8_52\">https://doi.org/10.1007/978-3-642-22012-8_52</a>."},"_id":"16409","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}],"publication":"Automata, Languages and Programming","type":"book_chapter","abstract":[{"lang":"eng","text":"Given a set of n mobile robots in the d-dimensional Euclidean space, the goal is to let them converge to a single not predefined point. The challenge is that the robots are limited in their capabilities. Robots can, upon activation, compute the positions of all other robots using an individual affine coordinate system. The robots are indistinguishable, oblivious and may have different affine coordinate systems. A very general discrete time model assumes that robots are activated in arbitrary order. Further, the computation of a new target point may happen much earlier than the movement, so that the movement is based on outdated information about other robot's positions. Time is measured as the number of rounds, where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg: Convergence properties of gravitational algorithms in asynchronous robot systems], the Center of Gravity is considered as target function, convergence was proven, and the number of rounds needed for halving the diameter of the convex hull of the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check property of target functions that guarantee convergence and yields upper time bounds. This property intuitively says that when a robot computes a new target point, this point is significantly within the current axes aligned minimal box containing all robots. This property holds, e.g., for the above-mentioned target function, and improves the above O(n^2) to an asymptotically optimal O(n) upper bound. Our technique also yields a constant time bound for a target function that requires all robots having identical coordinate axes.\r\n"}],"status":"public"},{"title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","language":[{"iso":"eng"}],"_id":"26384","date_updated":"2022-01-25T18:15:43Z","department":[{"_id":"671"}],"user_id":"71124","author":[{"first_name":"Hendrik","full_name":"Renken, Hendrik","last_name":"Renken"},{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"}],"date_created":"2021-10-16T22:43:30Z","year":"2011","status":"public","citation":{"bibtex":"@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011}, author={Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011, 2011.","mla":"Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011</i>, 2011.","apa":"Renken, H., Laroque, C., &#38; Fischer, M. (2011). An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011</i>.","ama":"Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization. In: <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011</i>. ; 2011.","chicago":"Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and Their Visualization.” In <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011</i>, 2011.","ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” 2011."},"publication_status":"published","publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011","type":"conference"},{"publication_status":"published","year":"2011","citation":{"short":"A. Klaas, C. Laroque, M. Fischer, W. Dangelmaier, in: Proceedings of the 2011 Winter Simulation Conference, 2011.","mla":"Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” <i>Proceedings of the 2011 Winter Simulation Conference</i>, 2011.","bibtex":"@inproceedings{Klaas_Laroque_Fischer_Dangelmaier_2011, title={Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse}, booktitle={Proceedings of the 2011 Winter Simulation Conference}, author={Klaas, Alexander  and Laroque, Christoph  and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2011} }","apa":"Klaas, A., Laroque, C., Fischer, M., &#38; Dangelmaier, W. (2011). Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse. <i>Proceedings of the 2011 Winter Simulation Conference</i>.","ieee":"A. Klaas, C. Laroque, M. Fischer, and W. Dangelmaier, “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse,” 2011.","chicago":"Klaas, Alexander , Christoph  Laroque, Matthias Fischer, and Wilhelm Dangelmaier. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.” In <i>Proceedings of the 2011 Winter Simulation Conference</i>, 2011.","ama":"Klaas A, Laroque C, Fischer M, Dangelmaier W. Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse. In: <i>Proceedings of the 2011 Winter Simulation Conference</i>. ; 2011."},"date_updated":"2022-01-25T18:16:03Z","date_created":"2021-10-16T22:54:06Z","author":[{"first_name":"Alexander ","full_name":"Klaas, Alexander ","last_name":"Klaas"},{"first_name":"Christoph ","full_name":"Laroque, Christoph ","last_name":"Laroque"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"}],"title":"Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse","type":"conference","publication":"Proceedings of the 2011 Winter Simulation Conference","status":"public","_id":"26387","user_id":"71124","department":[{"_id":"671"}],"language":[{"iso":"eng"}]},{"publication_identifier":{"isbn":["9781424498666"]},"publication_status":"published","citation":{"apa":"Fischer, M., Renken, H., Laroque, C., Schaumann, G., &#38; Dangelmaier, W. (2010). Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In <i>Proceedings of the 2010 Winter Simulation Conference</i>. <a href=\"https://doi.org/10.1109/wsc.2010.5678906\">https://doi.org/10.1109/wsc.2010.5678906</a>","mla":"Fischer, Matthias, et al. “Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations.” <i>Proceedings of the 2010 Winter Simulation Conference</i>, 2010, doi:<a href=\"https://doi.org/10.1109/wsc.2010.5678906\">10.1109/wsc.2010.5678906</a>.","bibtex":"@inproceedings{Fischer_Renken_Laroque_Schaumann_Dangelmaier_2010, title={Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations}, DOI={<a href=\"https://doi.org/10.1109/wsc.2010.5678906\">10.1109/wsc.2010.5678906</a>}, booktitle={Proceedings of the 2010 Winter Simulation Conference}, author={Fischer, Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier, Wilhelm}, year={2010} }","short":"M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings of the 2010 Winter Simulation Conference, 2010.","ieee":"M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations,” in <i>Proceedings of the 2010 Winter Simulation Conference</i>, 2010.","chicago":"Fischer, Matthias, Hendrik Renken, Christoph Laroque, Guido Schaumann, and Wilhelm Dangelmaier. “Automated 3D-Motion Planning for Ramps and Stairs in Intra-Logistics Material Flow Simulations.” In <i>Proceedings of the 2010 Winter Simulation Conference</i>, 2010. <a href=\"https://doi.org/10.1109/wsc.2010.5678906\">https://doi.org/10.1109/wsc.2010.5678906</a>.","ama":"Fischer M, Renken H, Laroque C, Schaumann G, Dangelmaier W. Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations. In: <i>Proceedings of the 2010 Winter Simulation Conference</i>. ; 2010. doi:<a href=\"https://doi.org/10.1109/wsc.2010.5678906\">10.1109/wsc.2010.5678906</a>"},"year":"2010","author":[{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"first_name":"Hendrik","last_name":"Renken","full_name":"Renken, Hendrik"},{"first_name":"Christoph","full_name":"Laroque, Christoph","last_name":"Laroque"},{"first_name":"Guido","full_name":"Schaumann, Guido","last_name":"Schaumann"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"}],"date_created":"2020-07-27T19:33:16Z","date_updated":"2022-01-06T06:53:11Z","doi":"10.1109/wsc.2010.5678906","title":"Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations","publication":"Proceedings of the 2010 Winter Simulation Conference","type":"conference","status":"public","abstract":[{"lang":"eng","text":"Commercial software of material flow simulations has the ability to layout the simulated models. Arranged equipment, such as conveyors or machines, includes the need to model and determine motion paths for moving objects like forklifts or automatically guided vehicles, so that the simulation framework is able to navigate all vehicles across those motion paths. After analyzing first scenarios, the user often carries out layout changes in the simulation model, e.g. moving, adding or deleting equipment. However, those changes cause time consuming, additional modeling of the motion paths for the user. Our motion planning algorithm reduces these changes by automatically determining the motion paths for moving objects, depending on an actual model layout without colliding with other objects. The algorithm works on the basis of the virtual scene’s 3D-data used for the simulation model’s visualization. We demonstrate the technique with a multi-floor building example."}],"department":[{"_id":"63"}],"user_id":"15415","_id":"17422","language":[{"iso":"eng"}]},{"user_id":"15415","department":[{"_id":"63"}],"_id":"18136","language":[{"iso":"eng"}],"type":"conference","publication":"Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)","status":"public","abstract":[{"text":"We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.","lang":"eng"}],"date_created":"2020-08-24T07:07:55Z","author":[{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"last_name":"Suess","full_name":"Suess, Tim","first_name":"Tim"}],"date_updated":"2022-01-06T06:53:26Z","publisher":"The Eurographics Association","doi":"10.2312/EGPGV/EGPGV10/043-051","title":"Asynchronous Parallel Reliefboard Computation for Scene Object Approximation","citation":{"short":"M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.","bibtex":"@inproceedings{Fischer_Jähn_Suess_2010, title={Asynchronous Parallel Reliefboard Computation for Scene Object Approximation}, DOI={<a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>}, booktitle={Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)}, publisher={The Eurographics Association}, author={Fischer, Matthias and Jähn, Claudius and Suess, Tim}, year={2010}, pages={43–51} }","mla":"Fischer, Matthias, et al. “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation.” <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, The Eurographics Association, 2010, pp. 43–51, doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>.","apa":"Fischer, M., Jähn, C., &#38; Suess, T. (2010). Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, 43–51. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">https://doi.org/10.2312/EGPGV/EGPGV10/043-051</a>","ieee":"M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation,” in <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, 2010, pp. 43–51, doi: <a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>.","chicago":"Fischer, Matthias, Claudius Jähn, and Tim Suess. “Asynchronous Parallel Reliefboard Computation for Scene Object Approximation.” In <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>, 43–51. The Eurographics Association, 2010. <a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">https://doi.org/10.2312/EGPGV/EGPGV10/043-051</a>.","ama":"Fischer M, Jähn C, Suess T. Asynchronous Parallel Reliefboard Computation for Scene Object Approximation. In: <i>Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)</i>. The Eurographics Association; 2010:43-51. doi:<a href=\"https://doi.org/10.2312/EGPGV/EGPGV10/043-051\">10.2312/EGPGV/EGPGV10/043-051</a>"},"page":"43-51","year":"2010"},{"language":[{"iso":"eng"}],"_id":"18289","department":[{"_id":"63"}],"user_id":"15415","abstract":[{"lang":"eng","text":"Many professional cluster systems consist of nodes with different hardware configurations. Such heterogeneous environments require different load-balancing techniques than homogenous environments. The c-load-collision-protocol is able to achieve good results for data-management purposes. Using this protocol, we propose a way for load-balancing in interactive rendering environments. For this work, we implemented a parallel rendering system and took different picking strategies into account to compare the results. The advantage of our approach compared to other approaches is that we group the available nodes of a cluster into two different categories, based on the hardware abilities. Some nodes are used solely for rendering, while others serve as secondary storage and to assist the former ones by performing auxiliary calculations."}],"status":"public","publication":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","type":"conference","title":"Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments","doi":"10.1109/nas.2010.52","date_updated":"2022-01-06T06:53:28Z","date_created":"2020-08-25T14:04:38Z","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"last_name":"Wiesemann","full_name":"Wiesemann, Timo","first_name":"Timo"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"}],"year":"2010","page":"448 - 456","citation":{"apa":"Suess, T., Wiesemann, T., &#38; Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 448–456. <a href=\"https://doi.org/10.1109/nas.2010.52\">https://doi.org/10.1109/nas.2010.52</a>","mla":"Suess, Tim, et al. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing in Interactive Environments.” <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 2010, pp. 448–56, doi:<a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>.","bibtex":"@inproceedings{Suess_Wiesemann_Fischer_2010, title={Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments}, DOI={<a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>}, booktitle={2010 IEEE Fifth International Conference on Networking, Architecture, and Storage}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010}, pages={448–456} }","short":"T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference on Networking, Architecture, and Storage, 2010, pp. 448–456.","chicago":"Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing in Interactive Environments.” In <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 448–56, 2010. <a href=\"https://doi.org/10.1109/nas.2010.52\">https://doi.org/10.1109/nas.2010.52</a>.","ieee":"T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments,” in <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>, 2010, pp. 448–456, doi: <a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>.","ama":"Suess T, Wiesemann T, Fischer M. Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments. In: <i>2010 IEEE Fifth International Conference on Networking, Architecture, and Storage</i>. ; 2010:448-456. doi:<a href=\"https://doi.org/10.1109/nas.2010.52\">10.1109/nas.2010.52</a>"},"publication_identifier":{"isbn":["9781424481330"]},"publication_status":"published"},{"date_updated":"2022-01-06T06:53:28Z","author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"first_name":"Timo","full_name":"Wiesemann, Timo","last_name":"Wiesemann"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"}],"date_created":"2020-08-25T14:14:36Z","title":"Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems","year":"2010","citation":{"mla":"Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 2010, pp. 39–52.","bibtex":"@inbook{Suess_Wiesemann_Fischer_2010, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010}, pages={39–52}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"T. Suess, T. Wiesemann, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.","apa":"Suess, T., Wiesemann, T., &#38; Fischer, M. (2010). Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In <i>Augmented &#38; Virtual Reality in der Produktentstehung</i> (pp. 39–52).","ieee":"T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2010, pp. 39–52.","chicago":"Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 39–52. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2010.","ama":"Suess T, Wiesemann T, Fischer M. Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2010:39-52."},"page":"39-52","_id":"18290","user_id":"15415","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","department":[{"_id":"63"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Augmented & Virtual Reality in der Produktentstehung","abstract":[{"text":"Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen, die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster eingesetzt werden.\r\n","lang":"ger"}],"status":"public"},{"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642172885","9783642172892"]},"publication_status":"published","year":"2010","place":"Berlin, Heidelberg","citation":{"apa":"Eikel, B., Jähn, C., &#38; Fischer, M. (2010). Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>","bibtex":"@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>}, booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias}, year={2010} }","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","mla":"Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” <i>Advances in Visual Computing</i>, 2010, doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>.","ama":"Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2010. doi:<a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">10.1007/978-3-642-17289-2_60</a>","chicago":"Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-17289-2_60\">https://doi.org/10.1007/978-3-642-17289-2_60</a>.","ieee":"B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2010."},"date_updated":"2022-01-06T06:52:52Z","date_created":"2020-04-14T13:06:51Z","author":[{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","doi":"10.1007/978-3-642-17289-2_60","publication":"Advances in Visual Computing","type":"book_chapter","abstract":[{"text":"We present an approach for real-time rendering of complex 3D scenes consisting of millions of polygons on limited graphics hardware. In a preprocessing step, powerful hardware is used to gain fine granular global visibility information of a scene using an adaptive sampling algorithm. Additively the visual influence of each object on the eventual rendered image is estimated. This influence is used to select the most important objects to display in our approximative culling algorithm. After the visibility data is compressed to meet the storage capabilities of small devices, we achieve an interactive walkthrough of the Power Plant scene on a standard netbook with an integrated graphics chipset.","lang":"eng"}],"status":"public","_id":"16505","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","text":"Modern companies are nowadays confronted with an increasing demand of multiple products, where they need to perform more flexible every day. Cost-intensive decisions are to be confirmed in short times, in order to minimize risks and secure efficient production programs as well as material flows. Tools for this digital planning via simulation methods are one well established possibility to receive decision support. Nevertheless, the creation of the necessary simulation models is a complicated and error-prone process, where complexity of modeling, validation and verification depends on the used tool and its functionalities. This paper presents implemented concepts for an innovative user support in his tasks of verification and validation of simulation models during the execution of a simulation run. Time-intensive procedures like stopping simulation, parameterization and restarting within the problem analysis are simplified. So the user is able to focus on the real problem solving task."}],"status":"public","publication":"European Simulation and Modelling Conference (ESM 2009)","type":"conference","language":[{"iso":"eng"}],"_id":"18138","department":[{"_id":"63"}],"user_id":"15415","year":"2009","citation":{"ieee":"C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification and Validation during Simulation Runtime,” in <i>European Simulation and Modelling Conference (ESM 2009)</i>, 2009.","chicago":"Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts for Model Verification and Validation during Simulation Runtime.” In <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI, 2009.","ama":"Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation during Simulation Runtime. In: <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI; 2009.","apa":"Laroque, C., Fischer, M., &#38; Dangelmaier, W. (2009). Concepts for Model Verification and Validation during Simulation Runtime. In <i>European Simulation and Modelling Conference (ESM 2009)</i>. EUROSIS-ETI.","bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model Verification and Validation during Simulation Runtime}, booktitle={European Simulation and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }","short":"C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","mla":"Laroque, Christoph, et al. “Concepts for Model Verification and Validation during Simulation Runtime.” <i>European Simulation and Modelling Conference (ESM 2009)</i>, EUROSIS-ETI, 2009."},"title":"Concepts for Model Verification and Validation during Simulation Runtime","publisher":"EUROSIS-ETI","date_updated":"2022-01-06T06:53:26Z","date_created":"2020-08-24T07:28:23Z","author":[{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"}]},{"intvolume":"       252","page":"111--126","citation":{"ieee":"T. Suess, M. Fischer, D. Huber, C. Laroque, and W. Dangelmaier, “Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","chicago":"Suess, Tim, Matthias Fischer, Daniel Huber, Christoph  Laroque, and Wilhelm Dangelmaier. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 252:111--126. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009.","ama":"Suess T, Fischer M, Huber D, Laroque C, Dangelmaier W. Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 252. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2009:111--126.","apa":"Suess, T., Fischer, M., Huber, D., Laroque, C., &#38; Dangelmaier, W. (2009). Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen. In <i>Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 252, pp. 111--126). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.","mla":"Suess, Tim, et al. “Ein System Zur Aggregierten Visualisierung Verteilter Materialflusssimulationen.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 252, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126.","bibtex":"@inbook{Suess_Fischer_Huber_Laroque_Dangelmaier_2009, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen}, volume={252}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Suess, Tim and Fischer, Matthias and Huber, Daniel and Laroque, Christoph  and Dangelmaier, Wilhelm}, year={2009}, pages={111--126}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","short":"T. Suess, M. Fischer, D. Huber, C. Laroque, W. Dangelmaier, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2009, pp. 111--126."},"year":"2009","volume":252,"date_created":"2020-08-25T14:25:41Z","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"},{"last_name":"Huber","full_name":"Huber, Daniel","first_name":"Daniel"},{"first_name":"Christoph ","last_name":"Laroque","full_name":"Laroque, Christoph "},{"last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm"}],"date_updated":"2022-01-06T06:53:28Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen","publication":"Augmented & Virtual Reality in der Produktentstehung","type":"book_chapter","status":"public","department":[{"_id":"63"},{"_id":"26"}],"series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","user_id":"5786","_id":"18291","language":[{"iso":"eng"}]},{"type":"conference","publication":"Proc. 25th European Workshop on Computational Geometry","status":"public","abstract":[{"text":"For a fixed virtual scene (=collection of simplices) S and given observer\r\nposition p, how many elements of S are weakly visible (i.e. not fully occluded\r\nby others) from p? The present work explores the trade-off between query time\r\nand preprocessing space for these quantities in 2D: exactly, in the approximate\r\ndeterministic, and in the probabilistic sense. We deduce the EXISTENCE of an\r\nO(m^2/n^2) space data structure for S that, given p and time O(log n), allows\r\nto approximate the ratio of occluded segments up to arbitrary constant absolute\r\nerror; here m denotes the size of the Visibility Graph--which may be quadratic,\r\nbut typically is just linear in the size n of the scene S. On the other hand,\r\nwe present a data structure CONSTRUCTIBLE in O(n*log(n)+m^2*polylog(n)/k)\r\npreprocessing time and space with similar approximation properties and query\r\ntime O(k*polylog n), where k<n is an arbitrary parameter. We describe an\r\nimplementation of this approach and demonstrate the practical benefit of the\r\nparameter k to trade memory for query time in an empirical evaluation on three\r\nclasses of benchmark scenes.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"18346","language":[{"iso":"eng"}],"citation":{"chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” In <i>Proc. 25th European Workshop on Computational Geometry</i>, 203–6, 2009.","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” in <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–206.","ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. In: <i>Proc. 25th European Workshop on Computational Geometry</i>. ; 2009:203-206.","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., &#38; Ziegler, M. (2009). Planar Visibility Counting. In <i>Proc. 25th European Workshop on Computational Geometry</i> (pp. 203–206).","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–06.","bibtex":"@inproceedings{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2009, title={Planar Visibility Counting}, booktitle={Proc. 25th European Workshop on Computational Geometry}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2009}, pages={203–206} }","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, in: Proc. 25th European Workshop on Computational Geometry, 2009, pp. 203–206."},"page":"203-206","year":"2009","date_created":"2020-08-26T08:49:50Z","author":[{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"last_name":"Hilbig","full_name":"Hilbig, Matthias","first_name":"Matthias"},{"first_name":"Claudius","full_name":"Jähn, Claudius","last_name":"Jähn"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_updated":"2022-01-06T06:53:29Z","title":"Planar Visibility Counting"},{"publication_identifier":{"isbn":["9780769534718"]},"publication_status":"published","year":"2008","citation":{"bibtex":"@inproceedings{Suess_Huber_Fischer_Laroque_Dangelmaier_2008, title={A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations}, DOI={<a href=\"https://doi.org/10.1109/ispa.2008.30\">10.1109/ispa.2008.30</a>}, booktitle={IEEE International Symposium on Parallel and Distributed Processing with Applications}, author={Suess, Tim and Huber, Daniel and Fischer, Matthias and Laroque, Christoph and Dangelmaier, Wilhelm}, year={2008} }","mla":"Suess, Tim, et al. “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.” <i>IEEE International Symposium on Parallel and Distributed Processing with Applications</i>, 2008, doi:<a href=\"https://doi.org/10.1109/ispa.2008.30\">10.1109/ispa.2008.30</a>.","short":"T. Suess, D. Huber, M. Fischer, C. Laroque, W. Dangelmaier, in: IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008.","apa":"Suess, T., Huber, D., Fischer, M., Laroque, C., &#38; Dangelmaier, W. (2008). A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. <i>IEEE International Symposium on Parallel and Distributed Processing with Applications</i>. <a href=\"https://doi.org/10.1109/ispa.2008.30\">https://doi.org/10.1109/ispa.2008.30</a>","ama":"Suess T, Huber D, Fischer M, Laroque C, Dangelmaier W. A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations. In: <i>IEEE International Symposium on Parallel and Distributed Processing with Applications</i>. ; 2008. doi:<a href=\"https://doi.org/10.1109/ispa.2008.30\">10.1109/ispa.2008.30</a>","chicago":"Suess, Tim, Daniel Huber, Matthias Fischer, Christoph Laroque, and Wilhelm Dangelmaier. “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations.” In <i>IEEE International Symposium on Parallel and Distributed Processing with Applications</i>, 2008. <a href=\"https://doi.org/10.1109/ispa.2008.30\">https://doi.org/10.1109/ispa.2008.30</a>.","ieee":"T. Suess, D. Huber, M. Fischer, C. Laroque, and W. Dangelmaier, “A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations,” 2008, doi: <a href=\"https://doi.org/10.1109/ispa.2008.30\">10.1109/ispa.2008.30</a>."},"date_updated":"2022-01-06T06:53:11Z","date_created":"2020-07-27T12:56:15Z","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"full_name":"Huber, Daniel","last_name":"Huber","first_name":"Daniel"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"}],"title":"A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations","doi":"10.1109/ispa.2008.30","publication":"IEEE International Symposium on Parallel and Distributed Processing with Applications","type":"conference","abstract":[{"lang":"eng","text":"In this paper we present a system for the simultaneous visualization of several parallel executed simulation replications. By aggregating the scenes of multiple similar simulations into one single scene it is possible to make a visual statistical analysis of a set of discrete event simulations as well as to easily compare different system parameterizations. The aim of our system is to enhance the model analysis, verification and validation process in terms of speed and ease. The parallel execution of several simulations of complex models and the visualization of these cannot be done on one computer, thus a parallel approach is necessary. Our system uses a thin-client and multiple processors on a PC-cluster. The rendering and the simulation execution are done on processors of the cluster. The client is used only for the visualization of the images transmitted by the cluster and for user interaction.\r\n"}],"status":"public","_id":"17416","department":[{"_id":"63"}],"user_id":"15415","language":[{"iso":"eng"}]},{"abstract":[{"text":"The paper describes an approach for an aggregated animation of a simulation experiment in an interactive 3D environment, visualizing multiple, distributed simulation runs. Although the general approach of a 3-dimensional visualization of material flow simulation helps to understand the dynamic behavior of a system better as well as faster, it remains unclear, how typical the animated simulation represents the model, if there is a stochastic influence for even some parameters. By the integrated visualization of multiple distributed simulation runs, this uncertainty can be solved, which will be shown in this paper for a typical simulation study of a queuing system. ","lang":"eng"}],"status":"public","publication":"2008 Winter Simulation Conference","type":"conference","language":[{"iso":"eng"}],"_id":"17868","department":[{"_id":"63"}],"user_id":"15415","year":"2008","place":"Miami, FL., USA","page":"2012-2020","citation":{"ama":"Dangelmaier W, Fischer M, Huber D, Laroque C, Suess T. Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. In: <i>2008 Winter Simulation Conference</i>. ; 2008:2012-2020. doi:<a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>","ieee":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, and T. Suess, “Aggregated 3D-visualization of a distributed simulation experiment of a queuing system,” in <i>2008 Winter Simulation Conference</i>, 2008, pp. 2012–2020, doi: <a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>.","chicago":"Dangelmaier, Wilhelm, Matthias Fischer, Daniel Huber, Christoph Laroque, and Tim Suess. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” In <i>2008 Winter Simulation Conference</i>, 2012–20. Miami, FL., USA, 2008. <a href=\"https://doi.org/10.1109/wsc.2008.4736296\">https://doi.org/10.1109/wsc.2008.4736296</a>.","bibtex":"@inproceedings{Dangelmaier_Fischer_Huber_Laroque_Suess_2008, place={Miami, FL., USA}, title={Aggregated 3D-visualization of a distributed simulation experiment of a queuing system}, DOI={<a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>}, booktitle={2008 Winter Simulation Conference}, author={Dangelmaier, Wilhelm and Fischer, Matthias and Huber, Daniel and Laroque, Christoph and Suess, Tim}, year={2008}, pages={2012–2020} }","mla":"Dangelmaier, Wilhelm, et al. “Aggregated 3D-Visualization of a Distributed Simulation Experiment of a Queuing System.” <i>2008 Winter Simulation Conference</i>, 2008, pp. 2012–20, doi:<a href=\"https://doi.org/10.1109/wsc.2008.4736296\">10.1109/wsc.2008.4736296</a>.","short":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.","apa":"Dangelmaier, W., Fischer, M., Huber, D., Laroque, C., &#38; Suess, T. (2008). Aggregated 3D-visualization of a distributed simulation experiment of a queuing system. <i>2008 Winter Simulation Conference</i>, 2012–2020. <a href=\"https://doi.org/10.1109/wsc.2008.4736296\">https://doi.org/10.1109/wsc.2008.4736296</a>"},"publication_identifier":{"isbn":["9781424427079"]},"publication_status":"published","title":"Aggregated 3D-visualization of a distributed simulation experiment of a queuing system","doi":"10.1109/wsc.2008.4736296","date_updated":"2022-01-06T06:53:22Z","author":[{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Huber, Daniel","last_name":"Huber","first_name":"Daniel"},{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"}],"date_created":"2020-08-12T13:39:37Z"},{"status":"public","abstract":[{"text":"This paper describes a method for the animation of a large number of objects within a dynamic 3D visualization of a material flow simulation model. It uses key-frame based animation. The number of animated objects may grow constantly in complex simulation models, which might lead to an amount of animations that is too big to be computed in real-time. By the use of a dynamic adjustment, the presented algorithm prefers important animations. Less relevant animations are updated rarely, whereby the selection itself is taken by multiple indicators, e.g. the visible size of the animated object on the screen, in order to keep a good optical impression. Dependent on the computing power of the computer, the algorithm controls the animations in such a way, that the fluid visualization of a large number of objects is still possible. Though the algorithm is to be used within a material flow simulator, it is moreover implemented in a specific animation editor, which allows the design and control of animation schemes. It supports the use of grouping to allow the creation of hierarchical structures for complex animations in a fast and easy manner. The evaluation of the algorithm is proven by a test scene, consisting of tens of thousands animated objects. ","lang":"eng"}],"publication":"Industrial Simulation Conference (ISC 2008)","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18139","page":"306-310","citation":{"bibtex":"@inproceedings{Laroque_Fischer_Dangelmaier_Eikel_2008, title={Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations}, booktitle={Industrial Simulation Conference (ISC 2008)}, publisher={EUROSIS-ETI}, author={Laroque, Christoph and Fischer, Matthias and Dangelmaier, Wilhelm and Eikel, Benjamin}, year={2008}, pages={306–310} }","mla":"Laroque, Christoph, et al. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations.” <i>Industrial Simulation Conference (ISC 2008)</i>, EUROSIS-ETI, 2008, pp. 306–10.","short":"C. Laroque, M. Fischer, W. Dangelmaier, B. Eikel, in: Industrial Simulation Conference (ISC 2008), EUROSIS-ETI, 2008, pp. 306–310.","apa":"Laroque, C., Fischer, M., Dangelmaier, W., &#38; Eikel, B. (2008). Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In <i>Industrial Simulation Conference (ISC 2008)</i> (pp. 306–310). EUROSIS-ETI.","chicago":"Laroque, Christoph, Matthias Fischer, Wilhelm Dangelmaier, and Benjamin Eikel. “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations.” In <i>Industrial Simulation Conference (ISC 2008)</i>, 306–10. EUROSIS-ETI, 2008.","ieee":"C. Laroque, M. Fischer, W. Dangelmaier, and B. Eikel, “Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations,” in <i>Industrial Simulation Conference (ISC 2008)</i>, 2008, pp. 306–310.","ama":"Laroque C, Fischer M, Dangelmaier W, Eikel B. Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations. In: <i>Industrial Simulation Conference (ISC 2008)</i>. EUROSIS-ETI; 2008:306-310."},"year":"2008","title":"Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations","author":[{"last_name":"Laroque","full_name":"Laroque, Christoph","first_name":"Christoph"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"},{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"}],"date_created":"2020-08-24T07:49:59Z","publisher":"EUROSIS-ETI","date_updated":"2022-01-06T06:53:26Z"}]