--- _id: '16299' author: - first_name: Jannik full_name: Castenow, Jannik id: '38705' last_name: Castenow - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Jonas full_name: Harbig, Jonas last_name: Harbig - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Castenow J, Fischer M, Harbig J, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science. 2020;815:289-309. doi:10.1016/j.tcs.2020.02.018 apa: Castenow, J., Fischer, M., Harbig, J., Jung, D., & Meyer auf der Heide, F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. Theoretical Computer Science, 815, 289–309. https://doi.org/10.1016/j.tcs.2020.02.018 bibtex: '@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={10.1016/j.tcs.2020.02.018}, journal={Theoretical Computer Science}, author={Castenow, Jannik and Fischer, Matthias and Harbig, Jonas and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2020}, pages={289–309} }' chicago: 'Castenow, Jannik, Matthias Fischer, Jonas Harbig, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science 815 (2020): 289–309. https://doi.org/10.1016/j.tcs.2020.02.018.' ieee: J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” Theoretical Computer Science, vol. 815, pp. 289–309, 2020. mla: Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Theoretical Computer Science, vol. 815, 2020, pp. 289–309, doi:10.1016/j.tcs.2020.02.018. short: J. Castenow, M. Fischer, J. Harbig, D. Jung, F. Meyer auf der Heide, Theoretical Computer Science 815 (2020) 289–309. date_created: 2020-03-13T12:55:53Z date_updated: 2022-01-06T06:52:48Z department: - _id: '63' doi: 10.1016/j.tcs.2020.02.018 intvolume: ' 815' language: - iso: eng page: 289-309 publication: Theoretical Computer Science publication_identifier: issn: - 0304-3975 publication_status: published status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: journal_article user_id: '38705' volume: 815 year: '2020' ... --- _id: '16337' author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Brandt S, Jähn C, Fischer M, Meyer auf der Heide F. Visibility‐Aware Progressive Farthest Point Sampling on the GPU. Computer Graphics Forum. 2019;38(7):413-424. doi:10.1111/cgf.13848 apa: Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Visibility‐Aware Progressive Farthest Point Sampling on the GPU. Computer Graphics Forum, 38(7), 413–424. https://doi.org/10.1111/cgf.13848 bibtex: '@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Visibility‐Aware Progressive Farthest Point Sampling on the GPU}, volume={38}, DOI={10.1111/cgf.13848}, number={7}, journal={Computer Graphics Forum}, author={Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2019}, pages={413–424} }' chicago: 'Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Visibility‐Aware Progressive Farthest Point Sampling on the GPU.” Computer Graphics Forum 38, no. 7 (2019): 413–24. https://doi.org/10.1111/cgf.13848.' ieee: S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Visibility‐Aware Progressive Farthest Point Sampling on the GPU,” Computer Graphics Forum, vol. 38, no. 7, pp. 413–424, 2019. mla: Brandt, Sascha, et al. “Visibility‐Aware Progressive Farthest Point Sampling on the GPU.” Computer Graphics Forum, vol. 38, no. 7, 2019, pp. 413–24, doi:10.1111/cgf.13848. short: S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, Computer Graphics Forum 38 (2019) 413–424. conference: end_date: 2019-10-17 location: Seoul, South Korea name: Pacific Graphics 2019 start_date: 2019-10-14 date_created: 2020-03-24T08:24:11Z date_updated: 2022-01-06T06:52:49Z doi: 10.1111/cgf.13848 intvolume: ' 38' issue: '7' language: - iso: eng main_file_link: - open_access: '1' url: https://onlinelibrary.wiley.com/doi/pdf/10.1111/cgf.13848 oa: '1' page: 413-424 publication: Computer Graphics Forum publication_identifier: issn: - 0167-7055 - 1467-8659 publication_status: published status: public title: Visibility‐Aware Progressive Farthest Point Sampling on the GPU type: journal_article user_id: '11648' volume: 38 year: '2019' ... --- _id: '16341' abstract: - lang: eng text: "We present a technique for rendering highly complex 3D scenes in real-time by\r\ngenerating uniformly distributed points on the scene's visible surfaces. The\r\ntechnique is applicable to a wide range of scene types, like scenes directly\r\nbased on complex and detailed CAD data consisting of billions of polygons (in\r\ncontrast to scenes handcrafted solely for visualization). This allows to\r\nvisualize such scenes smoothly even in VR on a HMD with good image quality,\r\nwhile maintaining the necessary frame-rates. In contrast to other point based\r\nrendering methods, we place points in an approximated blue noise distribution\r\nonly on visible surfaces and store them in a highly GPU efficient data\r\nstructure, allowing to progressively refine the number of rendered points to\r\nmaximize the image quality for a given target frame rate. Our evaluation shows\r\nthat scenes consisting of a high amount of polygons can be rendered with\r\ninteractive frame rates with good visual quality on standard hardware." author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: 0000-0003-3546-203X - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Brandt S, Jähn C, Fischer M, Meyer auf der Heide F. Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. arXiv:190408225. 2019. apa: Brandt, S., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2019). Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels. ArXiv:1904.08225. bibtex: '@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels}, journal={arXiv:1904.08225}, author={Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2019} }' chicago: Brandt, Sascha, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019. ieee: S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels,” arXiv:1904.08225. 2019. mla: Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive Blue Surfels.” ArXiv:1904.08225, 2019. short: S. Brandt, C. Jähn, M. Fischer, F. Meyer auf der Heide, ArXiv:1904.08225 (2019). date_created: 2020-03-24T08:59:44Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' external_id: arxiv: - '1904.08225' language: - iso: eng main_file_link: - open_access: '1' oa: '1' publication: arXiv:1904.08225 status: public title: Rendering of Complex Heterogenous Scenes using Progressive Blue Surfels type: preprint user_id: '15415' year: '2019' ... --- _id: '27403' abstract: - lang: eng text: To detect errors or find potential for improvement during the CAD-supported development of a complex technical system like modern industrial machines, the system's virtual prototype can be examined in virtual reality (VR) in the context of virtual design reviews. Besides exploring the static shape of the examined system, observing the machines' mechanics (e.g., motor-driven mechanisms) and transport routes for the material transport (e.g., via conveyor belts or chains, or rail-based transport systems) can play an equally important role in such a review. In practice it is often the case, that the relevant information about transport routes, or kinematic properties is either not consequently modeled in the CAD data or is lost during conversion processes. To significantly reduce the manual effort and costs for creating animations of the machines complex behavior with such limited input data for a design review, we present a set of algorithms to automatically determine geometrical properties of machine parts based only on their triangulated surfaces. The algorithms allow to detect the course of transport systems, the orientation of objects in 3d space, rotation axes of cylindrical objects and holes, the number of tooth of gears, as well as the tooth spacing of toothed racks. We implemented the algorithms in the VR system PADrend and applied them to animate virtual prototypes of real machines. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: 0000-0003-3546-203X - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Maria full_name: Gerges, Maria last_name: Gerges - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge citation: ama: 'Brandt S, Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatic Derivation of Geometric Properties of Components from 3D Polygon Models. In: Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1. Vol 1. ASME; 2017:91:1-91:10. doi:https://doi.org/10.1115/DETC2017-67528' apa: Brandt, S., Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components from 3D Polygon Models. Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1, 1, 91:1-91:10. https://doi.org/10.1115/DETC2017-67528 bibtex: '@inproceedings{Brandt_Jähn_Fischer_Gerges_Berssenbrügge_2017, title={Automatic Derivation of Geometric Properties of Components from 3D Polygon Models}, volume={1}, DOI={https://doi.org/10.1115/DETC2017-67528}, booktitle={Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1}, publisher={ASME}, author={Brandt, Sascha and Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}, year={2017}, pages={91:1-91:10} }' chicago: Brandt, Sascha, Claudius Jähn, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge. “Automatic Derivation of Geometric Properties of Components from 3D Polygon Models.” In Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1, 1:91:1-91:10. ASME, 2017. https://doi.org/10.1115/DETC2017-67528. ieee: 'S. Brandt, C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components from 3D Polygon Models,” in Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1, 2017, vol. 1, p. 91:1-91:10, doi: https://doi.org/10.1115/DETC2017-67528.' mla: Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components from 3D Polygon Models.” Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1, vol. 1, ASME, 2017, p. 91:1-91:10, doi:https://doi.org/10.1115/DETC2017-67528. short: 'S. Brandt, C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1, ASME, 2017, p. 91:1-91:10.' conference: name: Cleveland, USA, 6. - 9. Aug. 2017 date_created: 2021-11-12T12:14:05Z date_updated: 2022-01-06T06:57:39Z department: - _id: '676' doi: https://doi.org/10.1115/DETC2017-67528 intvolume: ' 1' language: - iso: eng page: 91:1-91:10 publication: Proceedings of the ASME 2017 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference, Band 1 publisher: ASME status: public title: Automatic Derivation of Geometric Properties of Components from 3D Polygon Models type: conference user_id: '21240' volume: 1 year: '2017' ... --- _id: '17811' abstract: - lang: eng text: "We consider a swarm of $n$ autonomous mobile robots, distributed on a\r\n2-dimensional grid. A basic task for such a swarm is the gathering process: All\r\nrobots have to gather at one (not predefined) place. A common local model for\r\nextremely simple robots is the following: The robots do not have a common\r\ncompass, only have a constant viewing radius, are autonomous and\r\nindistinguishable, can move at most a constant distance in each step, cannot\r\ncommunicate, are oblivious and do not have flags or states. The only gathering\r\nalgorithm under this robot model, with known runtime bounds, needs\r\n$\\mathcal{O}(n^2)$ rounds and works in the Euclidean plane. The underlying time\r\nmodel for the algorithm is the fully synchronous $\\mathcal{FSYNC}$ model. On\r\nthe other side, in the case of the 2-dimensional grid, the only known gathering\r\nalgorithms for the same time and a similar local model additionally require a\r\nconstant memory, states and \"flags\" to communicate these states to neighbors in\r\nviewing range. They gather in time $\\mathcal{O}(n)$.\r\n In this paper we contribute the (to the best of our knowledge) first\r\ngathering algorithm on the grid that works under the same simple local model as\r\nthe above mentioned Euclidean plane strategy, i.e., without memory (oblivious),\r\n\"flags\" and states. We prove its correctness and an $\\mathcal{O}(n^2)$ time\r\nbound in the fully synchronous $\\mathcal{FSYNC}$ time model. This time bound\r\nmatches the time bound of the best known algorithm for the Euclidean plane\r\nmentioned above. We say gathering is done if all robots are located within a\r\n$2\\times 2$ square, because in $\\mathcal{FSYNC}$ such configurations cannot be\r\nsolved." author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. arXiv:170203400. 2017. apa: Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. ArXiv:1702.03400. bibtex: '@article{Fischer_Jung_Meyer auf der Heide_2017, title={Gathering Anonymous, Oblivious Robots on a Grid}, journal={arXiv:1702.03400}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2017} }' chicago: Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017. ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” arXiv:1702.03400. 2017. mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” ArXiv:1702.03400, 2017. short: M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1702.03400 (2017). date_created: 2020-08-11T13:48:38Z date_updated: 2022-01-06T06:53:20Z department: - _id: '63' language: - iso: eng publication: arXiv:1702.03400 status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: preprint user_id: '15415' year: '2017' ... --- _id: '16338' abstract: - lang: eng text: To detect errors or find potential for improvement during the CAD-supported development of a complex technical system like modern industrial machines, the system’s virtual prototype can be examined in virtual reality (VR) in the context of virtual design reviews. Besides exploring the static shape of the examined system, observing the machines’ mechanics (e.g., motor-driven mechanisms) and transport routes for the material transport (e.g., via conveyor belts or chains, or rail-based transport systems) can play an equally important role in such a review. In practice it is often the case, that the relevant information about transport routes, or kinematic properties is either not consequently modeled in the CAD data or is lost during conversion processes. To significantly reduce the manual effort and costs for creating animations of the machines complex behavior with such limited input data for a design review, we present a set of algorithms to automatically determine geometrical properties of machine parts based only on their triangulated surfaces. The algorithms allow to detect the course of transport systems, the orientation of objects in 3d space, rotation axes of cylindrical objects and holes, the number of tooth of gears, as well as the tooth spacing of toothed racks. We implemented the algorithms in the VR system PADrend and applied them to animate virtual prototypes of real machines. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Maria full_name: Gerges, Maria last_name: Gerges - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge citation: ama: 'Brandt S, Fischer M, Gerges M, Jähn C, Berssenbrügge J. Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In: Volume 1: 37th Computers and Information in Engineering Conference. Vol 1. ; 2017:91:1-91:10. doi:10.1115/detc2017-67528' apa: 'Brandt, S., Fischer, M., Gerges, M., Jähn, C., & Berssenbrügge, J. (2017). Automatic Derivation of Geometric Properties of Components From 3D Polygon Models. In Volume 1: 37th Computers and Information in Engineering Conference (Vol. 1, pp. 91:1-91:10). Cleveland, USA. https://doi.org/10.1115/detc2017-67528' bibtex: '@inproceedings{Brandt_Fischer_Gerges_Jähn_Berssenbrügge_2017, title={Automatic Derivation of Geometric Properties of Components From 3D Polygon Models}, volume={1}, DOI={10.1115/detc2017-67528}, booktitle={Volume 1: 37th Computers and Information in Engineering Conference}, author={Brandt, Sascha and Fischer, Matthias and Gerges, Maria and Jähn, Claudius and Berssenbrügge, Jan}, year={2017}, pages={91:1-91:10} }' chicago: 'Brandt, Sascha, Matthias Fischer, Maria Gerges, Claudius Jähn, and Jan Berssenbrügge. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” In Volume 1: 37th Computers and Information in Engineering Conference, 1:91:1-91:10, 2017. https://doi.org/10.1115/detc2017-67528.' ieee: 'S. Brandt, M. Fischer, M. Gerges, C. Jähn, and J. Berssenbrügge, “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models,” in Volume 1: 37th Computers and Information in Engineering Conference, Cleveland, USA, 2017, vol. 1, pp. 91:1-91:10.' mla: 'Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.” Volume 1: 37th Computers and Information in Engineering Conference, vol. 1, 2017, pp. 91:1-91:10, doi:10.1115/detc2017-67528.' short: 'S. Brandt, M. Fischer, M. Gerges, C. Jähn, J. Berssenbrügge, in: Volume 1: 37th Computers and Information in Engineering Conference, 2017, pp. 91:1-91:10.' conference: end_date: 2017-08-09 location: Cleveland, USA name: 37th Computers and Information in Engineering Conference start_date: 2017-08-06 date_created: 2020-03-24T08:36:05Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1115/detc2017-67528 intvolume: ' 1' language: - iso: eng page: 91:1-91:10 publication: 'Volume 1: 37th Computers and Information in Engineering Conference' publication_identifier: isbn: - '9780791858110' publication_status: published status: public title: Automatic Derivation of Geometric Properties of Components From 3D Polygon Models type: conference user_id: '15415' volume: 1 year: '2017' ... --- _id: '16339' abstract: - lang: ger text: In der CAD-unterstützten Entwicklung von technischen Systemen (Maschinen, Anlagen etc.) werden virtuelle Prototypen im Rahmen eines virtuellen Design-Reviews mit Hilfe eines VR-Systems gesamtheitlich betrachtet, um frühzeitig Fehler und Verbesserungsbedarf zu erkennen. Ein wichtiger Untersuchungsgegenstand ist dabei die Analyse von Transportwegen für den Materialtransport mittels Fließbändern, Förderketten oder schienenbasierten Transportsystemen. Diese Transportwege werden im VR-System animiert. Problematisch dabei ist, dass derartige Transportsysteme im zugrundeliegenden CAD-Modell in der Praxis oft nicht modelliert und nur exemplarisch angedeutet werden, da diese für die Konstruktion nicht relevant sind (z.B. der Fördergurt eines Förderbandes, oder die Kette einer Förderkette), oder die Informationen über den Verlauf bei der Konvertierung der Daten in das VR-System verloren gehen. Bei der Animation dieser Transportsysteme in einem VR-System muss der Transportweg also aufwändig, manuell nachgearbeitet werden. Das Ziel dieser Arbeit ist die Reduzierung des notwendigen manuellen Nachbearbeitungsaufwandes für das Design-Review durch eine automatische Berechnung der Animationspfade entlang eines Transportsystems. Es wird ein Algorithmus vorgestellt, der es ermöglicht mit nur geringem zeitlichem Benutzeraufwand den Animationspfad aus den reinen polygonalen dreidimensionalen Daten eines Transportsystems automatisch zu rekonstruieren. author: - first_name: Sascha full_name: Brandt, Sascha id: '11648' last_name: Brandt orcid: https://orcid.org/0000-0003-3546-203X - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Brandt S, Fischer M. Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2017:415-427.' apa: 'Brandt, S., & Fischer, M. (2017). Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell. In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 (Vol. 369, pp. 415–427). Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.' bibtex: '@inproceedings{Brandt_Fischer_2017, place={Paderborn}, title={Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell}, volume={369}, booktitle={Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Brandt, Sascha and Fischer, Matthias}, year={2017}, pages={415–427} }' chicago: 'Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” In Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, 369:415–27. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017.' ieee: S. Brandt and M. Fischer, “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell,” in Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Paderborn, 2017, vol. 369, pp. 415–427. mla: Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell.” Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, vol. 369, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2017, pp. 415–27. short: 'S. Brandt, M. Fischer, in: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Paderborn, 2017, pp. 415–427.' conference: end_date: 2017-05-12 location: Paderborn name: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 start_date: 2017-05-11 date_created: 2020-03-24T08:44:25Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' intvolume: ' 369' language: - iso: ger page: 415-427 place: Paderborn publication: Wissenschaftsforum Intelligente Technische Systeme (WInTeSys) 2017 publication_status: published publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Automatische Ableitung der Transportwege von Transportsystemen aus dem 3D-Polygonmodell type: conference user_id: '11648' volume: 369 year: '2017' ... --- _id: '16347' author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Fischer M, Jung D, Meyer auf der Heide F. Gathering Anonymous, Oblivious Robots on a Grid. In: Fernández Anta A, Jurdzinski T, Mosteiro MA, Zhang Y, eds. Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}. Vol 10718. Lecture Notes in Computer Science. Vienna, Austria: Springer; 2017:168-181. doi:10.1007/978-3-319-72751-6_13' apa: 'Fischer, M., Jung, D., & Meyer auf der Heide, F. (2017). Gathering Anonymous, Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro, & Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. https://doi.org/10.1007/978-3-319-72751-6_13' bibtex: '@inproceedings{Fischer_Jung_Meyer auf der Heide_2017, place={Vienna, Austria}, series={Lecture Notes in Computer Science}, title={Gathering Anonymous, Oblivious Robots on a Grid}, volume={10718}, DOI={10.1007/978-3-319-72751-6_13}, booktitle={Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}}, publisher={Springer}, author={Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, editor={Fernández Anta, Antonio and Jurdzinski, Tomasz and Mosteiro, Miguel A. and Zhang, YanyongEditors}, year={2017}, pages={168–181}, collection={Lecture Notes in Computer Science} }' chicago: 'Fischer, Matthias, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering Anonymous, Oblivious Robots on a Grid.” In Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta, Tomasz Jurdzinski, Miguel A. Mosteiro, and Yanyong Zhang, 10718:168–81. Lecture Notes in Computer Science. Vienna, Austria: Springer, 2017. https://doi.org/10.1007/978-3-319-72751-6_13.' ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious Robots on a Grid,” in Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, 2017, vol. 10718, pp. 168–181. mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.” Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, edited by Antonio Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:10.1007/978-3-319-72751-6_13. short: 'M. Fischer, D. Jung, F. Meyer auf der Heide, in: A. Fernández Anta, T. Jurdzinski, M.A. Mosteiro, Y. Zhang (Eds.), Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}, Springer, Vienna, Austria, 2017, pp. 168–181.' date_created: 2020-03-27T14:32:39Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1007/978-3-319-72751-6_13 editor: - first_name: Antonio full_name: Fernández Anta, Antonio last_name: Fernández Anta - first_name: Tomasz full_name: Jurdzinski, Tomasz last_name: Jurdzinski - first_name: Miguel A. full_name: Mosteiro, Miguel A. last_name: Mosteiro - first_name: Yanyong full_name: Zhang, Yanyong last_name: Zhang intvolume: ' 10718' language: - iso: eng page: 168-181 place: Vienna, Austria publication: Algorithms for Sensor Systems - 13th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS} publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Gathering Anonymous, Oblivious Robots on a Grid type: conference user_id: '15415' volume: 10718 year: '2017' ... --- _id: '16450' abstract: - lang: eng text: "In this paper, we solve the local gathering problem of a swarm of $n$\r\nindistinguishable, point-shaped robots on a two dimensional grid in\r\nasymptotically optimal time $\\mathcal{O}(n)$ in the fully synchronous\r\n$\\mathcal{FSYNC}$ time model. Given an arbitrarily distributed (yet connected)\r\nswarm of robots, the gathering problem on the grid is to locate all robots\r\nwithin a $2\\times 2$-sized area that is not known beforehand. Two robots are\r\nconnected if they are vertical or horizontal neighbors on the grid. The\r\nlocality constraint means that no global control, no compass, no global\r\ncommunication and only local vision is available; hence, a robot can only see\r\nits grid neighbors up to a constant $L_1$-distance, which also limits its\r\nmovements. A robot can move to one of its eight neighboring grid cells and if\r\ntwo or more robots move to the same location they are \\emph{merged} to be only\r\none robot. The locality constraint is the significant challenging issue here,\r\nsince robot movements must not harm the (only globally checkable) swarm\r\nconnectivity. For solving the gathering problem, we provide a synchronous\r\nalgorithm -- executed by every robot -- which ensures that robots merge without\r\nbreaking the swarm connectivity. In our model, robots can obtain a special\r\nstate, which marks such a robot to be performing specific connectivity\r\npreserving movements in order to allow later merge operations of the swarm.\r\nCompared to the grid, for gathering in the Euclidean plane for the same robot\r\nand time model the best known upper bound is $\\mathcal{O}(n^2)$." author: - first_name: 'Andreas ' full_name: 'Cord-Landwehr, Andreas ' last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. arXiv:160203303. 2016. apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. ArXiv:1602.03303. bibtex: '@article{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, journal={arXiv:1602.03303}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016} }' chicago: Cord-Landwehr, Andreas , Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016. ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” arXiv:1602.03303. 2016. mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” ArXiv:1602.03303, 2016. short: A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1602.03303 (2016). date_created: 2020-04-07T07:20:47Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1602.03303' language: - iso: eng publication: arXiv:1602.03303 status: public title: Asymptotically Optimal Gathering on a Grid type: preprint user_id: '15415' year: '2016' ... --- _id: '16351' abstract: - lang: eng text: "Defining, measuring, and comparing the quality and efficiency of rendering algorithms in computer graphics is a demanding challenge: quality measures are often application specific and efficiency is strongly influenced by properties of the rendered scene and the used hardware. We survey the currently employed evaluation methods for AQ1 the development process of rendering algorithms. Then, we present our PADrend framework, which supports systematic and flexible development, evaluation, adaptation, and comparison of rendering algorithms, and provides a comfortable and easy-to-use platform for developers of rendering algorithms. The system includes a new evaluation method to improve the objectivity of experimental evaluations of rendering algorithms.\r\n" author: - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide - first_name: Ralf full_name: Petring, Ralf last_name: Petring citation: ama: 'Fischer M, Jähn C, Meyer auf der Heide F, Petring R. Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In: Kliemann L, Sanders P, eds. Algorithm Engineering. Vol 9220. LNCS. Springer; 2016:226-244. doi:10.1007/978-3-319-49487-6_7 ' apa: Fischer, M., Jähn, C., Meyer auf der Heide, F., & Petring, R. (2016). Algorithm Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann & P. Sanders (Eds.), Algorithm Engineering (Vol. 9220, pp. 226–244). Springer. https://doi.org/10.1007/978-3-319-49487-6_7 bibtex: '@inproceedings{Fischer_Jähn_Meyer auf der Heide_Petring_2016, series={LNCS}, title={Algorithm Engineering Aspects of Real-Time Rendering Algorithms}, volume={9220}, DOI={10.1007/978-3-319-49487-6_7 }, booktitle={Algorithm Engineering}, publisher={Springer}, author={Fischer, Matthias and Jähn, Claudius and Meyer auf der Heide, Friedhelm and Petring, Ralf}, editor={Kliemann, Lasse and Sanders, PeterEditors}, year={2016}, pages={226–244}, collection={LNCS} }' chicago: Fischer, Matthias, Claudius Jähn, Friedhelm Meyer auf der Heide, and Ralf Petring. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” In Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, 9220:226–44. LNCS. Springer, 2016. https://doi.org/10.1007/978-3-319-49487-6_7 . ieee: M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering Aspects of Real-Time Rendering Algorithms,” in Algorithm Engineering, 2016, vol. 9220, pp. 226–244. mla: Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering Algorithms.” Algorithm Engineering, edited by Lasse Kliemann and Peter Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:10.1007/978-3-319-49487-6_7 . short: 'M. Fischer, C. Jähn, F. Meyer auf der Heide, R. Petring, in: L. Kliemann, P. Sanders (Eds.), Algorithm Engineering, Springer, 2016, pp. 226–244.' date_created: 2020-03-30T10:21:53Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: '10.1007/978-3-319-49487-6_7 ' editor: - first_name: Lasse full_name: Kliemann, Lasse last_name: Kliemann - first_name: Peter full_name: Sanders, Peter last_name: Sanders intvolume: ' 9220' language: - iso: eng page: 226-244 publication: Algorithm Engineering publisher: Springer series_title: LNCS status: public title: Algorithm Engineering Aspects of Real-Time Rendering Algorithms type: conference user_id: '15415' volume: 9220 year: '2016' ... --- _id: '16359' abstract: - lang: eng text: In this paper, we solve the local gathering problem of a swarm of n indistinguishable, point-shaped robots on a two dimensional grid in asymptotically optimal time O(n) in the fully synchronous FSYNC time model. Given an arbitrarily distributed (yet connected) swarm of robots, the gathering problem on the grid is to locate all robots within a 2x2- sized area that is not known beforehand. Two robots are connected if they are vertical or horizontal neighbors on the grid. The locality constraint means that no global control, no compass, no global communication and only local vision is available; hence, a robot can only see its grid neighbors up to a constant L1-distance, which also limits its movements. A robot can move to one of its eight neighboring grid cells and if two or more robots move to the same location they are merged to be only one robot. The locality constraint is the significant challenging issue here, since robot move- ments must not harm the (only globally checkable) swarm connectivity. For solving the gathering problem, we provide a synchronous algorithm { executed by every robot { which ensures that robots merge without breaking the swarm con- nectivity. In our model, robots can obtain a special state, which marks such a robot to be performing specific connec- tivity preserving movements in order to allow later merge operations of the swarm. Compared to the grid, for gath- ering in the Euclidean plane for the same robot and time model the best known upper bound is O(n^2). author: - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Asymptotically Optimal Gathering on a Grid. In: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA). ACM; 2016:301-312. doi:10.1145/2935764.2935789' apa: Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Asymptotically Optimal Gathering on a Grid. In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) (pp. 301–312). ACM. https://doi.org/10.1145/2935764.2935789 bibtex: '@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically Optimal Gathering on a Grid}, DOI={10.1145/2935764.2935789}, booktitle={Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)}, publisher={ACM}, author={Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={301–312} }' chicago: Cord-Landwehr, Andreas, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Asymptotically Optimal Gathering on a Grid.” In Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 301–12. ACM, 2016. https://doi.org/10.1145/2935764.2935789. ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically Optimal Gathering on a Grid,” in Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2016, pp. 301–312. mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.” Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–12, doi:10.1145/2935764.2935789. short: 'A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), ACM, 2016, pp. 301–312.' date_created: 2020-04-01T12:46:35Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1145/2935764.2935789 language: - iso: eng page: 301-312 publication: Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) publisher: ACM status: public title: Asymptotically Optimal Gathering on a Grid type: conference user_id: '15415' year: '2016' ... --- _id: '16360' abstract: - lang: eng text: 'We consider the following variant of the two dimensional gathering problem for swarms of robots: Given a swarm of n indistinguishable, point shaped robots on a two dimensional grid. Initially, the robots form a closed chain on the grid and must keep this connectivity during the whole process of their gathering. Connectivity means, that neighboring robots of the chain need to be positioned at the same or neighboring points of the grid. In our model, gathering means to keep shortening the chain until the robots are located inside a 2*2 subgrid. Our model is completely local (no global control, no global coordinates, no compass, no global communication or vision, ...). Each robot can only see its next constant number of left and right neighbors on the chain. This fixed constant is called the viewing path length. All its operations and detections are restricted to this constant number of robots. Other robots, even if located at neighboring or the same grid point cannot be detected. Only based on the relative positions of its detectable chain neighbors, a robot can decide to obtain a certain state. Based on this state and their local knowledge, the robots do local modifications to the chain by moving to neighboring grid points without breaking the chain. These modifications are performed without the knowledge whether they lead to a global progress or not. We assume the fully synchronous FSYNC model. For this problem, we present a gathering algorithm which needs linear time. This result generalizes a result, where an open chain with specified distinguishable (and fixed) endpoints is considered. ' author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: Andreas full_name: Cord-Landwehr, Andreas last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. In: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS). IEEE; 2016:689-699. doi:10.1109/IPDPS.2016.51' apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) (pp. 689–699). IEEE. https://doi.org/10.1109/IPDPS.2016.51 bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Gathering a Closed Chain of Robots on a Grid}, DOI={10.1109/IPDPS.2016.51}, booktitle={Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS)}, publisher={IEEE}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2016}, pages={689–699} }' chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” In Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 689–99. IEEE, 2016. https://doi.org/10.1109/IPDPS.2016.51. ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” in Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), 2016, pp. 689–699. mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–99, doi:10.1109/IPDPS.2016.51. short: 'S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, in: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS), IEEE, 2016, pp. 689–699.' date_created: 2020-04-01T12:56:43Z date_updated: 2022-01-06T06:52:49Z department: - _id: '63' doi: 10.1109/IPDPS.2016.51 language: - iso: eng page: 689-699 publication: Proceedings of the 30th International Parallel and Distributed Processing Symposium (IPDPS) publisher: IEEE status: public title: Gathering a Closed Chain of Robots on a Grid type: conference user_id: '15415' year: '2016' ... --- _id: '28318' author: - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge - first_name: Olga full_name: Wiederkehr, Olga last_name: Wiederkehr - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Band 342 . Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.' apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Band 342 , 65–78. bibtex: '@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn}, title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342 }, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }' chicago: 'Berssenbrügge, Jan, Olga Wiederkehr, Claudius Jähn, and Matthias Fischer. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Band 342 , 65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.' ieee: J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342 , 2015, pp. 65–78. mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Band 342 , Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 65–78. short: 'J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Band 342 , Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.' date_created: 2021-12-06T09:56:27Z date_updated: 2022-01-06T06:58:01Z department: - _id: '676' language: - iso: eng page: 65-78 place: Paderborn publication: '12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342 ' publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme type: conference user_id: '21240' year: '2015' ... --- _id: '28322' author: - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Maria full_name: Gerges, Maria last_name: Gerges - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge citation: ama: 'Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.' apa: Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342, 107–120. bibtex: '@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn}, title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }' chicago: 'Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge. “Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.” In 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342, 107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.' ieee: C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342, 2015, pp. 107–120. mla: Jähn, Claudius, et al. “Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.” 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 107–20. short: 'C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.' date_created: 2021-12-06T10:20:23Z date_updated: 2022-01-06T06:58:01Z department: - _id: '676' language: - iso: ger page: 107-120 place: Paderborn publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, Band 342 publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell type: conference user_id: '21240' year: '2015' ... --- _id: '17425' author: - first_name: 'Jan ' full_name: 'Berssenbrügge, Jan ' last_name: Berssenbrügge - first_name: Olga full_name: Wiederkehr, Olga last_name: Wiederkehr - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.' apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 343, 65–78. bibtex: '@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, place={Paderborn}, title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}, volume={343}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }' chicago: 'Berssenbrügge, Jan , Olga Wiederkehr, Claudius Jähn, and Matthias Fischer. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 343:65–78. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.' ieee: J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2015, vol. 343, pp. 65–78. mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 343, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 65–78. short: 'J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.' date_created: 2020-07-28T09:49:42Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' intvolume: ' 343' language: - iso: eng page: 65-78 place: Paderborn publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme type: conference user_id: '15415' volume: 343 year: '2015' ... --- _id: '17427' author: - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Maria full_name: Gerges, Maria last_name: Gerges - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge citation: ama: 'Jähn C, Fischer M, Gerges M, Berssenbrügge J. Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.' apa: Jähn, C., Fischer, M., Gerges, M., & Berssenbrügge, J. (2015). Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell. 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 342, 107–120. bibtex: '@inproceedings{Jähn_Fischer_Gerges_Berssenbrügge_2015, place={Paderborn}, title={Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell}, volume={342}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Jähn, Claudius and Fischer, Matthias and Gerges, Maria and Berssenbrügge, Jan}, year={2015}, pages={107–120} }' chicago: 'Jähn, Claudius, Matthias Fischer, Maria Gerges, and Jan Berssenbrügge. “Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 342:107–20. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015.' ieee: C. Jähn, M. Fischer, M. Gerges, and J. Berssenbrügge, “Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2015, vol. 342, pp. 107–120. mla: Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften von Bauteilen Aus Dem 3-D-Polygonmodell.” 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2015, pp. 107–20. short: 'C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 107–120.' date_created: 2020-07-28T10:23:18Z date_updated: 2022-01-06T06:53:11Z department: - _id: '63' - _id: '26' intvolume: ' 342' language: - iso: eng page: 107-120 place: Paderborn publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Automatische Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell type: conference user_id: '15415' volume: 342 year: '2015' ... --- _id: '23070' author: - first_name: Jan full_name: Berssenbrügge, Jan last_name: Berssenbrügge - first_name: Olga full_name: Wiederkehr, Olga last_name: Wiederkehr - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer citation: ama: 'Berssenbrügge J, Wiederkehr O, Jähn C, Fischer M. Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. In: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2015:65-78.' apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., & Fischer, M. (2015). Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme. In 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 342, pp. 65–78). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn. bibtex: '@inproceedings{Berssenbrügge_Wiederkehr_Jähn_Fischer_2015, title={Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme}, volume={342}, booktitle={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn}, author={Berssenbrügge, Jan and Wiederkehr, Olga and Jähn, Claudius and Fischer, Matthias}, year={2015}, pages={65–78} }' chicago: Berssenbrügge, Jan, Olga Wiederkehr, Claudius Jähn, and Matthias Fischer. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” In 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 342:65–78. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015. ieee: J. Berssenbrügge, O. Wiederkehr, C. Jähn, and M. Fischer, “Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme,” in 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2015, vol. 342, pp. 65–78. mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle Intelligenter Technischer Systeme.” 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 342, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78. short: 'J. Berssenbrügge, O. Wiederkehr, C. Jähn, M. Fischer, in: 12. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2015, pp. 65–78.' date_created: 2021-08-09T06:42:37Z date_updated: 2022-01-06T06:55:45Z department: - _id: '153' intvolume: ' 342' language: - iso: eng page: 65-78 publication: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn status: public title: Anbindung des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme type: conference user_id: '24876' volume: 342 year: '2015' ... --- _id: '16449' abstract: - lang: eng text: "We consider the following variant of the two dimensional gathering problem\r\nfor swarms of robots: Given a swarm of $n$ indistinguishable, point shaped\r\nrobots on a two dimensional grid. Initially, the robots form a closed chain on\r\nthe grid and must keep this connectivity during the whole process of their\r\ngathering. Connectivity means, that neighboring robots of the chain need to be\r\npositioned at the same or neighboring points of the grid. In our model,\r\ngathering means to keep shortening the chain until the robots are located\r\ninside a $2\\times 2$ subgrid. Our model is completely local (no global control,\r\nno global coordinates, no compass, no global communication or vision, \\ldots).\r\nEach robot can only see its next constant number of left and right neighbors on\r\nthe chain. This fixed constant is called the \\emph{viewing path length}. All\r\nits operations and detections are restricted to this constant number of robots.\r\nOther robots, even if located at neighboring or the same grid point cannot be\r\ndetected. Only based on the relative positions of its detectable chain\r\nneighbors, a robot can decide to obtain a certain state. Based on this state\r\nand their local knowledge, the robots do local modifications to the chain by\r\nmoving to neighboring grid points without breaking the chain. These\r\nmodifications are performed without the knowledge whether they lead to a global\r\nprogress or not. We assume the fully synchronous $\\mathcal{FSYNC}$ model. For\r\nthis problem, we present a gathering algorithm which needs linear time. This\r\nresult generalizes the result from \\cite{hopper}, where an open chain with\r\nspecified distinguishable (and fixed) endpoints is considered." author: - first_name: Sebastian full_name: Abshoff, Sebastian last_name: Abshoff - first_name: 'Andreas ' full_name: 'Cord-Landwehr, Andreas ' last_name: Cord-Landwehr - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Daniel full_name: Jung, Daniel id: '37827' last_name: Jung - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: Abshoff S, Cord-Landwehr A, Fischer M, Jung D, Meyer auf der Heide F. Gathering a Closed Chain of Robots on a Grid. arXiv:151005454. 2015. apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., & Meyer auf der Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. ArXiv:1510.05454. bibtex: '@article{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2015, title={Gathering a Closed Chain of Robots on a Grid}, journal={arXiv:1510.05454}, author={Abshoff, Sebastian and Cord-Landwehr, Andreas and Fischer, Matthias and Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }' chicago: Abshoff, Sebastian, Andreas Cord-Landwehr, Matthias Fischer, Daniel Jung, and Friedhelm Meyer auf der Heide. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015. ieee: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering a Closed Chain of Robots on a Grid,” arXiv:1510.05454. 2015. mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.” ArXiv:1510.05454, 2015. short: S. Abshoff, A. Cord-Landwehr, M. Fischer, D. Jung, F. Meyer auf der Heide, ArXiv:1510.05454 (2015). date_created: 2020-04-07T07:20:46Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' external_id: arxiv: - '1510.05454' language: - iso: eng publication: arXiv:1510.05454 status: public title: Gathering a Closed Chain of Robots on a Grid type: preprint user_id: '15415' year: '2015' ... --- _id: '17439' 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. author: - first_name: Ralf full_name: Petring, Ralf last_name: Petring - first_name: Benjamin full_name: Eikel, Benjamin last_name: Eikel - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Darstellung heterogener 3-D-Szenen in Echtzeit. In: 11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.' apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 311, pp. 49--60). Paderborn. 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 & 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} }' chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In 11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, 311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013. ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung heterogener 3-D-Szenen in Echtzeit,” in 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung, 2013, vol. 311, pp. 49--60. mla: Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” 11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, vol. 311, 2013, pp. 49--60. short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung, Paderborn, 2013, pp. 49--60.' date_created: 2020-07-29T08:55:43Z date_updated: 2022-01-06T06:53:12Z department: - _id: '63' intvolume: ' 311' language: - iso: eng page: 49--60 place: Paderborn publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts status: public title: Darstellung heterogener 3-D-Szenen in Echtzeit type: conference user_id: '15415' volume: 311 year: '2013' ... --- _id: '16393' 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. author: - first_name: Benjamin full_name: Eikel, Benjamin last_name: Eikel - first_name: Claudius full_name: Jähn, Claudius last_name: Jähn - first_name: Matthias full_name: Fischer, Matthias id: '146' last_name: Fischer - first_name: Friedhelm full_name: Meyer auf der Heide, Friedhelm id: '15523' last_name: Meyer auf der Heide citation: ama: 'Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Spherical Visibility Sampling. In: Computer Graphics Forum. Vol 32. Proceedings of the 24th Eurographics Symposium on Rendering. ; 2013:49-58. doi:10.1111/cgf.12150' apa: Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Spherical Visibility Sampling. In Computer Graphics Forum (Vol. 32, pp. 49–58). https://doi.org/10.1111/cgf.12150 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={10.1111/cgf.12150}, 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} }' chicago: Eikel, Benjamin, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf der Heide. “Spherical Visibility Sampling.” In Computer Graphics Forum, 32:49–58. Proceedings of the 24th Eurographics Symposium on Rendering, 2013. https://doi.org/10.1111/cgf.12150. ieee: B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Spherical Visibility Sampling,” in Computer Graphics Forum, 2013, vol. 32, no. 4, pp. 49–58. mla: Eikel, Benjamin, et al. “Spherical Visibility Sampling.” Computer Graphics Forum, vol. 32, no. 4, 2013, pp. 49–58, doi:10.1111/cgf.12150. short: 'B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Computer Graphics Forum, 2013, pp. 49–58.' date_created: 2020-04-03T07:48:48Z date_updated: 2022-01-06T06:52:50Z department: - _id: '63' doi: 10.1111/cgf.12150 intvolume: ' 32' issue: '4' language: - iso: eng page: 49-58 publication: Computer Graphics Forum publication_identifier: issn: - 0167-7055 publication_status: published series_title: Proceedings of the 24th Eurographics Symposium on Rendering status: public title: Spherical Visibility Sampling type: conference user_id: '15415' volume: 32 year: '2013' ...