[{"author":[{"full_name":"Petring, Ralf","last_name":"Petring","first_name":"Ralf"},{"full_name":"Eikel, Benjamin","first_name":"Benjamin","last_name":"Eikel"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"year":"2013","title":"Darstellung heterogener 3-D-Szenen in Echtzeit","status":"public","intvolume":"       311","date_updated":"2022-01-06T06:53:12Z","language":[{"iso":"eng"}],"_id":"17439","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","page":"49--60","volume":311,"user_id":"15415","citation":{"short":"R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Paderborn, 2013, pp. 49--60.","chicago":"Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013.","apa":"Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 311, pp. 49--60). Paderborn.","ieee":"R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung heterogener 3-D-Szenen in Echtzeit,” in <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2013, vol. 311, pp. 49--60.","ama":"Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Darstellung heterogener 3-D-Szenen in Echtzeit. In: <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.","bibtex":"@inproceedings{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Paderborn}, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Darstellung heterogener 3-D-Szenen in Echtzeit}, volume={311}, booktitle={11. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, author={Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013}, pages={49--60}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts} }","mla":"Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” <i>11. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 311, 2013, pp. 49--60."},"publication":"11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","abstract":[{"lang":"eng","text":"Viele virtuelle 3-D-Szenen im industriellen Bereich sind nicht gleichmäßig strukturiert, z.B. weil sie eine stark unterschiedliche Dichteverteilung der Polygone aufweisen. Für solch heterogene Daten existiert kein Algorithmus, der die Gesamtheit der Daten sowohl schnell als auch mit guter Qualität darstellen kann. Die Auswahl der richtigen Algorithmen für einzelne Szenenteile durch einen Experten ist zeitintensiv und in vielen Visualisierungssystemen nicht umzusetzen. Um dieses Problem zu lösen, setzt das hier vorgestellte Multi-Algorithmen-Rendering verschiedene Renderingalgorithmen gleichzeitig ein, um eine virtuelle 3-D-Szene darzustellen. Das Verfahren unterteilt die Szene dafür in einem Vorverarbeitungsschritt automatisch in geeignete Teilregionen und bestimmt deren Eigenschaften. Diese Daten werden zur Laufzeit dazu genutzt, um ständig für den aktuellen Standpunkt des Betrachters eine Abschätzung der Qualität und Laufzeit der zur Auswahl stehenden Renderingalgorithmen zu berechnen. Durch die Lösung eines Optimierungsproblems kann so bei vorgegebener Bildrate durch die passende Zuordnung der Algorithmen zu den Regionen die Bildqualität optimiert werden – bei automatischer Anpassung an die Leistungsfähigkeit der eingesetzten Hardware. In einer experimentellen Evaluierung vergleichen wir die Laufzeit und Bildqualität des Verfahrens mit denen verbreiteter Standardrenderingverfahren."}],"place":"Paderborn","date_created":"2020-07-29T08:55:43Z","department":[{"_id":"63"}],"type":"conference"},{"department":[{"_id":"63"}],"type":"conference","date_created":"2020-04-03T07:48:48Z","abstract":[{"lang":"eng","text":"Many 3D scenes (e.g. generated from CAD data) are composed of a multitude of objects that are nested in each other. A showroom, for instance, may contain multiple cars and every car has a gearbox with many gearwheels located inside. Because the objects occlude each other, only few are visible from outside. We present a new technique, Spherical Visibility Sampling (SVS), for real-time 3D rendering of such -- possibly highly complex -- scenes. SVS exploits the occlusion and annotates hierarchically structured objects with directional visibility information in a preprocessing step. For different directions, the directional visibility encodes which objects of a scene's region are visible from the outside of the regions' enclosing bounding sphere. Since there is no need to store a separate view space subdivision as in most techniques based on preprocessed visibility, a small memory footprint is achieved. Using the directional visibility information for an interactive walkthrough, the potentially visible objects can be retrieved very efficiently without the need for further visibility tests. Our evaluation shows that using SVS allows to preprocess complex 3D scenes fast and to visualize them in real time (e.g. a Power Plant model and five animated Boeing 777 models with billions of triangles). Because SVS does not require hardware support for occlusion culling during rendering, it is even applicable for rendering large scenes on mobile devices."}],"issue":"4","publication":"Computer Graphics Forum","doi":"10.1111/cgf.12150","language":[{"iso":"eng"}],"series_title":"Proceedings of the 24th Eurographics Symposium on Rendering","intvolume":"        32","publication_status":"published","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"},{"full_name":"Jähn, Claudius","first_name":"Claudius","last_name":"Jähn"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"issn":["0167-7055"]},"year":"2013","title":"Spherical Visibility Sampling","citation":{"apa":"Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Spherical Visibility Sampling. In <i>Computer Graphics Forum</i> (Vol. 32, pp. 49–58). <a href=\"https://doi.org/10.1111/cgf.12150\">https://doi.org/10.1111/cgf.12150</a>","mla":"Eikel, Benjamin, et al. “Spherical Visibility Sampling.” <i>Computer Graphics Forum</i>, vol. 32, no. 4, 2013, pp. 49–58, doi:<a href=\"https://doi.org/10.1111/cgf.12150\">10.1111/cgf.12150</a>.","ieee":"B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Spherical Visibility Sampling,” in <i>Computer Graphics Forum</i>, 2013, vol. 32, no. 4, pp. 49–58.","ama":"Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Spherical Visibility Sampling. In: <i>Computer Graphics Forum</i>. Vol 32. Proceedings of the 24th Eurographics Symposium on Rendering. ; 2013:49-58. doi:<a href=\"https://doi.org/10.1111/cgf.12150\">10.1111/cgf.12150</a>","short":"B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Computer Graphics Forum, 2013, pp. 49–58.","chicago":"Eikel, Benjamin, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Spherical Visibility Sampling.” In <i>Computer Graphics Forum</i>, 32:49–58. Proceedings of the 24th Eurographics Symposium on Rendering, 2013. <a href=\"https://doi.org/10.1111/cgf.12150\">https://doi.org/10.1111/cgf.12150</a>.","bibtex":"@inproceedings{Eikel_Jähn_Fischer_Meyer auf der Heide_2013, series={Proceedings of the 24th Eurographics Symposium on Rendering}, title={Spherical Visibility Sampling}, volume={32}, DOI={<a href=\"https://doi.org/10.1111/cgf.12150\">10.1111/cgf.12150</a>}, number={4}, booktitle={Computer Graphics Forum}, author={Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013}, pages={49–58}, collection={Proceedings of the 24th Eurographics Symposium on Rendering} }"},"volume":32,"user_id":"15415","_id":"16393","page":"49-58","status":"public"},{"language":[{"iso":"eng"}],"_id":"16406","user_id":"15415","doi":"10.1007/978-3-642-41914-0_12","year":"2013","title":"Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties","status":"public","publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642419133","9783642419140"]},"author":[{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"last_name":"Petring","first_name":"Ralf","full_name":"Petring, Ralf"},{"id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_status":"published","date_updated":"2022-01-06T06:52:50Z","date_created":"2020-04-06T07:21:55Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Advances in Visual Computing","citation":{"mla":"Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” <i>Advances in Visual Computing</i>, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>.","bibtex":"@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin, Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>}, booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013} }","ama":"Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">10.1007/978-3-642-41914-0_12</a>","ieee":"C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2013.","apa":"Jähn, C., Eikel, B., Fischer, M., Petring, R., &#38; Meyer auf der Heide, F. (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">https://doi.org/10.1007/978-3-642-41914-0_12</a>","chicago":"Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_12\">https://doi.org/10.1007/978-3-642-41914-0_12</a>.","short":"C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2013."},"abstract":[{"text":"In order to evaluate the efficiency of algorithms for real-time 3D rendering, different properties like rendering time, occluded triangles, or image quality, need to be investigated. Since these properties depend on the position of the camera, usually some camera path is chosen, along which the measurements are performed. As those measurements cover only a small part of the scene, this approach hardly allows drawing conclusions regarding the algorithm's properties at arbitrary positions in the scene. The presented method allows the systematic and position-independent evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate the distribution of a property (like rendering time) for all positions in the scene. This approximation can be visualized to produce an intuitive impression of the algorithm's behavior or be statistically analyzed for objectively rating and comparing algorithms. We demonstrate our method by evaluating performance aspects of a known occlusion culling algorithm.\r\n","lang":"eng"}]},{"date_created":"2020-04-06T07:38:52Z","place":"Berlin, Heidelberg","type":"book_chapter","department":[{"_id":"63"}],"publication":"Advances in Visual Computing","citation":{"chicago":"Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">https://doi.org/10.1007/978-3-642-41914-0_44</a>.","short":"R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2013.","apa":"Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">https://doi.org/10.1007/978-3-642-41914-0_44</a>","ieee":"R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time 3D Rendering of Heterogeneous Scenes,” in <i>Advances in Visual Computing</i>, Berlin, Heidelberg, 2013.","ama":"Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Real-Time 3D Rendering of Heterogeneous Scenes. In: <i>Advances in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>","bibtex":"@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin, Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>}, booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013} }","mla":"Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” <i>Advances in Visual Computing</i>, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-41914-0_44\">10.1007/978-3-642-41914-0_44</a>."},"abstract":[{"text":"Many virtual 3D scenes, especially those that are large, are not structured evenly. For such heterogeneous data, there is no single algorithm that is able to render every scene type at each position fast and with the same high image quality. For a small set of scenes, this situation can be improved if different rendering algorithms are manually assigned to particular parts of the scene by an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically deploys different rendering algorithms simultaneously for a broad range of scene types. The method divides the scene into subregions and measures the behavior of different algorithms for each region in a preprocessing step. During runtime, this data is utilized to compute an estimate for the quality and running time of the available rendering algorithms from the observer's point of view. By solving an optimizing problem, the image quality can be optimized by an assignment of algorithms to regions while keeping the frame rate almost constant.\r\n","lang":"eng"}],"_id":"16407","language":[{"iso":"eng"}],"user_id":"15415","doi":"10.1007/978-3-642-41914-0_44","year":"2013","title":"Real-Time 3D Rendering of Heterogeneous Scenes","status":"public","author":[{"last_name":"Petring","first_name":"Ralf","full_name":"Petring, Ralf"},{"full_name":"Eikel, Benjamin","last_name":"Eikel","first_name":"Benjamin"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Meyer auf der Heide, Friedhelm","first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523"}],"publication_identifier":{"isbn":["9783642419133","9783642419140"],"issn":["0302-9743","1611-3349"]},"publication_status":"published","date_updated":"2022-01-06T06:52:50Z"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-06T07:40:57Z","abstract":[{"text":"We present a parallel rendering system for heterogeneous PC clusters to visualize massive models. One single, powerful visualization node is supported by a group of backend nodes with weak graphics performance. While the visualization node renders the visible objects, the backend nodes asynchronously perform visibility tests and supply the front end with visible scene objects. The visualization node stores only currently visible objects in its memory, while the scene is distributed among the backend nodes’ memory without redundancy. To efficiently compute the occlusion tests in spite of that each backend node stores only a fraction of the original geometry, we complete the scene by adding highly simplified versions of the objects stored on other nodes. We test our system with 15 backend nodes. It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with 20, to 30,fps and thus allows a walk-through in real-time.\r\n","lang":"eng"}],"publication":"Advances in Visual Computing","doi":"10.1007/978-3-642-33179-4_48","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","intvolume":"      7431","title":"Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes","year":"2012","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"first_name":"Clemens","last_name":"Koch","full_name":"Koch, Clemens"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"}],"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783642331787","9783642331794"]},"place":"Berlin, Heidelberg","citation":{"bibtex":"@inproceedings{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2012, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}, volume={7431}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>}, booktitle={Advances in Visual Computing}, author={Suess, Tim and Koch, Clemens and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2012}, pages={502–512}, collection={Lecture Notes in Computer Science} }","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: <i>Advances in Visual Computing</i>. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512. doi:<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>","mla":"Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” <i>Advances in Visual Computing</i>, vol. 7431, 2012, pp. 502–12, doi:<a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>.","short":"T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances in Visual Computing, Berlin, Heidelberg, 2012, pp. 502–512.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes.” In <i>Advances in Visual Computing</i>, 7431:502–12. Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">https://doi.org/10.1007/978-3-642-33179-4_48</a>.","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,” in <i>Advances in Visual Computing</i>, 2012, vol. 7431, pp. 502–512, doi: <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">10.1007/978-3-642-33179-4_48</a>.","apa":"Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2012). Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. <i>Advances in Visual Computing</i>, <i>7431</i>, 502–512. <a href=\"https://doi.org/10.1007/978-3-642-33179-4_48\">https://doi.org/10.1007/978-3-642-33179-4_48</a>"},"user_id":"15415","volume":7431,"page":"502-512","_id":"16408","status":"public"},{"publisher":"Canadian Human-Computer Communications Society","_id":"17420","language":[{"iso":"eng"}],"page":"79--86","editor":[{"full_name":"Brooks, Stephen","first_name":"Stephen","last_name":"Brooks"},{"full_name":"Irani, Pourang","last_name":"Irani","first_name":"Pourang"}],"user_id":"15415","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"last_name":"Koch","first_name":"Clemens","full_name":"Koch, Clemens"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"}],"year":"2011","title":"Approximative occlusion culling using the hull tree","status":"public","date_updated":"2022-01-06T06:53:11Z","date_created":"2020-07-27T19:17:03Z","department":[{"_id":"63"}],"type":"conference","citation":{"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.","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.","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.","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.","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.","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} }"},"publication":"Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John's, Newfoundland, Canada","abstract":[{"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","lang":"eng"}]},{"citation":{"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>.","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>","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} }","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>","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.","short":"A. Klaas, C. Laroque, W. Dangelmaier, M. Fischer, in: Proceedings of the 2011 Winter Simulation Conference (WSC), 2011.","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>."},"publication":"Proceedings of the 2011 Winter Simulation Conference (WSC)","date_created":"2020-07-27T19:21:18Z","department":[{"_id":"63"}],"type":"conference","publication_identifier":{"isbn":["9781457721090","9781457721083","9781457721069","9781457721076"]},"author":[{"last_name":"Klaas","first_name":"Alexander","full_name":"Klaas, Alexander"},{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"title":"Simulation aided, knowledge based routing for AGVs in a distribution warehouse","status":"public","year":"2011","date_updated":"2022-01-06T06:53:11Z","publication_status":"published","_id":"17421","language":[{"iso":"eng"}],"doi":"10.1109/wsc.2011.6147883","user_id":"15415"},{"department":[{"_id":"63"},{"_id":"26"}],"type":"conference","date_created":"2020-07-29T12:19:22Z","place":"Paderborn","citation":{"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} }","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.","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.","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.","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.","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."},"publication":"Augmented & Virtual Reality in der Produktentstehung","volume":295,"user_id":"15415","language":[{"iso":"eng"}],"_id":"17450","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts","page":"185--197","intvolume":"       295","date_updated":"2022-01-06T06:53:12Z","author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"full_name":"Jähn, Claudius","last_name":"Jähn","first_name":"Claudius"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"id":"15523","first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm"},{"full_name":"Koch, Clemens","first_name":"Clemens","last_name":"Koch"}],"status":"public","title":"Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze","year":"2011"},{"publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM2011","citation":{"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>.","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM2011, 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.","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} }","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."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T14:01:49Z","date_updated":"2022-01-06T06:53:26Z","year":"2011","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","status":"public","author":[{"full_name":"Renken, Hendrik","last_name":"Renken","first_name":"Hendrik"},{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"}],"user_id":"15415","_id":"18193","language":[{"iso":"eng"}]},{"abstract":[{"lang":"eng","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."}],"citation":{"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).","ama":"Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core Occlusion Culling. Published online 2011.","chicago":"Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.","ieee":"T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel Out-of-Core Occlusion Culling.” 2011.","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."},"file_date_updated":"2020-08-24T14:13:46Z","department":[{"_id":"63"}],"type":"preprint","date_created":"2020-08-24T14:14:10Z","file":[{"file_name":"pre-03-2011-5220.pdf","access_level":"closed","file_size":3091853,"relation":"main_file","date_updated":"2020-08-24T14:13:46Z","file_id":"18195","success":1,"content_type":"application/pdf","creator":"koala","date_created":"2020-08-24T14:13:46Z"}],"has_accepted_license":"1","date_updated":"2022-01-06T06:53:27Z","author":[{"last_name":"Suess","first_name":"Tim","full_name":"Suess, Tim"},{"last_name":"Koch","first_name":"Clemens","full_name":"Koch, Clemens"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"}],"status":"public","title":"Parallel Out-of-Core Occlusion Culling","year":"2011","ddc":["000"],"user_id":"15415","_id":"18194","language":[{"iso":"eng"}]},{"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} }","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>","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>.","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>.","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.","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>"},"status":"public","user_id":"15415","page":"178-189","_id":"16410","publisher":"Springer","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"}],"issue":"6543","publication":"37th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2011)","type":"conference","department":[{"_id":"63"}],"date_created":"2020-04-06T07:52:42Z","date_updated":"2022-01-06T06:52:50Z","publication_status":"published","year":"2011","title":"Collisionless Gathering of Robots with an Extent","publication_identifier":{"isbn":["9783642183805","9783642183812"],"issn":["0302-9743","1611-3349"]},"author":[{"last_name":"Cord-Landwehr","first_name":"Andreas","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"full_name":"Hüllmann, Martina","first_name":"Martina","last_name":"Hüllmann"},{"first_name":"Barbara","last_name":"Kempkes","full_name":"Kempkes, Barbara"},{"full_name":"Klaas, Alexander","first_name":"Alexander","last_name":"Klaas"},{"last_name":"Kling","first_name":"Peter","full_name":"Kling, Peter"},{"full_name":"Kurras, Sven","last_name":"Kurras","first_name":"Sven"},{"full_name":"Märtens, Marcus","last_name":"Märtens","first_name":"Marcus"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","full_name":"Meyer auf der Heide, Friedhelm","id":"15523"},{"last_name":"Raupach","first_name":"Christoph","full_name":"Raupach, Christoph"},{"full_name":"Swierkot, Kamil","first_name":"Kamil","last_name":"Swierkot"},{"full_name":"Warner, Daniel","first_name":"Daniel","last_name":"Warner"},{"full_name":"Weddemann, Christoph","first_name":"Christoph","last_name":"Weddemann"},{"full_name":"Wonisch, Daniel","first_name":"Daniel","last_name":"Wonisch"}],"doi":"10.1007/978-3-642-18381-2_15","language":[{"iso":"eng"}]},{"status":"public","year":"2011","title":"A New Approach for Analyzing Convergence Algorithms for Mobile Robots","author":[{"first_name":"Andreas","last_name":"Cord-Landwehr","full_name":"Cord-Landwehr, Andreas"},{"full_name":"Degener, Bastian","first_name":"Bastian","last_name":"Degener"},{"id":"146","full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer"},{"first_name":"Martina","last_name":"Hüllmann","full_name":"Hüllmann, Martina"},{"full_name":"Kempkes, Barbara","first_name":"Barbara","last_name":"Kempkes"},{"full_name":"Klaas, Alexander","last_name":"Klaas","first_name":"Alexander"},{"full_name":"Kling, Peter","last_name":"Kling","first_name":"Peter"},{"full_name":"Kurras, Sven","first_name":"Sven","last_name":"Kurras"},{"last_name":"Märtens","first_name":"Marcus","full_name":"Märtens, Marcus"},{"id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Raupach, Christoph","first_name":"Christoph","last_name":"Raupach"},{"first_name":"Kamil","last_name":"Swierkot","full_name":"Swierkot, Kamil"},{"full_name":"Warner, Daniel","last_name":"Warner","first_name":"Daniel"},{"last_name":"Weddemann","first_name":"Christoph","full_name":"Weddemann, Christoph"},{"full_name":"Wonisch, Daniel","last_name":"Wonisch","first_name":"Daniel"}],"publication_identifier":{"isbn":["9783642220111","9783642220128"],"issn":["0302-9743","1611-3349"]},"date_updated":"2022-01-06T06:52:50Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16409","doi":"10.1007/978-3-642-22012-8_52","user_id":"15415","publication":"Automata, Languages and Programming","citation":{"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} }","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>.","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>.","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.","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."},"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"}]},{"publication":"Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011","citation":{"ieee":"H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization,” 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>.","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.","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} }","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.","short":"H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European Simulation and Modelling Conference - ESM’2011, 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."},"type":"conference","department":[{"_id":"671"}],"date_created":"2021-10-16T22:43:30Z","publication_status":"published","date_updated":"2022-01-25T18:15:43Z","year":"2011","status":"public","title":"An Easy Extendable Modeling Framework for Discrete Event Simulation Models and their Visualization","author":[{"full_name":"Renken, Hendrik","last_name":"Renken","first_name":"Hendrik"},{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"}],"user_id":"71124","language":[{"iso":"eng"}],"_id":"26384"},{"date_created":"2021-10-16T22:54:06Z","type":"conference","department":[{"_id":"671"}],"publication":"Proceedings of the 2011 Winter Simulation Conference","citation":{"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} }","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.","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.","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.","short":"A. Klaas, C. Laroque, M. Fischer, W. Dangelmaier, in: Proceedings of the 2011 Winter Simulation Conference, 2011.","ieee":"A. Klaas, C. Laroque, M. Fischer, and W. Dangelmaier, “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse,” 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>."},"language":[{"iso":"eng"}],"_id":"26387","user_id":"71124","status":"public","title":"Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse","year":"2011","author":[{"last_name":"Klaas","first_name":"Alexander ","full_name":"Klaas, Alexander "},{"full_name":"Laroque, Christoph ","first_name":"Christoph ","last_name":"Laroque"},{"last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias","id":"146"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"}],"date_updated":"2022-01-25T18:16:03Z","publication_status":"published"},{"type":"conference","department":[{"_id":"63"}],"date_created":"2020-07-27T19:33:16Z","abstract":[{"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.","lang":"eng"}],"publication":"Proceedings of the 2010 Winter Simulation Conference","citation":{"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>","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>.","short":"M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings of the 2010 Winter Simulation Conference, 2010.","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>"},"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","author":[{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Renken, Hendrik","first_name":"Hendrik","last_name":"Renken"},{"full_name":"Laroque, Christoph","first_name":"Christoph","last_name":"Laroque"},{"first_name":"Guido","last_name":"Schaumann","full_name":"Schaumann, Guido"},{"first_name":"Wilhelm","last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm"}],"publication_identifier":{"isbn":["9781424498666"]}},{"doi":"10.2312/EGPGV/EGPGV10/043-051","user_id":"15415","page":"43-51","language":[{"iso":"eng"}],"_id":"18136","publisher":"The Eurographics Association","date_updated":"2022-01-06T06:53:26Z","year":"2010","status":"public","title":"Asynchronous Parallel Reliefboard Computation for Scene Object Approximation","author":[{"id":"146","last_name":"Fischer","first_name":"Matthias","full_name":"Fischer, Matthias"},{"first_name":"Claudius","last_name":"Jähn","full_name":"Jähn, Claudius"},{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"}],"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T07:07:55Z","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} }","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.","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>.","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>."}},{"date_created":"2020-08-25T14:04:38Z","department":[{"_id":"63"}],"type":"conference","citation":{"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>.","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>","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>","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} }","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>."},"publication":"2010 IEEE Fifth International Conference on Networking, Architecture, and Storage","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."}],"language":[{"iso":"eng"}],"_id":"18289","page":"448 - 456","user_id":"15415","doi":"10.1109/nas.2010.52","author":[{"first_name":"Tim","last_name":"Suess","full_name":"Suess, Tim"},{"first_name":"Timo","last_name":"Wiesemann","full_name":"Wiesemann, Timo"},{"full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias","id":"146"}],"publication_identifier":{"isbn":["9781424481330"]},"title":"Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive Environments","status":"public","year":"2010","publication_status":"published","date_updated":"2022-01-06T06:53:28Z"},{"date_updated":"2022-01-06T06:53:28Z","author":[{"full_name":"Suess, Tim","last_name":"Suess","first_name":"Tim"},{"last_name":"Wiesemann","first_name":"Timo","full_name":"Wiesemann, Timo"},{"id":"146","first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias"}],"title":"Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems","status":"public","year":"2010","user_id":"15415","language":[{"iso":"eng"}],"_id":"18290","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","page":"39-52","abstract":[{"lang":"ger","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"}],"citation":{"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.","short":"T. Suess, T. Wiesemann, M. Fischer, in: Augmented &#38; Virtual Reality in Der Produktentstehung, 2010, pp. 39–52.","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.","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} }"},"publication":"Augmented & Virtual Reality in der Produktentstehung","department":[{"_id":"63"}],"type":"book_chapter","date_created":"2020-08-25T14:14:36Z"},{"author":[{"first_name":"Benjamin","last_name":"Eikel","full_name":"Eikel, Benjamin"},{"last_name":"Jähn","first_name":"Claudius","full_name":"Jähn, Claudius"},{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"}],"publication_identifier":{"isbn":["9783642172885","9783642172892"],"issn":["0302-9743","1611-3349"]},"year":"2010","title":"Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware","status":"public","date_updated":"2022-01-06T06:52:52Z","publication_status":"published","language":[{"iso":"eng"}],"_id":"16505","doi":"10.1007/978-3-642-17289-2_60","user_id":"15415","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>.","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>","short":"B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin, Heidelberg, 2010.","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","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"}],"place":"Berlin, Heidelberg","date_created":"2020-04-14T13:06:51Z","department":[{"_id":"63"}],"type":"book_chapter"},{"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":{"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.","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.","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.","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.","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} }","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."},"type":"conference","department":[{"_id":"63"}],"date_created":"2020-08-24T07:28:23Z","date_updated":"2022-01-06T06:53:26Z","status":"public","year":"2009","title":"Concepts for Model Verification and Validation during Simulation Runtime","author":[{"last_name":"Laroque","first_name":"Christoph","full_name":"Laroque, Christoph"},{"full_name":"Fischer, Matthias","first_name":"Matthias","last_name":"Fischer","id":"146"},{"last_name":"Dangelmaier","first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm"}],"user_id":"15415","_id":"18138","publisher":"EUROSIS-ETI","language":[{"iso":"eng"}]}]