[{"doi":"10.1007/978-3-642-18381-2_15","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","title":"Collisionless Gathering of Robots with an Extent","year":"2011","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642183805","9783642183812"]},"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","last_name":"Degener","first_name":"Bastian"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"last_name":"Kempkes","first_name":"Barbara","full_name":"Kempkes, Barbara"},{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"full_name":"Märtens, Marcus","last_name":"Märtens","first_name":"Marcus"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, 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"},{"first_name":"Daniel","last_name":"Wonisch","full_name":"Wonisch, Daniel"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-06T07:52:42Z","abstract":[{"lang":"eng","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."}],"issue":"6543","publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","user_id":"15415","page":"178-189","publisher":"Springer","_id":"16410","status":"public","citation":{"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>.","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} }","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.","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>","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.","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>."}},{"title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","year":"2011","status":"public","publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"last_name":"Degener","first_name":"Bastian","full_name":"Degener, Bastian"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Hüllmann","first_name":"Martina","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","last_name":"Kempkes","first_name":"Barbara"},{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"first_name":"Peter","last_name":"Kling","full_name":"Kling, Peter"},{"last_name":"Kurras","first_name":"Sven","full_name":"Kurras, Sven"},{"full_name":"Märtens, Marcus","last_name":"Märtens","first_name":"Marcus"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Christoph","last_name":"Raupach","full_name":"Raupach, Christoph"},{"last_name":"Swierkot","first_name":"Kamil","full_name":"Swierkot, Kamil"},{"first_name":"Daniel","last_name":"Warner","full_name":"Warner, Daniel"},{"full_name":"Weddemann, Christoph","last_name":"Weddemann","first_name":"Christoph"},{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"}],"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","_id":"16409","language":[{"iso":"eng"}],"doi":"10.1007/978-3-642-22012-8_52","user_id":"15415","publication":"Automata, Languages and Programming","citation":{"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>.","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>","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} }","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>","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.","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.","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>."},"abstract":[{"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","lang":"eng"}],"place":"Berlin, Heidelberg","date_created":"2020-04-06T07:47:55Z","type":"book_chapter","department":[{"_id":"63"}]},{"type":"conference","department":[{"_id":"671"}],"date_created":"2021-10-16T22:43:30Z","publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011","citation":{"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>.","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.","ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” 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.","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.","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011, 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 - ESM’2011}, author={Renken, Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }"},"user_id":"71124","_id":"26384","language":[{"iso":"eng"}],"date_updated":"2022-01-25T18:15:43Z","publication_status":"published","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","year":"2011","status":"public","author":[{"full_name":"Renken, Hendrik","first_name":"Hendrik","last_name":"Renken"},{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"}]},{"department":[{"_id":"671"}],"type":"conference","date_created":"2021-10-16T22:54:06Z","citation":{"short":"A. Klaas, C. Laroque, M. Fischer, W. Dangelmaier, in: Proceedings of the 2011 Winter Simulation Conference, 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.","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.","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.","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} }","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."},"publication":"Proceedings of the 2011 Winter Simulation Conference","user_id":"71124","_id":"26387","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-25T18:16:03Z","author":[{"first_name":"Alexander ","last_name":"Klaas","full_name":"Klaas, Alexander "},{"last_name":"Laroque","first_name":"Christoph ","full_name":"Laroque, Christoph "},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"}],"title":"Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse","status":"public","year":"2011"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-07-27T19:33:16Z","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."}],"publication":"Proceedings of the 2010 Winter Simulation Conference","citation":{"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} }","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>","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.","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>","short":"M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings of the 2010 Winter Simulation Conference, 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>."},"doi":"10.1109/wsc.2010.5678906","user_id":"15415","_id":"17422","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:11Z","publication_status":"published","year":"2010","title":"Automated 3D-motion planning for ramps and stairs in intra-logistics material flow simulations","status":"public","publication_identifier":{"isbn":["9781424498666"]},"author":[{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"full_name":"Renken, Hendrik","first_name":"Hendrik","last_name":"Renken"},{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"full_name":"Schaumann, Guido","last_name":"Schaumann","first_name":"Guido"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"}]},{"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"}],"publication":"Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)","citation":{"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} }","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>","short":"M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.","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>.","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>","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>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T07:07:55Z","date_updated":"2022-01-06T06:53:26Z","year":"2010","title":"Asynchronous Parallel Reliefboard Computation for Scene Object Approximation","status":"public","author":[{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"}],"doi":"10.2312/EGPGV/EGPGV10/043-051","user_id":"15415","page":"43-51","_id":"18136","language":[{"iso":"eng"}],"publisher":"The Eurographics Association"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-08-25T14:04:38Z","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."}],"citation":{"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} }","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>","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>.","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>","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>."},"publication":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","user_id":"15415","doi":"10.1109/nas.2010.52","_id":"18289","language":[{"iso":"eng"}],"page":"448 - 456","publication_status":"published","date_updated":"2022-01-06T06:53:28Z","publication_identifier":{"isbn":["9781424481330"]},"author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"first_name":"Timo","last_name":"Wiesemann","full_name":"Wiesemann, Timo"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"}],"status":"public","title":"Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments","year":"2010"},{"date_updated":"2022-01-06T06:53:28Z","status":"public","title":"Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems","year":"2010","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"full_name":"Wiesemann, Timo","first_name":"Timo","last_name":"Wiesemann"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"}],"user_id":"15415","page":"39-52","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18290","language":[{"iso":"eng"}],"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"}],"publication":"Augmented & Virtual Reality in der Produktentstehung","citation":{"short":"T. Suess, T. Wiesemann, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, 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.","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.","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.","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} }","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."},"type":"book_chapter","department":[{"_id":"63"}],"date_created":"2020-08-25T14:14:36Z"},{"department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-04-14T13:06:51Z","place":"Berlin, Heidelberg","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"}],"citation":{"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>.","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","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>","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} }","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>.","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>","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."},"publication":"Advances in Visual Computing","user_id":"15415","doi":"10.1007/978-3-642-17289-2_60","_id":"16505","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2022-01-06T06:52:52Z","publication_identifier":{"isbn":["9783642172885","9783642172892"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Eikel","first_name":"Benjamin","full_name":"Eikel, Benjamin"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"}],"title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","year":"2010","status":"public"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T07:28:23Z","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."}],"publication":"European Simulation and Modelling Conference (ESM 2009)","citation":{"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} }","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.","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.","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.","short":"C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling Conference (ESM 2009), EUROSIS-ETI, 2009.","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.","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."},"user_id":"15415","_id":"18138","publisher":"EUROSIS-ETI","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:26Z","status":"public","year":"2009","title":"Concepts for Model Verification and Validation during Simulation Runtime","author":[{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"}]},{"department":[{"_id":"63"},{"_id":"26"}],"type":"book_chapter","date_created":"2020-08-25T14:25:41Z","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.","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.","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.","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.","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} }","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."},"publication":"Augmented & Virtual Reality in der Produktentstehung","volume":252,"user_id":"5786","language":[{"iso":"eng"}],"_id":"18291","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"111--126","intvolume":"       252","date_updated":"2022-01-06T06:53:28Z","author":[{"full_name":"Suess, Tim","first_name":"Tim","last_name":"Suess"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"last_name":"Huber","first_name":"Daniel","full_name":"Huber, Daniel"},{"full_name":"Laroque, Christoph ","first_name":"Christoph ","last_name":"Laroque"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"}],"status":"public","title":"Ein System zur aggregierten Visualisierung verteilter Materialflusssimulationen","year":"2009"},{"user_id":"15415","page":"203-206","_id":"18346","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:29Z","status":"public","title":"Planar Visibility Counting","year":"2009","author":[{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"full_name":"Hilbig, Matthias","first_name":"Matthias","last_name":"Hilbig"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide"},{"full_name":"Ziegler, Martin","last_name":"Ziegler","first_name":"Martin"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-26T08:49:50Z","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"}],"publication":"Proc. 25th European Workshop on Computational Geometry","citation":{"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} }","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.","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” <i>Proc. 25th European Workshop on Computational Geometry</i>, 2009, pp. 203–06.","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.","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.","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)."}},{"date_updated":"2022-01-06T06:53:11Z","publication_status":"published","year":"2008","status":"public","title":"A System for Aggregated Visualization of Multiple Parallel Discrete Event Simulations","publication_identifier":{"isbn":["9780769534718"]},"author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"last_name":"Huber","first_name":"Daniel","full_name":"Huber, Daniel"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Laroque, Christoph","last_name":"Laroque","first_name":"Christoph"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"}],"doi":"10.1109/ispa.2008.30","user_id":"15415","_id":"17416","language":[{"iso":"eng"}],"abstract":[{"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","lang":"eng"}],"publication":"IEEE International Symposium on Parallel and Distributed Processing with Applications","citation":{"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>.","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} }","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>","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>.","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>","short":"T. Suess, D. Huber, M. Fischer, C. Laroque, W. Dangelmaier, in: IEEE International Symposium on Parallel and Distributed Processing with Applications, 2008.","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>."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-07-27T12:56:15Z"},{"abstract":[{"lang":"eng","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. "}],"citation":{"short":"W. Dangelmaier, M. Fischer, D. Huber, C. Laroque, T. Suess, in: 2008 Winter Simulation Conference, Miami, FL., USA, 2008, pp. 2012–2020.","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>.","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>","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>.","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>","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>."},"publication":"2008 Winter Simulation Conference","department":[{"_id":"63"}],"type":"conference","place":"Miami, FL., USA","date_created":"2020-08-12T13:39:37Z","date_updated":"2022-01-06T06:53:22Z","publication_status":"published","author":[{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, 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","first_name":"Christoph","full_name":"Laroque, Christoph"},{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"}],"publication_identifier":{"isbn":["9781424427079"]},"status":"public","title":"Aggregated 3D-visualization of a distributed simulation experiment of a queuing system","year":"2008","doi":"10.1109/wsc.2008.4736296","user_id":"15415","_id":"17868","language":[{"iso":"eng"}],"page":"2012-2020"},{"date_updated":"2022-01-06T06:53:26Z","title":"Dynamic Control of Animation Schemes for the Efficient 3D-Visualization of Material Flow Simulations","year":"2008","status":"public","author":[{"first_name":"Christoph","last_name":"Laroque","full_name":"Laroque, Christoph"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":"Dangelmaier"},{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"}],"user_id":"15415","page":"306-310","language":[{"iso":"eng"}],"_id":"18139","publisher":"EUROSIS-ETI","abstract":[{"lang":"eng","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. "}],"publication":"Industrial Simulation Conference (ISC 2008)","citation":{"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.","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.","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.","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.","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."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T07:49:59Z"},{"type":"conference","department":[{"_id":"63"},{"_id":"26"}],"date_created":"2020-08-24T07:56:43Z","abstract":[{"lang":"ger","text":"Dieser Artikel beschreibt eine Methode zur Animation einer großen Anzahl von Objekten zur dynamischen 3D-Visualisierung eines Simulationsmodells mittels der Materialflusssimulation auf Basis von Schlüsselbildern. Die Anzahl zu animierender Objekte ist in komplexen Modellen zu groß, um alle Animationen flüssig darzustellen. Dynamisch abgestuft wählt das entwickelte Verfahren gezielt wichtige Animationen aus, weniger relevante Animationen werden entsprechend seltener animiert. Die Selektion der Animationen erfolgt nach der projizierten Größe der Objekte auf das Ausgabegerät, um einen guten optischen Eindruck beizubehalten. Angepasst an die Leistungsfähigkeit des Rechners wird das Verfahren so geregelt, dass die Visualisierung einer hohen Anzahl von Objekten in Echtzeit möglich bleibt. Das Verfahren ist in einem Editor prototypisch implementiert, mit dem Schlüsselbilder für Objekte erzeugt werden können. Das Gruppieren von Objekten wird erlaubt, so dass eine Hierarchie von Bewegungspfaden definierbar ist. Die Evaluierung der Methode wird mittels Testszenen durchgeführt, die aus mehreren zehntausend animierten Objekten bestehen."}],"publication":"Augmented & Virtual Reality in der Produktentstehung","citation":{"mla":"Laroque, Christoph, et al. “Regelung von Animationen in Simulationen von  Hochdynamischen Fabrikszenen .” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 232, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 193--206.","apa":"Laroque, C., Fischer, M., &#38; Eikel, B. (2008). Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen . <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>232</i>, 193--206.","ieee":"C. Laroque, M. Fischer, and B. Eikel, “Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen ,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2008, vol. 232, pp. 193--206.","ama":"Laroque C, Fischer M, Eikel B. Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen . In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 232. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2008:193--206.","short":"C. Laroque, M. Fischer, B. Eikel, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008, pp. 193--206.","chicago":"Laroque, Christoph, Matthias Fischer, and Benjamin Eikel. “Regelung von Animationen in Simulationen von  Hochdynamischen Fabrikszenen .” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 232:193--206. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2008.","bibtex":"@inproceedings{Laroque_Fischer_Eikel_2008, title={Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen }, volume={232}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Laroque, Christoph and Fischer, Matthias and Eikel, Benjamin}, year={2008}, pages={193--206} }"},"user_id":"5786","volume":232,"page":"193--206","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18141","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:53:26Z","intvolume":"       232","status":"public","year":"2008","title":"Regelung von Animationen in Simulationen von  hochdynamischen Fabrikszenen ","author":[{"full_name":"Laroque, Christoph","last_name":"Laroque","first_name":"Christoph"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"}]},{"date_updated":"2022-01-06T06:52:50Z","status":"public","title":"Planar Visibility Counting","year":"2008","author":[{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"last_name":"Hilbig","first_name":"Matthias","full_name":"Hilbig, Matthias"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Ziegler","first_name":"Martin","full_name":"Ziegler, Martin"}],"user_id":"15415","_id":"16465","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"publication":"arXiv:0810.0052","citation":{"bibtex":"@article{Fischer_Hilbig_Jähn_Meyer auf der Heide_Ziegler_2008, title={Planar Visibility Counting}, journal={arXiv:0810.0052}, author={Fischer, Matthias and Hilbig, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Ziegler, Martin}, year={2008} }","ama":"Fischer M, Hilbig M, Jähn C, Meyer auf der Heide F, Ziegler M. Planar Visibility Counting. <i>arXiv:08100052</i>. 2008.","short":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, M. Ziegler, ArXiv:0810.0052 (2008).","chicago":"Fischer, Matthias, Matthias Hilbig, Claudius Jähn, Friedhelm Meyer auf der Heide, and Martin Ziegler. “Planar Visibility Counting.” <i>ArXiv:0810.0052</i>, 2008.","ieee":"M. Fischer, M. Hilbig, C. Jähn, F. Meyer auf der Heide, and M. Ziegler, “Planar Visibility Counting,” <i>arXiv:0810.0052</i>. 2008.","apa":"Fischer, M., Hilbig, M., Jähn, C., Meyer auf der Heide, F., &#38; Ziegler, M. (2008). Planar Visibility Counting. <i>ArXiv:0810.0052</i>.","mla":"Fischer, Matthias, et al. “Planar Visibility Counting.” <i>ArXiv:0810.0052</i>, 2008."},"type":"preprint","department":[{"_id":"63"}],"external_id":{"arxiv":["0810.0052"]},"date_created":"2020-04-08T08:41:52Z"},{"citation":{"short":"M. Fischer, C. Laroque, D. Huber, J. Krokowski, B. Mueck, M. Kortenjan, M. Aufenanger, W.  Dangelmaier, in: European Simulation and Modelling Conference (ESM 2007), 2007, pp. 499--505.","chicago":"Fischer, Matthias, Christoph  Laroque, Daniel  Huber, Jens  Krokowski, Bengt  Mueck, Michael  Kortenjan, Mark Aufenanger, and Wilhelm  Dangelmaier. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” In <i>European Simulation and Modelling Conference (ESM 2007)</i>, 499--505, 2007.","apa":"Fischer, M., Laroque, C., Huber, D., Krokowski, J., Mueck, B., Kortenjan, M., …  Dangelmaier, W. (2007). Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In <i>European Simulation and Modelling Conference (ESM 2007)</i> (pp. 499--505).","ieee":"M. Fischer <i>et al.</i>, “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment,” in <i>European Simulation and Modelling Conference (ESM 2007)</i>, 2007, pp. 499--505.","ama":"Fischer M, Laroque C, Huber D, et al. Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment. In: <i>European Simulation and Modelling Conference (ESM 2007)</i>. ; 2007:499--505.","bibtex":"@inproceedings{Fischer_Laroque_Huber_Krokowski_Mueck_Kortenjan_Aufenanger_ Dangelmaier_2007, title={Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment}, booktitle={European Simulation and Modelling Conference (ESM 2007)}, author={Fischer, Matthias and Laroque, Christoph  and Huber, Daniel  and Krokowski, Jens  and Mueck, Bengt  and Kortenjan, Michael  and Aufenanger, Mark and  Dangelmaier, Wilhelm}, year={2007}, pages={499--505} }","mla":"Fischer, Matthias, et al. “Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in One 3D Environment.” <i>European Simulation and Modelling Conference (ESM 2007)</i>, 2007, pp. 499--505."},"file_date_updated":"2020-08-26T09:22:47Z","publication":"European Simulation and Modelling Conference (ESM 2007)","abstract":[{"text":"The validation of material flow models as well as the selection of promising strategies for the generation of a successful experiment plan is a time-consuming process. A new approach is presented, which supports the simulation expert in his working process by giving him the opportunity to modify the simulated simulation run and afterwards compare the effects of his modification with the original setting, online and in one user interface, implemented by switching the visualizations between the simulation runs or opening up to 5 parallel 3D windows. The method developed therefore clones existing simulation runs online and allows the navigation within these existing simulation runs. The method has been implemented and is validated by a test model, which describes in detail the new working process of a modeler. New research questions are derived from this work, which will define following working steps.\r\n","lang":"eng"}],"date_created":"2020-08-26T09:23:24Z","file":[{"access_level":"closed","file_size":389588,"file_name":"ESM07_final.pdf","date_updated":"2020-08-26T09:22:47Z","relation":"main_file","success":1,"content_type":"application/pdf","file_id":"18348","creator":"koala","date_created":"2020-08-26T09:22:47Z"}],"department":[{"_id":"63"}],"type":"conference","author":[{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"last_name":"Laroque","first_name":"Christoph ","full_name":"Laroque, Christoph "},{"first_name":"Daniel ","last_name":"Huber","full_name":"Huber, Daniel "},{"last_name":"Krokowski","first_name":"Jens ","full_name":"Krokowski, Jens "},{"full_name":"Mueck, Bengt ","last_name":"Mueck","first_name":"Bengt "},{"first_name":"Michael ","last_name":"Kortenjan","full_name":"Kortenjan, Michael "},{"first_name":"Mark","last_name":"Aufenanger","full_name":"Aufenanger, Mark"},{"full_name":" Dangelmaier, Wilhelm","first_name":"Wilhelm","last_name":" Dangelmaier"}],"status":"public","title":"Interactive Refinement of a Material Flow Simulation Model by Comparing Multiple Simulation Runs in one 3D Environment","year":"2007","has_accepted_license":"1","date_updated":"2022-01-06T06:53:29Z","_id":"18347","language":[{"iso":"eng"}],"page":"499--505","user_id":"15415","ddc":["004"]},{"publication":"Augmented & Virtual Reality in der Produktentstehung","citation":{"bibtex":"@inproceedings{Dangelmaier_ Laroque_Fischer_2007, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik}, volume={209}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Dangelmaier, Wilhelm and  Laroque, Christoph  and Fischer, Matthias}, year={2007}, pages={95–110}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","ama":"Dangelmaier W,  Laroque C, Fischer M. Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. In: <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 209. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2007:95-110.","mla":"Dangelmaier, Wilhelm, et al. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 209, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110.","chicago":"Dangelmaier, Wilhelm, Christoph   Laroque, and Matthias Fischer. “Ein Ganzheitlicher Ansatz Zur Immersiven 3D-Materialflusssimulation Innerhalb Der Digitalen Fabrik.” In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 209:95–110. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007.","short":"W. Dangelmaier, C.  Laroque, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2007, pp. 95–110.","ieee":"W. Dangelmaier, C.  Laroque, and M. Fischer, “Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik,” in <i>Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2007, vol. 209, pp. 95–110.","apa":"Dangelmaier, W.,  Laroque, C., &#38; Fischer, M. (2007). Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik. <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>209</i>, 95–110."},"date_created":"2020-08-26T09:30:58Z","type":"conference","department":[{"_id":"63"},{"_id":"26"}],"year":"2007","title":"Ein ganzheitlicher Ansatz zur immersiven 3D-Materialflusssimulation innerhalb der Digitalen Fabrik","status":"public","author":[{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"},{"full_name":" Laroque, Christoph ","last_name":" Laroque","first_name":"Christoph "},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"}],"date_updated":"2022-01-06T06:53:29Z","intvolume":"       209","page":"95-110","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18349","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","language":[{"iso":"eng"}],"user_id":"5786","volume":209},{"place":"Buenos Aires, Argentina","date_created":"2019-02-21T11:56:39Z","department":[{"_id":"66"},{"_id":"600"},{"_id":"63"}],"type":"conference","citation":{"chicago":"Arens, Stephan, Alexander Buss, Helena Deck, Miroslaw Dynia, Matthias Fischer, Holger Hagedorn, Peter Isaak, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 215–22. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn, 2007.","short":"S. Arens, A. Buss, H. Deck, M. Dynia, M. Fischer, H. Hagedorn, P. Isaak, J. Kutylowski, F. Meyer auf der Heide, V. Nesterow, A. Ogiermann, B. Stobbe, T. Storm, H. Wachsmuth, in: Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment, Heinz Nixdorf Institut, University of Paderborn, Buenos Aires, Argentina, 2007, pp. 215–222.","ieee":"S. Arens <i>et al.</i>, “Smart Teams: Simulating Large Robotic Swarms in Vast Environments,” in <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, 2007, pp. 215–222.","apa":"Arens, S., Buss, A., Deck, H., Dynia, M., Fischer, M., Hagedorn, H., … Wachsmuth, H. (2007). Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i> (pp. 215–222). Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn.","bibtex":"@inproceedings{Arens_Buss_Deck_Dynia_Fischer_Hagedorn_Isaak_Kutylowski_Meyer auf der Heide_Nesterow_et al._2007, place={Buenos Aires, Argentina}, title={Smart Teams: Simulating Large Robotic Swarms in Vast Environments}, booktitle={Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment}, publisher={Heinz Nixdorf Institut, University of Paderborn}, author={Arens, Stephan and Buss, Alexander and Deck, Helena and Dynia, Miroslaw and Fischer, Matthias and Hagedorn, Holger and Isaak, Peter and Kutylowski, Jaroslaw and Meyer auf der Heide, Friedhelm and Nesterow, Viktor and et al.}, year={2007}, pages={215–222} }","ama":"Arens S, Buss A, Deck H, et al. Smart Teams: Simulating Large Robotic Swarms in Vast Environments. In: <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>. Buenos Aires, Argentina: Heinz Nixdorf Institut, University of Paderborn; 2007:215-222.","mla":"Arens, Stephan, et al. “Smart Teams: Simulating Large Robotic Swarms in Vast Environments.” <i>Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment</i>, Heinz Nixdorf Institut, University of Paderborn, 2007, pp. 215–22."},"publication":"Proceedings of the 4th International Symposium on Autonomous Minirobots for Research and Edutainment","abstract":[{"lang":"eng","text":"We consider the problem of exploring an unknown environment using a swarm of autonomous robots with collective behavior emerging from their local rules. Each robot has only a very restricted view on the environment which makes cooperation difficult. We introduce a software system which is capable of simulating a large number of such robots (e.g. 1000) on highly complex terrains with millions of obstacles. Its main purpose is to easily integrate and evaluate any kind of algorithm for controlling the robot behavior. The simulation may be observed in real-time via a visualization that displays both the individual and the collective progress of the robots. We present the system design, its main features and underlying concepts."}],"publisher":"Heinz Nixdorf Institut, University of Paderborn","_id":"7970","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://webis.de/downloads/publications/papers/arens_2007.pdf"}],"page":"215-222","user_id":"15415","author":[{"full_name":"Arens, Stephan","last_name":"Arens","first_name":"Stephan"},{"first_name":"Alexander","last_name":"Buss","full_name":"Buss, Alexander"},{"full_name":"Deck, Helena","first_name":"Helena","last_name":"Deck"},{"first_name":"Miroslaw","last_name":"Dynia","full_name":"Dynia, Miroslaw"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"},{"last_name":"Hagedorn","first_name":"Holger","full_name":"Hagedorn, Holger"},{"first_name":"Peter","last_name":"Isaak","full_name":"Isaak, Peter"},{"full_name":"Kutylowski, Jaroslaw","last_name":"Kutylowski","first_name":"Jaroslaw"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"full_name":"Nesterow, Viktor","first_name":"Viktor","last_name":"Nesterow"},{"last_name":"Ogiermann","first_name":"Adrian","full_name":"Ogiermann, Adrian"},{"first_name":"Boris","last_name":"Stobbe","full_name":"Stobbe, Boris"},{"full_name":"Storm, Thomas","last_name":"Storm","first_name":"Thomas"},{"id":"3900","last_name":"Wachsmuth","first_name":"Henning","full_name":"Wachsmuth, Henning"}],"status":"public","year":"2007","title":"Smart Teams: Simulating Large Robotic Swarms in Vast Environments","date_updated":"2022-01-06T07:03:48Z"}]