[{"language":[{"iso":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"18366","status":"public","publication":"Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005","type":"conference","title":"Methods to lead the user to significant processes in a 3D material flow simulation","author":[{"first_name":"Wilhelm","full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier"},{"last_name":"Mueck","full_name":"Mueck, Bengt","first_name":"Bengt"},{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"full_name":"Mahajan, Kiran","last_name":"Mahajan","first_name":"Kiran"},{"first_name":"Christoph","full_name":" Laroque, Christoph","last_name":" Laroque"}],"date_created":"2020-08-26T12:36:33Z","date_updated":"2022-01-06T06:53:30Z","page":"267-270","citation":{"ama":"Dangelmaier W, Mueck B, Fischer M, Mahajan K,  Laroque C. Methods to lead the user to significant processes in a 3D material flow simulation. In: <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>. ; 2005:267-270.","ieee":"W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, and C.  Laroque, “Methods to lead the user to significant processes in a 3D material flow simulation,” in <i>Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 2005, pp. 267–270.","chicago":"Dangelmaier, Wilhelm, Bengt Mueck, Matthias Fischer, Kiran Mahajan, and Christoph  Laroque. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” In <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 267–70, 2005.","bibtex":"@inproceedings{Dangelmaier_Mueck_Fischer_Mahajan_ Laroque_2005, title={Methods to lead the user to significant processes in a 3D material flow simulation}, booktitle={Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005}, author={Dangelmaier, Wilhelm and Mueck, Bengt and Fischer, Matthias and Mahajan, Kiran and  Laroque, Christoph}, year={2005}, pages={267–270} }","short":"W. Dangelmaier, B. Mueck, M. Fischer, K. Mahajan, C.  Laroque, in: Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005, 2005, pp. 267–270.","mla":"Dangelmaier, Wilhelm, et al. “Methods to Lead the User to Significant Processes in a 3D Material Flow Simulation.” <i>Simulation in Wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i>, 2005, pp. 267–70.","apa":"Dangelmaier, W., Mueck, B., Fischer, M., Mahajan, K., &#38;  Laroque, C. (2005). Methods to lead the user to significant processes in a 3D material flow simulation. In <i>Simulation in wider Europe - 19th European Conference on Modelling and Simulation ECMS 2005</i> (pp. 267–270)."},"year":"2005"},{"status":"public","type":"conference","file_date_updated":"2020-08-26T12:29:05Z","user_id":"15415","department":[{"_id":"63"}],"_id":"18364","citation":{"mla":"Mueck, Bengt, et al. “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations.” <i>Simulation and Visualisation 2004</i>, SCS European Publishing House, 2004, pp. 73–83.","bibtex":"@inproceedings{Mueck_Dangelmaier_Laroque_Fischer_Kortenjan_2004, place={Magdeburg}, title={Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations}, booktitle={Simulation and Visualisation 2004}, publisher={SCS European Publishing House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Laroque, Christoph  and Fischer, Matthias and Kortenjan, Michael}, year={2004}, pages={73–83} }","short":"B. Mueck, W. Dangelmaier, C. Laroque, M. Fischer, M. Kortenjan, in: Simulation and Visualisation 2004, SCS European Publishing House, Magdeburg, 2004, pp. 73–83.","apa":"Mueck, B., Dangelmaier, W., Laroque, C., Fischer, M., &#38; Kortenjan, M. (2004). Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In <i>Simulation and Visualisation 2004</i> (pp. 73–83). Magdeburg: SCS European Publishing House.","ama":"Mueck B, Dangelmaier W, Laroque C, Fischer M, Kortenjan M. Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations. In: <i>Simulation and Visualisation 2004</i>. Magdeburg: SCS European Publishing House; 2004:73-83.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, Christoph  Laroque, Matthias Fischer, and Michael Kortenjan. “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations.” In <i>Simulation and Visualisation 2004</i>, 73–83. Magdeburg: SCS European Publishing House, 2004.","ieee":"B. Mueck, W. Dangelmaier, C. Laroque, M. Fischer, and M. Kortenjan, “Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations,” in <i>Simulation and Visualisation 2004</i>, 2004, pp. 73–83."},"page":"73-83","place":"Magdeburg","has_accepted_license":"1","author":[{"first_name":"Bengt","full_name":"Mueck, Bengt","last_name":"Mueck"},{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"full_name":"Laroque, Christoph ","last_name":"Laroque","first_name":"Christoph "},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"full_name":"Kortenjan, Michael","last_name":"Kortenjan","first_name":"Michael"}],"date_updated":"2022-01-06T06:53:30Z","file":[{"date_updated":"2020-08-26T12:29:05Z","creator":"koala","date_created":"2020-08-26T12:29:05Z","file_size":1767621,"file_id":"18365","access_level":"closed","file_name":"hni-id-1642.pdf","content_type":"application/pdf","success":1,"relation":"main_file"}],"abstract":[{"text":"The visualisation of manufacturing-processes assists the user in understanding and analysis.\r\nTypically he can move free and unguided in a virtual environment which visualizes the entire\r\nprocess. Thus knowledge and conclusions are to some extend acquired on a random base.\r\nThis article describes the development of a tool, which enables the user to interactively improve\r\nsignificant production processes in the simulation. He moves in a virtual 3D-environment\r\n(walkthrough system) and is able to acquire automatically calculated indications for significant\r\nprocesses. At the same time the simulation considers significant objects in a more detailed way. If\r\nthe viewer is interested in a significant process, he is automatically guided to the relevant location\r\nwhere he can examine the critical situation by modification of the simulation model.","lang":"eng"}],"publication":"Simulation and Visualisation 2004","language":[{"iso":"eng"}],"ddc":["000"],"year":"2004","title":"Guidance of Users in Interactive 3D-Visualisations of Material Flow Simulations","date_created":"2020-08-26T12:29:21Z","publisher":"SCS European Publishing House"},{"language":[{"iso":"eng"}],"_id":"16399","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.\r\n\r\nThe sampling process is done in the preprocessing. There, the polygons are randomly distributed in our hierarchical data structure, the randomized sample tree. This tree only uses space that is linear in the number of polygons. In order to produce an approximate image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology."}],"status":"public","type":"journal_article","publication":"Presence: Teleoperators and Virtual Environments","title":"The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments","doi":"10.1162/1054746043280619","date_updated":"2022-01-06T06:52:50Z","author":[{"first_name":"Jan","full_name":"Klein, Jan","last_name":"Klein"},{"full_name":"Krokowski, Jens","last_name":"Krokowski","first_name":"Jens"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Michael","full_name":"Wand, Michael","last_name":"Wand"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_created":"2020-04-03T11:42:11Z","year":"2004","citation":{"apa":"Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &#38; Meyer auf der Heide, F. (2004). The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. <i>Presence: Teleoperators and Virtual Environments</i>, 617–637. <a href=\"https://doi.org/10.1162/1054746043280619\">https://doi.org/10.1162/1054746043280619</a>","bibtex":"@article{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2004, title={The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments}, DOI={<a href=\"https://doi.org/10.1162/1054746043280619\">10.1162/1054746043280619</a>}, journal={Presence: Teleoperators and Virtual Environments}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2004}, pages={617–637} }","mla":"Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” <i>Presence: Teleoperators and Virtual Environments</i>, 2004, pp. 617–37, doi:<a href=\"https://doi.org/10.1162/1054746043280619\">10.1162/1054746043280619</a>.","short":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, Presence: Teleoperators and Virtual Environments (2004) 617–637.","ieee":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments,” <i>Presence: Teleoperators and Virtual Environments</i>, pp. 617–637, 2004.","chicago":"Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments.” <i>Presence: Teleoperators and Virtual Environments</i>, 2004, 617–37. <a href=\"https://doi.org/10.1162/1054746043280619\">https://doi.org/10.1162/1054746043280619</a>.","ama":"Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The Randomized Sample Tree: A Data Structure for Interactive Walk-Throughs in Externally Stored Virtual Environments. <i>Presence: Teleoperators and Virtual Environments</i>. 2004:617-637. doi:<a href=\"https://doi.org/10.1162/1054746043280619\">10.1162/1054746043280619</a>"},"page":"617-637","publication_status":"published","publication_identifier":{"issn":["1054-7460","1531-3263"]}},{"page":"367-371","citation":{"ama":"Mueck B, Dangelmaier W, Fischer M. Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In: <i>15th European Simulation Symposium (ESS 2003)</i>. SCS - Europe; 2003:367-371.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, and Matthias Fischer. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” In <i>15th European Simulation Symposium (ESS 2003)</i>, 367–71. SCS - Europe, 2003.","ieee":"B. Mueck, W. Dangelmaier, and M. Fischer, “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment,” in <i>15th European Simulation Symposium (ESS 2003)</i>, 2003, pp. 367–371.","apa":"Mueck, B., Dangelmaier, W., &#38; Fischer, M. (2003). Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment. In <i>15th European Simulation Symposium (ESS 2003)</i> (pp. 367–371). SCS - Europe.","mla":"Mueck, Bengt, et al. “Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment.” <i>15th European Simulation Symposium (ESS 2003)</i>, SCS - Europe, 2003, pp. 367–71.","bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_2003, title={Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment}, booktitle={15th European Simulation Symposium (ESS 2003)}, publisher={SCS - Europe}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias}, year={2003}, pages={367–371} }","short":"B. Mueck, W. Dangelmaier, M. Fischer, in: 15th European Simulation Symposium (ESS 2003), SCS - Europe, 2003, pp. 367–371."},"year":"2003","date_created":"2020-07-28T08:05:14Z","author":[{"last_name":"Mueck","full_name":"Mueck, Bengt","first_name":"Bengt"},{"last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm"},{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"}],"publisher":"SCS - Europe","date_updated":"2022-01-06T06:53:11Z","title":"Components for the Active Support of the Analysis of Material Flow Simulations in a Virtual Environment","publication":"15th European Simulation Symposium (ESS 2003)","type":"conference","status":"public","department":[{"_id":"63"}],"user_id":"15415","_id":"17423","language":[{"iso":"eng"}]},{"ddc":["000"],"language":[{"iso":"eng"}],"publication":"Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management","abstract":[{"lang":"eng","text":"Unternehmen operieren zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu; die Produktlebenszyklen werden kürzer; gleichzeitig werden die Produkte komplexer; der harte Wettbewerb zwingt die Unternehmen, auf Marktveränderungen zu reagieren. Aus dieser Entwicklung resultieren hohe Anforderungen an die Gestaltung der Fertigungsprozesse. Im Wesentlichen kommt es darauf an, die Fertigungsprozesse möglichst rasch an die neuen Gegebenheiten anzupassen, bzw. neue Fertigungsprozesse so zu planen, dass sie auf Anhieb die erforderlichen Resultate bringen.\r\nEin wichtiges Mittel hierfür der Einsatz von Materialflusssimulationen. Hierzu ist zunächst die Erstellung eines Simulationsmodells notwendig. Dafür wird in einem ersten Schritt das zu betrachtende System analysiert und ein rechnerinternes Modell erzeugt. Dieses beinhaltet die Modellierung von Funktionen, Prozessen, Verhaltensweisen oder Regeln, die im Modell die tatsächlichen Wirkzusammenhänge im Unternehmen widerspiegeln sollen. Die so modellierten Aspekte sind untereinander so vernetzt, dass alle Funktionen des Modells ein Ganzes ergeben. Für viele Fragenstellungen werden umfangreiche Modelle mit einem komplexen Verhalten benötigt. Andererseits steigt mit zunehmender Größe und Komplexität des Simulationsmodells auch der Modellierungsaufwand, die Fehleranfälligkeit, die Laufzeit und der Interpretationsaufwand bei der Ergebnisauswertung. Fehler bei der Modellbildung führen bei der Simulation zu Fehlinterpretationen und falschen Ergebnissen.\r\nEinen wesentlichen Anteil daran hat die Gestaltung der Benutzungsschnittstelle: Das übliche, wenig intuitive WIMP-Interface (Windows, Icons, Mouse, Pointer) erfordert sehr gut geschulte Benutzer, sodass die Erzeugung der meist komplexen Simulationsmodelle mit großen Zeitaufwand verbunden ist. Die Präsentation der Simulationsergebnisse erfolgt in Form von Wertetabellen und zweidimensionalen, abstrakten Darstellungen des Fertigungssystems. Für die Simulationsexperten erscheint dies ausreichend, für ein aus verschiedenen Bereichen und Disziplinen zusammengesetztes Planungsteam ist das aber nicht akzeptabel. So können Fehlinterpretationen aufgrund der unklaren Darstellungen auftreten.\r\nDurch eine durchgängige Unterstützung von der Modellierung über die Ausführung bis zur Analyse von Simulationen durch Augmented-Reality und Virtual-Reality werden viele dieser Probleme überwunden aber viele neue Probleme entstehen.\r\nMarktgängige Simulatoren unterstützen zwar z.T. schon Virtual Reality; eine durchgängige Simulationsunterstützung wird aber in der Virtuellen Umgebung nicht geboten. Argumented Reality-Komponenten sind bisher nicht bekannt.\r\nIn diesem Artikel werden nach einer Analyse der benötigten Technologien die Nutzenpotentiale insb. durch den Einsatz von AR ausgelotet.\r\n"}],"file":[{"file_size":221846,"access_level":"closed","file_name":"hni-id-1445.pdf","file_id":"18368","date_updated":"2020-08-26T12:52:18Z","creator":"koala","date_created":"2020-08-26T12:52:18Z","success":1,"relation":"main_file","content_type":"application/pdf"}],"publisher":"Shaker Verlag","date_created":"2020-08-26T12:53:13Z","title":"Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation","year":"2003","_id":"18367","department":[{"_id":"63"}],"series_title":"ESIM - European Series in Industrial Management","user_id":"15415","file_date_updated":"2020-08-26T12:52:18Z","type":"conference","status":"public","date_updated":"2022-01-06T06:53:30Z","volume":5,"author":[{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"full_name":"Grafe, Michael","last_name":"Grafe","first_name":"Michael"},{"first_name":"Carsten","full_name":"Matysczok, Carsten","last_name":"Matysczok"},{"full_name":"Mueck, Bengt","last_name":"Mueck","first_name":"Bengt"},{"last_name":"Schoo","full_name":"Schoo, Michael","first_name":"Michael"}],"has_accepted_license":"1","place":"Karlsruhe","intvolume":"         5","page":"170-177","citation":{"ama":"Fischer M, Grafe M, Matysczok C, Mueck B, Schoo M. Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In: <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>. Vol 5. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag; 2003:170-177.","ieee":"M. Fischer, M. Grafe, C. Matysczok, B. Mueck, and M. Schoo, “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation,” in <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, 2003, vol. 5, pp. 170–177.","chicago":"Fischer, Matthias, Michael Grafe, Carsten Matysczok, Bengt Mueck, and Michael Schoo. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” In <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, 5:170–77. ESIM - European Series in Industrial Management. Karlsruhe: Shaker Verlag, 2003.","bibtex":"@inproceedings{Fischer_Grafe_Matysczok_Mueck_Schoo_2003, place={Karlsruhe}, series={ESIM - European Series in Industrial Management}, title={Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation}, volume={5}, booktitle={Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management}, publisher={Shaker Verlag}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Mueck, Bengt and Schoo, Michael}, year={2003}, pages={170–177}, collection={ESIM - European Series in Industrial Management} }","short":"M. Fischer, M. Grafe, C. Matysczok, B. Mueck, M. Schoo, in: Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management, Shaker Verlag, Karlsruhe, 2003, pp. 170–177.","mla":"Fischer, Matthias, et al. “Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation.” <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i>, vol. 5, Shaker Verlag, 2003, pp. 170–77.","apa":"Fischer, M., Grafe, M., Matysczok, C., Mueck, B., &#38; Schoo, M. (2003). Virtual and Augmented Reality Support for Discrete Manufacturing System Simulation. In <i>Human Aspects in Production Management - Proceedings of the IFIP WG 5.7 Working Conference on Human Aspects in Production Management</i> (Vol. 5, pp. 170–177). Karlsruhe: Shaker Verlag."}},{"page":"141-151","intvolume":"       123","citation":{"ieee":"W. Dangelmaier, W.  Franke, B. Mueck, and M. Fischer, “Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen,” in <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2003, vol. 123, pp. 141–151.","chicago":"Dangelmaier, Wilhelm, Werner  Franke, Bengt Mueck, and Matthias Fischer. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 123:141–51. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn, 2003.","ama":"Dangelmaier W,  Franke W, Mueck B, Fischer M. Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In: <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. ; 2003:141-151.","short":"W. Dangelmaier, W.  Franke, B. Mueck, M. Fischer, in: 2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, 2003, pp. 141–151.","bibtex":"@inproceedings{Dangelmaier_ Franke_Mueck_Fischer_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen}, volume={123}, booktitle={2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, author={Dangelmaier, Wilhelm and  Franke, Werner and Mueck, Bengt and Fischer, Matthias}, year={2003}, pages={141–151}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","mla":"Dangelmaier, Wilhelm, et al. “Komponenten Zur Aktiven Unterstützung Der Analyse von Materialflusssimulationen in Virtuellen Umgebungen.” <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 123, 2003, pp. 141–51.","apa":"Dangelmaier, W.,  Franke, W., Mueck, B., &#38; Fischer, M. (2003). Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen. In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 123, pp. 141–151)."},"has_accepted_license":"1","volume":123,"author":[{"full_name":"Dangelmaier, Wilhelm","last_name":"Dangelmaier","first_name":"Wilhelm"},{"first_name":"Werner","full_name":" Franke, Werner","last_name":" Franke"},{"first_name":"Bengt","last_name":"Mueck","full_name":"Mueck, Bengt"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"}],"date_updated":"2022-01-06T06:53:31Z","status":"public","type":"conference","file_date_updated":"2020-08-26T13:15:56Z","department":[{"_id":"63"}],"user_id":"15415","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18372","year":"2003","title":"Komponenten zur aktiven Unterstützung der Analyse von Materialflusssimulationen in virtuellen Umgebungen","date_created":"2020-08-26T13:16:08Z","file":[{"success":1,"relation":"main_file","content_type":"application/pdf","file_size":166316,"file_id":"18373","access_level":"closed","file_name":"hni-id-1340.pdf","date_updated":"2020-08-26T13:15:56Z","creator":"koala","date_created":"2020-08-26T13:15:56Z"}],"abstract":[{"lang":"ger","text":"Simulation und Visualisierung sind anerkannte Mittel zum Verstehen und Analysieren von Fertigungsprozessen. In Visualisierungen von Fertigungsprozessen können Betrachter frei und ungeleitet umherwandern. Erkenntnisse werden so aber eher zufällig erworben. Dieser Artikel skizziert ein System und Methoden, die den Betrachter unterstützen auf auffällige/signifikante Prozesse/ Punkte in Materialflusssimulationen aufmerksam zu werden und diese zu entschärfen.\r\nEs wird der Entwurf eines Werkzeugs beschrieben, dass den Betrachter einer Simulation die Möglichkeit bietet, signifikante Produktionsprozesse interaktiv zu verbessern. Der Benutzer wird sich in einer virtuellen 3D-Umgebung (Walkthrough-System) bewegen können und automatisch ermittelte Indizien für signifikante Abläufe erhalten. Zugleich soll die Simulation signifikante Objekte genauer simulieren. Bekundet der Benutzer Interesse an einem signifikanten Prozess, wird er automatisch zu dem jeweiligen Ort geführt werden und dort durch Eingriffe in die Simulation die kritische Situation experimentell untersuchen können. Da der kritische Moment in der Vergangenheit liegt und somit vom Betrachter schon verpasst ist, wird es dem Betrachter möglich sein, die Simulation auf einen Zeitpunkt vor dem Eintreten zurück zu setzen.\r\nDie virtuelle Szene (3D-Grafik-Modelle) einer typischen dynamischen Simulationsumgebung ist in der Regel zu komplex, um sie in Echtzeit in einem Walkthrough-System zu visualisieren und darzustellen. Typischerweise werden Approximationsverfahren eingesetzt, um die Komplexität zu reduzieren und ein flüssiges Navigieren des Betrachters zu erlauben. Durch spezifische Simulations-Anforderungen ist bekannt, an welchen Objekten des Simulationsmodells Probleme auftreten; sie sind für den Betrachter wichtig. Die zugehörigen virtuellen 3D-Repräsentanten, können von den Approximationsalgorithmen mit einer besonders hohen Darstellungsqualität dargestellt werden und die übrigen Teile der virtuellen Szene entsprechend vernachlässigt werden. Solche Approximationsalgorithmen und Datenstrukturen nutzen die spezifischen Eigenschaften virtueller Simulationsumgebungen aus, um eine hohe Darstellungsqualität und Darstellungsperformance zu erreichen.\r\n"}],"publication":"2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","language":[{"iso":"eng"}],"ddc":["000"]},{"department":[{"_id":"63"},{"_id":"26"}],"user_id":"5786","series_title":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","_id":"18374","file_date_updated":"2020-08-26T13:24:28Z","type":"conference","status":"public","volume":123,"author":[{"first_name":"Matthias","last_name":"Fischer","id":"146","full_name":"Fischer, Matthias"},{"first_name":"Michael","last_name":"Grafe","full_name":"Grafe, Michael"},{"first_name":"Carsten","last_name":"Matysczok","full_name":"Matysczok, Carsten"},{"last_name":"Schoo","full_name":"Schoo, Michael","first_name":"Michael"},{"full_name":"Mueck, Bengt","last_name":"Mueck","first_name":"Bengt"}],"date_updated":"2022-01-06T06:53:31Z","has_accepted_license":"1","page":"153-166","intvolume":"       123","citation":{"chicago":"Fischer, Matthias, Michael Grafe, Carsten Matysczok, Michael Schoo, and Bengt Mueck. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” In <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 123:153–66. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003.","ieee":"M. Fischer, M. Grafe, C. Matysczok, M. Schoo, and B. Mueck, “Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation,” in <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>, 2003, vol. 123, pp. 153–166.","ama":"Fischer M, Grafe M, Matysczok C, Schoo M, Mueck B. Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. In: <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 123. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2003:153-166.","mla":"Fischer, Matthias, et al. “Planung von Komplexen Fertigungssystemen Durch Einsatz Einer VR/AR-Unterstützten Simulation.” <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 123, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–66.","short":"M. Fischer, M. Grafe, C. Matysczok, M. Schoo, B. Mueck, in: 2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2003, pp. 153–166.","bibtex":"@inproceedings{Fischer_Grafe_Matysczok_Schoo_Mueck_2003, series={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, title={Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation}, volume={123}, booktitle={2. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Fischer, Matthias and Grafe, Michael and Matysczok, Carsten and Schoo, Michael and Mueck, Bengt}, year={2003}, pages={153–166}, collection={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn} }","apa":"Fischer, M., Grafe, M., Matysczok, C., Schoo, M., &#38; Mueck, B. (2003). Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation. <i>2. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>, <i>123</i>, 153–166."},"language":[{"iso":"eng"}],"ddc":["000"],"publication":"2. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung","file":[{"creator":"koala","date_created":"2020-08-26T13:24:28Z","date_updated":"2020-08-26T13:24:28Z","file_name":"hni-id-1343.pdf","file_id":"18375","access_level":"closed","file_size":906882,"content_type":"application/pdf","relation":"main_file","success":1}],"abstract":[{"lang":"ger","text":"In der heutigen Zeit operieren Unternehmen zunehmend in einem schwierigen Umfeld: Die Innovationsdynamik nimmt zu und die Produktlebenszyklen werden kürzer. Daraus resultieren hohe Anforderungen an die Planung von Fertigungssysteme. Um diesen Prozess zu unterstützen, sollen die Technologien Augmented Reality und Virtual Reality in einem integrierten System genutzt werden. Dieses System unterstützt den Anwender bei der Modellbildung, der Validierung des Simulationsmodells sowie der folgenden Optimierung des Fertigungssystems. Durch die Entwicklung geeigneter Kopplungs- bzw. Integrationsmechanismen wird eine durchgängige Nutzung der Technologien AR, VR und Simulation realisiert. Die Visualisierung der anfallenden 3D-Daten innerhalb der VR- und ARUmgebungen erfolgt mittels einer 3D-Renderinglibrary, die es durch den Einsatz von neuen entwickelten Verfahren ermöglicht, die verwendeten 3D-Modelle weitgehend automatisiert aus unternehmensinternen 3D-CAD-Modellen zu generieren."}],"date_created":"2020-08-26T13:24:57Z","publisher":"Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn","title":"Planung von komplexen Fertigungssystemen durch Einsatz einer VR/AR-unterstützten Simulation","year":"2003"},{"author":[{"full_name":"Mueck, Bengt","last_name":"Mueck","first_name":"Bengt"},{"last_name":"Dangelmaier","full_name":"Dangelmaier, Wilhelm","first_name":"Wilhelm"},{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Klemisch, Wolfram","last_name":"Klemisch","first_name":"Wolfram"}],"date_created":"2020-08-26T13:01:43Z","publisher":"SCS European Publishing House","date_updated":"2022-01-06T06:53:30Z","title":"Bi-directional Coupling of Simulation Tools with a Walkthrough-System","citation":{"apa":"Mueck, B., Dangelmaier, W., Fischer, M., &#38; Klemisch, W. (2002). Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In <i>Simulation und Visualisierung</i> (pp. 71–84). Ghent, BE: SCS European Publishing House.","mla":"Mueck, Bengt, et al. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” <i>Simulation Und Visualisierung</i>, SCS European Publishing House, 2002, pp. 71–84.","bibtex":"@inproceedings{Mueck_Dangelmaier_Fischer_Klemisch_2002, place={Ghent, BE}, title={Bi-directional Coupling of Simulation Tools with a Walkthrough-System}, booktitle={Simulation und Visualisierung}, publisher={SCS European Publishing House}, author={Mueck, Bengt and Dangelmaier, Wilhelm and Fischer, Matthias and Klemisch, Wolfram}, year={2002}, pages={71–84} }","short":"B. Mueck, W. Dangelmaier, M. Fischer, W. Klemisch, in: Simulation Und Visualisierung, SCS European Publishing House, Ghent, BE, 2002, pp. 71–84.","ama":"Mueck B, Dangelmaier W, Fischer M, Klemisch W. Bi-directional Coupling of Simulation Tools with a Walkthrough-System. In: <i>Simulation Und Visualisierung</i>. Ghent, BE: SCS European Publishing House; 2002:71-84.","chicago":"Mueck, Bengt, Wilhelm Dangelmaier, Matthias Fischer, and Wolfram Klemisch. “Bi-Directional Coupling of Simulation Tools with a Walkthrough-System.” In <i>Simulation Und Visualisierung</i>, 71–84. Ghent, BE: SCS European Publishing House, 2002.","ieee":"B. Mueck, W. Dangelmaier, M. Fischer, and W. Klemisch, “Bi-directional Coupling of Simulation Tools with a Walkthrough-System,” in <i>Simulation und Visualisierung</i>, 2002, pp. 71–84."},"page":"71-84","place":"Ghent, BE","year":"2002","user_id":"15415","department":[{"_id":"63"}],"_id":"18369","language":[{"iso":"eng"}],"type":"conference","publication":"Simulation und Visualisierung","status":"public","abstract":[{"lang":"eng","text":"Visualising is a method used to help experiencing and understanding causal cohesions in simulation processes. For this purpose, tools for visualising are already implemented in prevalent simulation systems. The user creates his simulation model and generates a 3-dimensional (2,5-dimensional) visualising by means of the simulation system. This helps examining the process which makes it easier for the viewer to “understand” it. Simulation tools usually only provide the opportunity for a unidirectional visualising. In a 3-dimensional surrounding the viewer can not implement an interaction with the simulation while the system is running. Though an interaction during the simulation run enables the user to gain a better understanding of causal cohesions. Solutions via HLA are sophisticated and therefore rather suited for extensive projects.\r\nWe present a distributed system consisting of a commercial manufacturing simulation tool, a coupling module and a walkthrough system. The distributed system in conjunctions with the coupling module guarantees generality and a wide field of applications of the walkthrough system. Further it guarantees flexibility and selection of the specialized graphics hardware for the walkthrough system. A further contribution of this paper is the solution of the time synchronisation problem caused by simulation tool and walkthrough system.\r\n"}]},{"type":"conference","publication":"Proceedings of the ACM symposium on Virtual reality software and technology  - VRST '02","status":"public","abstract":[{"text":"We present a new data structure for rendering highly complex virtual environments of arbitrary topology. The special feature of our approach is that it allows an interactive navigation in very large scenes (30 GB/400 million polygons in our benchmark scenes) that cannot be stored in main memory, but only on a local or remote hard disk. Furthermore, it allows interactive rendering of substantially more complex scenes by instantiating objects.\r\n\r\nFor the computation of an approximate image of the scene, a sampling technique is used. In the preprocessing, a so-called sample tree is built whose nodes contain randomly selected polygons from the scene. This tree only uses space that is linear in the number of polygons. In order to produce an image of the scene, the tree is traversed and polygons stored in the visited nodes are rendered. During the interactive walkthrough, parts of the sample tree are loaded from local or remote hard disk.\r\n\r\nWe implemented our algorithm in a prototypical walkthrough system. Analysis and experiments show that the quality of our images is comparable to images computed by the conventional z-buffer algorithm regardless of the scene topology.","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"16490","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["1581135300"]},"citation":{"ieee":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, and F. Meyer auf der Heide, “The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments,” in <i>Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02</i>, 2002.","chicago":"Klein, Jan, Jens Krokowski, Matthias Fischer, Michael Wand, Rolf Wanka, and Friedhelm Meyer auf der Heide. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” In <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>, 2002. <a href=\"https://doi.org/10.1145/585740.585764\">https://doi.org/10.1145/585740.585764</a>.","ama":"Klein J, Krokowski J, Fischer M, Wand M, Wanka R, Meyer auf der Heide F. The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In: <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>. ; 2002. doi:<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>","apa":"Klein, J., Krokowski, J., Fischer, M., Wand, M., Wanka, R., &#38; Meyer auf der Heide, F. (2002). The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments. In <i>Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02</i>. <a href=\"https://doi.org/10.1145/585740.585764\">https://doi.org/10.1145/585740.585764</a>","short":"J. Klein, J. Krokowski, M. Fischer, M. Wand, R. Wanka, F. Meyer auf der Heide, in: Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02, 2002.","bibtex":"@inproceedings{Klein_Krokowski_Fischer_Wand_Wanka_Meyer auf der Heide_2002, title={The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments}, DOI={<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>}, booktitle={Proceedings of the ACM symposium on Virtual reality software and technology  - VRST ’02}, author={Klein, Jan and Krokowski, Jens and Fischer, Matthias and Wand, Michael and Wanka, Rolf and Meyer auf der Heide, Friedhelm}, year={2002} }","mla":"Klein, Jan, et al. “The Randomized Sample Tree: A Data Structure for Interactive Walkthroughs in Externally Stored Virtual Environments.” <i>Proceedings of the ACM Symposium on Virtual Reality Software and Technology  - VRST ’02</i>, 2002, doi:<a href=\"https://doi.org/10.1145/585740.585764\">10.1145/585740.585764</a>."},"year":"2002","date_created":"2020-04-09T10:10:36Z","author":[{"last_name":"Klein","full_name":"Klein, Jan","first_name":"Jan"},{"first_name":"Jens","full_name":"Krokowski, Jens","last_name":"Krokowski"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"first_name":"Michael","last_name":"Wand","full_name":"Wand, Michael"},{"full_name":"Wanka, Rolf","last_name":"Wanka","first_name":"Rolf"},{"first_name":"Friedhelm","full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide"}],"date_updated":"2022-01-06T06:52:51Z","doi":"10.1145/585740.585764","title":"The randomized sample tree: a data structure for interactive walkthroughs in externally stored virtual environments"},{"_id":"18370","department":[{"_id":"63"}],"user_id":"15415","ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2020-08-26T13:08:08Z","publication":"Proc. of 3. GI-Informatiktage 2001","type":"conference","abstract":[{"text":"We present a new approximate occlusion-culling algorithm that in contrast to other algorithms, manages the objects of the scene in a 3D-sectorgraph. For generating a frame, as far as possible only the visible objects are rendered that can be found quickly by an edge of the graph. The algorithm allows a real-time navigation with over 20 frames per second in complex scenes consisting of over 10 millions of polygons. Moreover, approximation errors are very low.","lang":"eng"}],"status":"public","file":[{"file_size":146136,"file_name":"hni-id-1450.pdf","access_level":"closed","file_id":"18371","date_updated":"2020-08-26T13:08:08Z","date_created":"2020-08-26T13:08:08Z","creator":"koala","success":1,"relation":"main_file","content_type":"application/pdf"}],"date_updated":"2022-01-06T06:53:30Z","author":[{"first_name":"Jan","full_name":"Klein, Jan","last_name":"Klein"},{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"}],"date_created":"2020-08-26T13:08:24Z","title":"Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph","has_accepted_license":"1","place":"Bad Schussenried","year":"2001","page":"275 - 278","citation":{"chicago":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” In <i>Proc. of 3. GI-Informatiktage 2001</i>, 275–78. Bad Schussenried, 2001.","ieee":"J. Klein and M. Fischer, “Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph,” in <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–278.","ama":"Klein J, Fischer M. Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In: <i>Proc. of 3. GI-Informatiktage 2001</i>. Bad Schussenried; 2001:275-278.","apa":"Klein, J., &#38; Fischer, M. (2001). Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph. In <i>Proc. of 3. GI-Informatiktage 2001</i> (pp. 275–278). Bad Schussenried.","bibtex":"@inproceedings{Klein_Fischer_2001, place={Bad Schussenried}, title={Occlusion Culling for Virtual Environments based on the 3D-Sectorgraph}, booktitle={Proc. of 3. GI-Informatiktage 2001}, author={Klein, Jan and Fischer, Matthias}, year={2001}, pages={275–278} }","short":"J. Klein, M. Fischer, in: Proc. of 3. GI-Informatiktage 2001, Bad Schussenried, 2001, pp. 275–278.","mla":"Klein, Jan, and Matthias Fischer. “Occlusion Culling for Virtual Environments Based on the 3D-Sectorgraph.” <i>Proc. of 3. GI-Informatiktage 2001</i>, 2001, pp. 275–78."}},{"publication_identifier":{"isbn":["158113374X"]},"publication_status":"published","citation":{"mla":"Wand, Michael, et al. “The Randomized Z-Buffer Algorithm.” <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001, doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>.","short":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, W. Straßer, in: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01, 2001.","bibtex":"@inproceedings{Wand_Fischer_Peter_Meyer auf der Heide_Straßer_2001, title={The randomized z-buffer algorithm}, DOI={<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>}, booktitle={Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01}, author={Wand, Michael and Fischer, Matthias and Peter, Ingmar and Meyer auf der Heide, Friedhelm and Straßer, Wolfgang}, year={2001} }","apa":"Wand, M., Fischer, M., Peter, I., Meyer auf der Heide, F., &#38; Straßer, W. (2001). The randomized z-buffer algorithm. In <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>","chicago":"Wand, Michael, Matthias Fischer, Ingmar Peter, Friedhelm Meyer auf der Heide, and Wolfgang Straßer. “The Randomized Z-Buffer Algorithm.” In <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>, 2001. <a href=\"https://doi.org/10.1145/383259.383299\">https://doi.org/10.1145/383259.383299</a>.","ieee":"M. Wand, M. Fischer, I. Peter, F. Meyer auf der Heide, and W. Straßer, “The randomized z-buffer algorithm,” in <i>Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH ’01</i>, 2001.","ama":"Wand M, Fischer M, Peter I, Meyer auf der Heide F, Straßer W. The randomized z-buffer algorithm. In: <i>Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques  - SIGGRAPH ’01</i>. ; 2001. doi:<a href=\"https://doi.org/10.1145/383259.383299\">10.1145/383259.383299</a>"},"year":"2001","author":[{"first_name":"Michael","full_name":"Wand, Michael","last_name":"Wand"},{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"full_name":"Peter, Ingmar","last_name":"Peter","first_name":"Ingmar"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Straßer","full_name":"Straßer, Wolfgang","first_name":"Wolfgang"}],"date_created":"2020-04-09T10:36:54Z","date_updated":"2022-01-06T06:52:51Z","doi":"10.1145/383259.383299","title":"The randomized z-buffer algorithm","publication":"Proceedings of the 28th annual conference on Computer graphics and interactive techniques  - SIGGRAPH '01","type":"conference","status":"public","abstract":[{"text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of an arbitrary three-dimensional scene consisting of triangular primitives by reconstruction from a dynamically chosen set of random surface sample points. This approach is independent of mesh connectivity and topology. The resulting rendering time grows only logarithmically with the numbers of triangles in the scene. We were able to render walkthroughs of scenes of up to 10^14 triangles at interactive frame rates. Automatic identification of low detail scene components ensures that the rendering speed of the randomized z-buffer cannot drop below that of conventional z-buffer rendering. Experimental and analytical evidence is given that the image quality is comparable to that of common approaches like z-buffer rendering. The precomputed data structures employed by the randomized z-buffer allow for interactive dynamic updates of the scene. Their memory requirements grow only linearly with the number of triangles and allow for a scene graph based instantiation scheme to further reduce memory consumption.","lang":"eng"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"16492","language":[{"iso":"eng"}]},{"year":"2000","place":"Universität Paderborn","citation":{"ieee":"M. Wand, M. Fischer, and F. Meyer auf der Heide, <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","chicago":"Wand, Michael, Matthias Fischer, and Friedhelm Meyer auf der Heide. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn, 2000.","ama":"Wand M, Fischer M, Meyer auf der Heide F. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn; 2000.","apa":"Wand, M., Fischer, M., &#38; Meyer auf der Heide, F. (2000). <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. Universität Paderborn.","bibtex":"@book{Wand_Fischer_Meyer auf der Heide_2000, place={Universität Paderborn}, title={Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes}, author={Wand, Michael and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2000} }","short":"M. Wand, M. Fischer, F. Meyer auf der Heide, Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes, Universität Paderborn, 2000.","mla":"Wand, Michael, et al. <i>Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes</i>. 2000."},"has_accepted_license":"1","title":"Randomized Point Sampling for Output-Sensitive Rendering of Complex Dynamic Scenes","date_updated":"2022-01-06T06:53:21Z","date_created":"2020-08-12T13:27:52Z","author":[{"first_name":"Michael","full_name":"Wand, Michael","last_name":"Wand"},{"first_name":"Matthias","last_name":"Fischer","full_name":"Fischer, Matthias","id":"146"},{"first_name":"Friedhelm","last_name":"Meyer auf der Heide","id":"15523","full_name":"Meyer auf der Heide, Friedhelm"}],"abstract":[{"lang":"eng","text":"We present a new output-sensitive rendering algorithm, the randomized z-buffer algorithm. It renders an image of a three dimensional scene of triangular primitives by reconstruction from a random sample of surface points which are chosen with a probability proportional to the projected area of the objects. The approach is independent of mesh connectivity and topology. It leads to a rendering time that grows only logarithmically with the numbers of triangles in the scene and to linear memory consumption, thus allowing walkthroughs of scenes of extreme complexity. We consider different methods for image reconstruction which aim at correctness, rendering speed and image quality and we develop an efficient data structure for sample extraction in output-sensitive time which allows for efficient dynamic updates of the scene. Experiments confirm that scenes consisting of some hundred billion triangles can be rendered within seconds with an image quality comparable to a conventional z-buffer rendering; in special cases, realtime performance can be achieved."}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"creator":"koala","date_created":"2020-08-12T13:27:33Z","date_updated":"2020-08-12T13:27:33Z","access_level":"closed","file_id":"17866","file_name":"tr-ri-00-217.pdf","file_size":921817}],"status":"public","type":"report","ddc":["000"],"file_date_updated":"2020-08-12T13:27:33Z","language":[{"iso":"eng"}],"_id":"17865","user_id":"15415","department":[{"_id":"63"}]},{"publication":"Proceedings of the 11th Canadian Conference on Computational Geometry","type":"conference","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"18438","file_name":"hni-id-729.pdf","access_level":"closed","file_size":209419,"date_created":"2020-08-27T11:14:43Z","creator":"koala","date_updated":"2020-08-27T11:14:43Z"}],"abstract":[{"lang":"eng","text":"A geometric spanner with vertex set P in Rd is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k in N and the stretch factor f>1 describing the “quality” of approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations:\r\n\r\n* k determines the amount of space required for storing PNGs.\r\n\r\n* Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree.\r\n\r\nOur results include, for fixed dimensions d as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases.\r\n"}],"department":[{"_id":"63"}],"user_id":"15415","_id":"17864","file_date_updated":"2020-08-27T11:14:43Z","language":[{"iso":"eng"}],"ddc":["000"],"related_material":{"link":[{"relation":"confirmation","url":"http://www.cccg.ca/proceedings/1999/fp36.pdf"}]},"has_accepted_license":"1","citation":{"ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Partitioned neighborhood spanners of minimal outdegree,” in <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>, 1999.","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin Ziegler. “Partitioned Neighborhood Spanners of Minimal Outdegree.” In <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver, 1999.","ama":"Fischer M, Lukovszki T, Ziegler M. Partitioned neighborhood spanners of minimal outdegree. In: <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver; 1999.","apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1999). Partitioned neighborhood spanners of minimal outdegree. In <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>. Vancouver.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1999, place={Vancouver}, title={Partitioned neighborhood spanners of minimal outdegree}, booktitle={Proceedings of the 11th Canadian Conference on Computational Geometry}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin}, year={1999} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Proceedings of the 11th Canadian Conference on Computational Geometry, Vancouver, 1999.","mla":"Fischer, Matthias, et al. “Partitioned Neighborhood Spanners of Minimal Outdegree.” <i>Proceedings of the 11th Canadian Conference on Computational Geometry</i>, 1999."},"year":"1999","place":"Vancouver","date_created":"2020-08-12T13:12:00Z","author":[{"first_name":"Matthias","full_name":"Fischer, Matthias","id":"146","last_name":"Fischer"},{"full_name":"Lukovszki, Tamas","last_name":"Lukovszki","first_name":"Tamas"},{"first_name":"Martin","last_name":"Ziegler","full_name":"Ziegler, Martin"}],"date_updated":"2022-01-06T06:53:21Z","title":"Partitioned neighborhood spanners of minimal outdegree"},{"place":"Berlin, Heidelberg","year":"1998","citation":{"mla":"Fischer, Matthias, et al. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” <i>Algorithms — ESA’ 98</i>, 1998, doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>.","bibtex":"@inbook{Fischer_Lukovszki_Ziegler_1998, place={Berlin, Heidelberg}, title={Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time}, DOI={<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>}, booktitle={Algorithms — ESA’ 98}, author={Fischer, Matthias and Lukovszki, Tamás and Ziegler, Martin}, year={1998} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithms — ESA’ 98, Berlin, Heidelberg, 1998.","apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg. <a href=\"https://doi.org/10.1007/3-540-68530-8_14\">https://doi.org/10.1007/3-540-68530-8_14</a>","ama":"Fischer M, Lukovszki T, Ziegler M. Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time. In: <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg; 1998. doi:<a href=\"https://doi.org/10.1007/3-540-68530-8_14\">10.1007/3-540-68530-8_14</a>","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time,” in <i>Algorithms — ESA’ 98</i>, Berlin, Heidelberg, 1998.","chicago":"Fischer, Matthias, Tamás Lukovszki, and Martin Ziegler. “Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time.” In <i>Algorithms — ESA’ 98</i>. Berlin, Heidelberg, 1998. <a href=\"https://doi.org/10.1007/3-540-68530-8_14\">https://doi.org/10.1007/3-540-68530-8_14</a>."},"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783540648482","9783540685302"]},"has_accepted_license":"1","title":"Geometric Searching in Walkthrough Animations with Weak Spanners in Real Time","doi":"10.1007/3-540-68530-8_14","date_updated":"2022-01-06T06:53:11Z","date_created":"2020-07-27T11:42:54Z","author":[{"id":"146","full_name":"Fischer, Matthias","last_name":"Fischer","first_name":"Matthias"},{"first_name":"Tamás","last_name":"Lukovszki","full_name":"Lukovszki, Tamás"},{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"}],"abstract":[{"lang":"eng","text":"We study algorithmic aspects in the management of geometric scenes in interactive walkthrough animations. We consider arbitrarily large scenes consisting of unit size balls. For a smooth navigation in the scene we have to fulfill hard real time requirements. Therefore, we need algorithms whose running time is independent of the total number of objects in the scene and that use as small space as possible. In this work we focus on one of the basic operations in our walkthrough system: reporting the objects around the visitor within a certain distance. Previously a randomized data structure was presented that supports reporting the balls around the visitor in an output sensitive time and allows insertion and deletion of objects nearly as fast as searching. These results were achieved by exploiting the fact that the visitor moves ''slowly'' through the scene. A serious disadvantage of the aforementioned data structure is a big space overhead and the use of randomization. Our first result is a construction of weak spanners that leads to an improvement of the space requirement of the previously known data structures. Then we develop a deterministic data structure for the searching problem in which insertion of objects are allowed. Our incremental data structure supports O(1+k) reporting time, where k is a certain quantity close to the number of reported objects. The insertion time is similar to the reporting time and the space is linear to the total number of objects.\r\n"}],"file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2020-08-27T11:20:38Z","creator":"koala","date_updated":"2020-08-27T11:20:38Z","file_name":"hni-id-854.pdf","file_id":"18442","access_level":"closed","file_size":266070}],"status":"public","type":"book_chapter","publication":"Algorithms — ESA’ 98","ddc":["000"],"file_date_updated":"2020-08-27T11:20:38Z","language":[{"iso":"eng"}],"_id":"17412","user_id":"15415","department":[{"_id":"63"}]},{"page":"133--142","citation":{"apa":"Fischer, M., Lukovszki, T., &#38; Ziegler, M. (1998). A Network Based Approach for Realtime Walkthrough of Massive Models. In <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i> (pp. 133--142). Saarbrücken: Max-Planck-Institut für Informatik.","bibtex":"@inproceedings{Fischer_Lukovszki_Ziegler_1998, place={Saarbrücken}, title={A Network Based Approach for Realtime Walkthrough of Massive Models}, booktitle={Algorithm Engineering, 2nd International Workshop, {WAE ’98}}, publisher={Max-Planck-Institut für Informatik}, author={Fischer, Matthias and Lukovszki, Tamas and Ziegler, Martin }, year={1998}, pages={133--142} }","short":"M. Fischer, T. Lukovszki, M. Ziegler, in: Algorithm Engineering, 2nd International Workshop, {WAE ’98}, Max-Planck-Institut für Informatik, Saarbrücken, 1998, pp. 133--142.","mla":"Fischer, Matthias, et al. “A Network Based Approach for Realtime Walkthrough of Massive Models.” <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>, Max-Planck-Institut für Informatik, 1998, pp. 133--142.","chicago":"Fischer, Matthias, Tamas Lukovszki, and Martin  Ziegler. “A Network Based Approach for Realtime Walkthrough of Massive Models.” In <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>, 133--142. Saarbrücken: Max-Planck-Institut für Informatik, 1998.","ieee":"M. Fischer, T. Lukovszki, and M. Ziegler, “A Network Based Approach for Realtime Walkthrough of Massive Models,” in <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>, 1998, pp. 133--142.","ama":"Fischer M, Lukovszki T, Ziegler M. A Network Based Approach for Realtime Walkthrough of Massive Models. In: <i>Algorithm Engineering, 2nd International Workshop, {WAE ’98}</i>. Saarbrücken: Max-Planck-Institut für Informatik; 1998:133--142."},"year":"1998","place":"Saarbrücken","has_accepted_license":"1","title":"A Network Based Approach for Realtime Walkthrough of Massive Models","author":[{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"last_name":"Lukovszki","full_name":"Lukovszki, Tamas","first_name":"Tamas"},{"last_name":"Ziegler","full_name":"Ziegler, Martin ","first_name":"Martin "}],"date_created":"2020-08-12T12:50:56Z","publisher":"Max-Planck-Institut für Informatik","date_updated":"2022-01-06T06:53:21Z","status":"public","file":[{"access_level":"closed","file_id":"18440","file_name":"hni-id-853.pdf","file_size":272549,"date_created":"2020-08-27T11:18:26Z","creator":"koala","date_updated":"2020-08-27T11:18:26Z","relation":"main_file","success":1,"content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"New dynamic search data structures developed recently guarantee constant execution time per search and update, i.e., they fulfil the real-time requirements necessary for interactive walkthrough in large geometric scenes. Yet, superiority or even applicability of these new methods in practice was still an open question.\r\n\r\nTheir prototypical implementation presented in this work uses common libraries on standard stations and thus represents a first strut to bridge this gap. Indeed our experimental results give an indication on the actual performance of these theoretical ideas on real machines and possible bottlenecks in future developments. By special algorithmic enhancements, we can even avoid the otherwise essential preprocessing step.\r\n"}],"publication":"Algorithm Engineering, 2nd International Workshop, {WAE '98}","type":"conference","file_date_updated":"2020-08-27T11:18:26Z","language":[{"iso":"eng"}],"ddc":["000"],"department":[{"_id":"63"}],"user_id":"15415","_id":"17863"},{"abstract":[{"lang":"ger","text":"Preis für den Beitrag \"Multimediale Entdeckungsreisen unserer Welt mit dem Internet\""},{"text":"Award for the Article \"Multimedia-based Expedition of our World with the Internet\"","lang":"eng"}],"status":"public","type":"report","language":[{"iso":"eng"}],"_id":"18145","user_id":"15415","department":[{"_id":"63"}],"year":"1998","citation":{"ieee":"M. Ziegler, M. Fischer, and T. Lukovszki, <i>Multimediale Entdeckungsreisen unserer Welt mit dem Internet</i>. 1998.","chicago":"Ziegler, Martin, Matthias Fischer, and Tamás Lukovszki. <i>Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet</i>, 1998.","ama":"Ziegler M, Fischer M, Lukovszki T. <i>Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet</i>.; 1998.","short":"M. Ziegler, M. Fischer, T. Lukovszki, Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet, 1998.","mla":"Ziegler, Martin, et al. <i>Multimediale Entdeckungsreisen Unserer Welt Mit Dem Internet</i>. 1998.","bibtex":"@book{Ziegler_Fischer_Lukovszki_1998, title={Multimediale Entdeckungsreisen unserer Welt mit dem Internet}, author={Ziegler, Martin and Fischer, Matthias and Lukovszki, Tamás}, year={1998} }","apa":"Ziegler, M., Fischer, M., &#38; Lukovszki, T. (1998). <i>Multimediale Entdeckungsreisen unserer Welt mit dem Internet</i>."},"title":"Multimediale Entdeckungsreisen unserer Welt mit dem Internet","date_updated":"2022-01-06T06:53:26Z","author":[{"last_name":"Ziegler","full_name":"Ziegler, Martin","first_name":"Martin"},{"last_name":"Fischer","full_name":"Fischer, Matthias","id":"146","first_name":"Matthias"},{"full_name":"Lukovszki, Tamás","last_name":"Lukovszki","first_name":"Tamás"}],"date_created":"2020-08-24T09:55:41Z"},{"title":"Dynamic data structures for realtime management of large geometric scenes","publisher":"Springer","date_created":"2020-04-15T11:44:36Z","year":"1997","language":[{"iso":"eng"}],"abstract":[{"text":"We present a data structure problem which describes the requirements of a simple variant of fully dynamic walk-through animation: We assume the scene to consist of unit size balls in R2 or higher dimensions. The scene may be arbitrarily large and has to be stored in secondary memory (discs) with relatively slow access. We allow a visitor to walk in the scene, and a modeler to update the scene by insertions and deletions of balls. We focus on the realtime requirement of animation systems: For some t (specified by the computation power of (the rendering hardware of) the graphic workstation) the data structure has to guarantee that the balls within distance t of the current visitor's position are presented to the rendering hardware, 20 times per second. Insertions and deletions should also be available to the visitor with small delay, independent of the size of the scene. We present a data structure that fulfills the above task in realtime. Its runtime is output-sensitive, i.e. linear in a quantity close to the output size of the query. We further present (preliminary) experimental results indicating that our structure is efficient in practice.\r\n","lang":"eng"}],"publication":"5th Annual European Symposium on Algorithms (ESA '97)","doi":"10.1007/3-540-63397-9_13","date_updated":"2026-02-23T16:05:33Z","volume":1284,"author":[{"full_name":"Fischer, Matthias","id":"146","last_name":"Fischer","first_name":"Matthias"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"full_name":"Strothmann, Willy-Bernhard","last_name":"Strothmann","first_name":"Willy-Bernhard"}],"place":"Berlin, Heidelberg","intvolume":"      1284","page":"157-170","citation":{"ieee":"M. Fischer, F. Meyer auf der Heide, and W.-B. Strothmann, “Dynamic data structures for realtime management of large geometric scenes,” in <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1997, vol. 1284, pp. 157–170, doi: <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","chicago":"Fischer, Matthias, Friedhelm Meyer auf der Heide, and Willy-Bernhard Strothmann. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” In <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, 1284:157–70. Lecture Notes in Computer Science. Berlin, Heidelberg: Springer, 1997. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>.","ama":"Fischer M, Meyer auf der Heide F, Strothmann W-B. Dynamic data structures for realtime management of large geometric scenes. In: <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>. Vol 1284. Lecture Notes in Computer Science. Springer; 1997:157-170. doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>","apa":"Fischer, M., Meyer auf der Heide, F., &#38; Strothmann, W.-B. (1997). Dynamic data structures for realtime management of large geometric scenes. <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, <i>1284</i>, 157–170. <a href=\"https://doi.org/10.1007/3-540-63397-9_13\">https://doi.org/10.1007/3-540-63397-9_13</a>","short":"M. Fischer, F. Meyer auf der Heide, W.-B. Strothmann, in: 5th Annual European Symposium on Algorithms (ESA ’97), Springer, Berlin, Heidelberg, 1997, pp. 157–170.","mla":"Fischer, Matthias, et al. “Dynamic Data Structures for Realtime Management of Large Geometric Scenes.” <i>5th Annual European Symposium on Algorithms (ESA ’97)</i>, vol. 1284, Springer, 1997, pp. 157–70, doi:<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>.","bibtex":"@inproceedings{Fischer_Meyer auf der Heide_Strothmann_1997, place={Berlin, Heidelberg}, series={Lecture Notes in Computer Science}, title={Dynamic data structures for realtime management of large geometric scenes}, volume={1284}, DOI={<a href=\"https://doi.org/10.1007/3-540-63397-9_13\">10.1007/3-540-63397-9_13</a>}, booktitle={5th Annual European Symposium on Algorithms (ESA ’97)}, publisher={Springer}, author={Fischer, Matthias and Meyer auf der Heide, Friedhelm and Strothmann, Willy-Bernhard}, year={1997}, pages={157–170}, collection={Lecture Notes in Computer Science} }"},"publication_identifier":{"issn":["0302-9743","1611-3349"],"isbn":["9783540633976","9783540695363"]},"publication_status":"published","_id":"16568","department":[{"_id":"63"}],"series_title":"Lecture Notes in Computer Science","user_id":"14972","status":"public","type":"conference"},{"file_date_updated":"2020-08-26T10:15:36Z","_id":"17483","department":[{"_id":"63"}],"user_id":"15415","status":"public","type":"conference","date_updated":"2022-01-06T06:53:13Z","author":[{"first_name":"Matthias","id":"146","full_name":"Fischer, Matthias","last_name":"Fischer"},{"last_name":"Rethmann","full_name":"Rethmann, Jochen","first_name":"Jochen"},{"full_name":"Wachsmann, Alf","last_name":"Wachsmann","first_name":"Alf"}],"place":"Amsterdam","page":"13–27","citation":{"ama":"Fischer M, Rethmann J, Wachsmann A. A Realistic Cost Model for the Communication Time in Parallel Programs. In: <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>. Amsterdam: IOS Press; 1996:13–27.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, “A Realistic Cost Model for the Communication Time in Parallel Programs,” in <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, 1996, pp. 13–27.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. “A Realistic Cost Model for the Communication Time in Parallel Programs.” In <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, 13–27. Amsterdam: IOS Press, 1996.","bibtex":"@inproceedings{Fischer_Rethmann_Wachsmann_1996, place={Amsterdam}, title={A Realistic Cost Model for the Communication Time in Parallel Programs}, booktitle={3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)}, publisher={IOS Press}, author={Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}, year={1996}, pages={13–27} }","short":"M. Fischer, J. Rethmann, A. Wachsmann, in: 3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96), IOS Press, Amsterdam, 1996, pp. 13–27.","mla":"Fischer, Matthias, et al. “A Realistic Cost Model for the Communication Time in Parallel Programs.” <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i>, IOS Press, 1996, pp. 13–27.","apa":"Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). A Realistic Cost Model for the Communication Time in Parallel Programs. In <i>3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW ’96)</i> (pp. 13–27). Amsterdam: IOS Press."},"has_accepted_license":"1","publication_identifier":{"isbn":["905199267X"]},"ddc":["000"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"In this paper we develop a model for communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. The implementation of the service network is done on a free configurable Transputer network.\r\nOur cost model describes the communication time of accesses to global variables and consists of a multi-linear function. The cost model includes the parameters packet size, send hot spot, and the number of processors accessing global variables. These parameters influence the communication time in a high degree and capture important parameters like contention.\r\nWe implement a Bitonic Sort and a Connected Components algorithm (among others) and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programmer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.\r\nFurthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on-line the optimal parameter values for an access to a global variable achieves good speed ups."}],"file":[{"content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2020-08-26T10:15:36Z","creator":"koala","date_created":"2020-08-26T10:15:36Z","file_size":285707,"file_id":"18354","access_level":"closed","file_name":"hni-1454.pdf"}],"publication":"3rd Workshop on Abstract Machine Models for Parallel and Distributed Computing (AMW '96)","title":"A Realistic Cost Model for the Communication Time in Parallel Programs","publisher":"IOS Press","date_created":"2020-07-30T14:45:12Z","year":"1996"},{"date_created":"2020-08-26T10:06:31Z","author":[{"last_name":"Fischer","id":"146","full_name":"Fischer, Matthias","first_name":"Matthias"},{"first_name":"Jochen","full_name":"Rethmann, Jochen","last_name":"Rethmann"},{"last_name":"Wachsmann","full_name":"Wachsmann, Alf","first_name":"Alf"}],"date_updated":"2022-01-06T06:53:30Z","title":"A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware","has_accepted_license":"1","citation":{"apa":"Fischer, M., Rethmann, J., &#38; Wachsmann, A. (1996). <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn.","short":"M. Fischer, J. Rethmann, A. Wachsmann, A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware, Universität Paderborn, 1996.","mla":"Fischer, Matthias, et al. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. 1996.","bibtex":"@book{Fischer_Rethmann_Wachsmann_1996, place={Universität Paderborn}, title={A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware}, author={Fischer, Matthias and Rethmann, Jochen and Wachsmann, Alf}, year={1996} }","ama":"Fischer M, Rethmann J, Wachsmann A. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn; 1996.","ieee":"M. Fischer, J. Rethmann, and A. Wachsmann, <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn, 1996.","chicago":"Fischer, Matthias, Jochen Rethmann, and Alf Wachsmann. <i>A Realistic Cost Model for the Communication Time in Parallel Programs on Parallel Computers Using a Service Hardware</i>. Universität Paderborn, 1996."},"year":"1996","place":"Universität Paderborn","user_id":"15415","department":[{"_id":"63"}],"_id":"18352","file_date_updated":"2020-08-26T10:05:35Z","language":[{"iso":"eng"}],"ddc":["000"],"type":"report","file":[{"content_type":"application/pdf","relation":"main_file","success":1,"date_created":"2020-08-26T10:05:35Z","creator":"koala","date_updated":"2020-08-26T10:05:35Z","file_name":"tr-rsfb-96-007.pdf","file_id":"18353","access_level":"closed","file_size":519632}],"status":"public","abstract":[{"text":"In this report, we develop a cost model for the communication time on parallel computers consisting of processors and a service network, i.e., a network performing services like broadcast, synchronization, and global variables. Because we do not have a parallel computer at our disposal that is equipped with a service network, we emulate the service network on a reconfigurable Transputer network.\r\nOur cost model describes the communication time of accesses to global variables and consists of a multi­linear function. The cost model includes the parameters packet size, send hot spot (the number of messages sent out by one processor), and number of processors accessing global variables. We show that these parameters influence the communication time in a high degree and capture important parameters like network contention.\r\nWe implement a Bitonic Sort, Sample Sort, Matrix Multiplication, and Connected Components algorithm, and we show that our model is able to predict the communication time within a 10% error if indirect service networks are used. The applications show that it is easy for a programer to determine the parameter values for our model and that our new cost model precisely predicts the communication time of parallel algorithms.\r\nWe explore the interaction of hot spots and asynchrony and show that the influence of hot spots to the communication time is not as high as one would expect from theoretical considerations in a synchronous model. Therefore, we do not apprehend the hot spot in our cost model.\r\nFurthermore, we minimize the communication time of accesses to global variables by finding a balance between the number of messages in the network and their size. Our model predicts the optimal values for these parameters which we validate by experiments. A modified implementation of our routing which determines on­line the optimal parameter values for an access to a global variable achieves good speed ups.\r\n","lang":"eng"}]}]