---
_id: '60194'
article_type: original
author:
- first_name: Hendrik
  full_name: Peeters, Hendrik
  id: '49942'
  last_name: Peeters
  orcid: https://orcid.org/ 0000-0002-7143-3781
- first_name: Jan-Luca
  full_name: Hansel, Jan-Luca
  id: '69242'
  last_name: Hansel
- first_name: André
  full_name: Graute, André
  id: '13662'
  last_name: Graute
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Christian
  full_name: Weinberger, Christian
  id: '11848'
  last_name: Weinberger
- first_name: Iris
  full_name: Neiske, Iris
  id: '53827'
  last_name: Neiske
- first_name: Sabine
  full_name: Fechner, Sabine
  id: '54823'
  last_name: Fechner
  orcid: 0000-0001-5645-5870
citation:
  ama: Peeters H, Hansel J-L, Graute A, et al. Virtual Reality trifft Künstliche Intelligenz.
    KI unterstützt bei virtueller Praktikumsvorbereitung. <i>Laborpraxis</i>. 2025;(5-6):22-25.
  apa: Peeters, H., Hansel, J.-L., Graute, A., Fischer, M., Weinberger, C., Neiske,
    I., &#38; Fechner, S. (2025). Virtual Reality trifft Künstliche Intelligenz. KI
    unterstützt bei virtueller Praktikumsvorbereitung. <i>Laborpraxis</i>, <i>5–6</i>,
    22–25.
  bibtex: '@article{Peeters_Hansel_Graute_Fischer_Weinberger_Neiske_Fechner_2025,
    title={Virtual Reality trifft Künstliche Intelligenz. KI unterstützt bei virtueller
    Praktikumsvorbereitung}, number={5–6}, journal={Laborpraxis}, author={Peeters,
    Hendrik and Hansel, Jan-Luca and Graute, André and Fischer, Matthias and Weinberger,
    Christian and Neiske, Iris and Fechner, Sabine}, year={2025}, pages={22–25} }'
  chicago: 'Peeters, Hendrik, Jan-Luca Hansel, André Graute, Matthias Fischer, Christian
    Weinberger, Iris Neiske, and Sabine Fechner. “Virtual Reality trifft Künstliche
    Intelligenz. KI unterstützt bei virtueller Praktikumsvorbereitung.” <i>Laborpraxis</i>,
    no. 5–6 (2025): 22–25.'
  ieee: H. Peeters <i>et al.</i>, “Virtual Reality trifft Künstliche Intelligenz.
    KI unterstützt bei virtueller Praktikumsvorbereitung,” <i>Laborpraxis</i>, no.
    5–6, pp. 22–25, 2025.
  mla: Peeters, Hendrik, et al. “Virtual Reality trifft Künstliche Intelligenz. KI
    unterstützt bei virtueller Praktikumsvorbereitung.” <i>Laborpraxis</i>, no. 5–6,
    2025, pp. 22–25.
  short: H. Peeters, J.-L. Hansel, A. Graute, M. Fischer, C. Weinberger, I. Neiske,
    S. Fechner, Laborpraxis (2025) 22–25.
date_created: 2025-06-12T10:46:15Z
date_updated: 2025-12-14T00:02:32Z
department:
- _id: '386'
issue: 5-6
language:
- iso: ger
main_file_link:
- open_access: '1'
  url: https://issuu.com/docs/26f3a2d235d0ffc8c54ff6721d3de068?fr=sMzU0NjgyNjAxMTk
oa: '1'
page: 22-25
publication: Laborpraxis
publication_status: published
status: public
title: Virtual Reality trifft Künstliche Intelligenz. KI unterstützt bei virtueller
  Praktikumsvorbereitung
type: journal_article
user_id: '54823'
year: '2025'
...
---
_id: '57769'
author:
- first_name: Hendrik
  full_name: Peeters, Hendrik
  id: '49942'
  last_name: Peeters
  orcid: https://orcid.org/ 0000-0002-7143-3781
- first_name: André
  full_name: Graute, André
  id: '13662'
  last_name: Graute
- first_name: Jan-Luca
  full_name: Hansel, Jan-Luca
  id: '69242'
  last_name: Hansel
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Sabine
  full_name: Fechner, Sabine
  id: '54823'
  last_name: Fechner
  orcid: 0000-0001-5645-5870
citation:
  ama: 'Peeters H, Graute A, Hansel J-L, Fischer M, Fechner S. VirtuChemLab - Ein
    VR-Unterstützungsformat zur Vorbereitung auf das reale Chemielabor. In: Herzig
    B, Eickelmann B, Schwabl F, Schulze J, Niemann J, eds. <i>Lehrkräftebildung in
    der digitalen Welt - Zukunftsorientierte Forschungs- und Praxisperspektiven</i>.
    Vol 1. 1st ed. Paderborner Beiträge zur Bildungsforschung und Lehrkräftebildung.
    Waxmann; 2024:241-252. doi:<a href="https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936">https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936</a>'
  apa: Peeters, H., Graute, A., Hansel, J.-L., Fischer, M., &#38; Fechner, S. (2024).
    VirtuChemLab - Ein VR-Unterstützungsformat zur Vorbereitung auf das reale Chemielabor.
    In B. Herzig, B. Eickelmann, F. Schwabl, J. Schulze, &#38; J. Niemann (Eds.),
    <i>Lehrkräftebildung in der digitalen Welt - Zukunftsorientierte Forschungs- und
    Praxisperspektiven</i> (1st ed., Vol. 1, pp. 241–252). Waxmann. <a href="https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936">https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936</a>
  bibtex: '@inbook{Peeters_Graute_Hansel_Fischer_Fechner_2024, edition={1}, series={Paderborner
    Beiträge zur Bildungsforschung und Lehrkräftebildung}, title={VirtuChemLab - Ein
    VR-Unterstützungsformat zur Vorbereitung auf das reale Chemielabor}, volume={1},
    DOI={<a href="https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936">https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936</a>},
    booktitle={Lehrkräftebildung in der digitalen Welt - Zukunftsorientierte Forschungs-
    und Praxisperspektiven}, publisher={Waxmann}, author={Peeters, Hendrik and Graute,
    André and Hansel, Jan-Luca and Fischer, Matthias and Fechner, Sabine}, editor={Herzig,
    Bardo and Eickelmann, Birgit and Schwabl, Franziska and Schulze, Johanna and Niemann,
    Jan}, year={2024}, pages={241–252}, collection={Paderborner Beiträge zur Bildungsforschung
    und Lehrkräftebildung} }'
  chicago: Peeters, Hendrik, André Graute, Jan-Luca Hansel, Matthias Fischer, and
    Sabine Fechner. “VirtuChemLab - Ein VR-Unterstützungsformat zur Vorbereitung auf
    das reale Chemielabor.” In <i>Lehrkräftebildung in der digitalen Welt - Zukunftsorientierte
    Forschungs- und Praxisperspektiven</i>, edited by Bardo Herzig, Birgit Eickelmann,
    Franziska Schwabl, Johanna Schulze, and Jan Niemann, 1st ed., 1:241–52. Paderborner
    Beiträge zur Bildungsforschung und Lehrkräftebildung. Waxmann, 2024. <a href="https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936">https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936</a>.
  ieee: H. Peeters, A. Graute, J.-L. Hansel, M. Fischer, and S. Fechner, “VirtuChemLab
    - Ein VR-Unterstützungsformat zur Vorbereitung auf das reale Chemielabor,” in
    <i>Lehrkräftebildung in der digitalen Welt - Zukunftsorientierte Forschungs- und
    Praxisperspektiven</i>, 1st ed., vol. 1, B. Herzig, B. Eickelmann, F. Schwabl,
    J. Schulze, and J. Niemann, Eds. Waxmann, 2024, pp. 241–252.
  mla: Peeters, Hendrik, et al. “VirtuChemLab - Ein VR-Unterstützungsformat zur Vorbereitung
    auf das reale Chemielabor.” <i>Lehrkräftebildung in der digitalen Welt - Zukunftsorientierte
    Forschungs- und Praxisperspektiven</i>, edited by Bardo Herzig et al., 1st ed.,
    vol. 1, Waxmann, 2024, pp. 241–52, doi:<a href="https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936">https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&#38;tx_p2waxmann_download%5Bbuchnr%5D=4837&#38;tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&#38;cHash=8a25fe58c1166ed639ec8ef14076a936</a>.
  short: 'H. Peeters, A. Graute, J.-L. Hansel, M. Fischer, S. Fechner, in: B. Herzig,
    B. Eickelmann, F. Schwabl, J. Schulze, J. Niemann (Eds.), Lehrkräftebildung in
    der digitalen Welt - Zukunftsorientierte Forschungs- und Praxisperspektiven, 1st
    ed., Waxmann, 2024, pp. 241–252.'
date_created: 2024-12-13T16:45:26Z
date_updated: 2025-12-03T18:18:54Z
department:
- _id: '386'
- _id: '33'
doi: https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&tx_p2waxmann_download%5Bbuchnr%5D=4837&tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&cHash=8a25fe58c1166ed639ec8ef14076a936
edition: '1'
editor:
- first_name: Bardo
  full_name: Herzig, Bardo
  last_name: Herzig
- first_name: Birgit
  full_name: Eickelmann, Birgit
  last_name: Eickelmann
- first_name: Franziska
  full_name: Schwabl, Franziska
  last_name: Schwabl
- first_name: Johanna
  full_name: Schulze, Johanna
  last_name: Schulze
- first_name: Jan
  full_name: Niemann, Jan
  last_name: Niemann
intvolume: '         1'
language:
- iso: ger
main_file_link:
- open_access: '1'
  url: https://www.waxmann.com/shop/download?tx_p2waxmann_download%5Baction%5D=download&tx_p2waxmann_download%5Bbuchnr%5D=4837&tx_p2waxmann_download%5Bcontroller%5D=Zeitschrift&cHash=8a25fe58c1166ed639ec8ef14076a936
oa: '1'
page: 241-252
publication: Lehrkräftebildung in der digitalen Welt - Zukunftsorientierte Forschungs-
  und Praxisperspektiven
publication_status: published
publisher: Waxmann
quality_controlled: '1'
series_title: Paderborner Beiträge zur Bildungsforschung und Lehrkräftebildung
status: public
title: VirtuChemLab - Ein VR-Unterstützungsformat zur Vorbereitung auf das reale Chemielabor
type: book_chapter
user_id: '54823'
volume: 1
year: '2024'
...
---
_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. <i>Theoretical Computer Science</i>. 2020;815:289-309.
    doi:<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>
  apa: Castenow, J., Fischer, M., Harbig, J., Jung, D., &#38; Meyer auf der Heide,
    F. (2020). Gathering Anonymous, Oblivious Robots on a Grid. <i>Theoretical Computer
    Science</i>, <i>815</i>, 289–309. <a href="https://doi.org/10.1016/j.tcs.2020.02.018">https://doi.org/10.1016/j.tcs.2020.02.018</a>
  bibtex: '@article{Castenow_Fischer_Harbig_Jung_Meyer auf der Heide_2020, title={Gathering
    Anonymous, Oblivious Robots on a Grid}, volume={815}, DOI={<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>},
    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.” <i>Theoretical
    Computer Science</i> 815 (2020): 289–309. <a href="https://doi.org/10.1016/j.tcs.2020.02.018">https://doi.org/10.1016/j.tcs.2020.02.018</a>.'
  ieee: J. Castenow, M. Fischer, J. Harbig, D. Jung, and F. Meyer auf der Heide, “Gathering
    Anonymous, Oblivious Robots on a Grid,” <i>Theoretical Computer Science</i>, vol.
    815, pp. 289–309, 2020.
  mla: Castenow, Jannik, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
    <i>Theoretical Computer Science</i>, vol. 815, 2020, pp. 289–309, doi:<a href="https://doi.org/10.1016/j.tcs.2020.02.018">10.1016/j.tcs.2020.02.018</a>.
  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. <i>Computer Graphics Forum</i>. 2019;38(7):413-424.
    doi:<a href="https://doi.org/10.1111/cgf.13848">10.1111/cgf.13848</a>
  apa: Brandt, S., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2019). Visibility‐Aware
    Progressive Farthest Point Sampling on the GPU. <i>Computer Graphics Forum</i>,
    <i>38</i>(7), 413–424. <a href="https://doi.org/10.1111/cgf.13848">https://doi.org/10.1111/cgf.13848</a>
  bibtex: '@article{Brandt_Jähn_Fischer_Meyer auf der Heide_2019, title={Visibility‐Aware
    Progressive Farthest Point Sampling on the GPU}, volume={38}, DOI={<a href="https://doi.org/10.1111/cgf.13848">10.1111/cgf.13848</a>},
    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.”
    <i>Computer Graphics Forum</i> 38, no. 7 (2019): 413–24. <a href="https://doi.org/10.1111/cgf.13848">https://doi.org/10.1111/cgf.13848</a>.'
  ieee: S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Visibility‐Aware
    Progressive Farthest Point Sampling on the GPU,” <i>Computer Graphics Forum</i>,
    vol. 38, no. 7, pp. 413–424, 2019.
  mla: Brandt, Sascha, et al. “Visibility‐Aware Progressive Farthest Point Sampling
    on the GPU.” <i>Computer Graphics Forum</i>, vol. 38, no. 7, 2019, pp. 413–24,
    doi:<a href="https://doi.org/10.1111/cgf.13848">10.1111/cgf.13848</a>.
  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. <i>arXiv:190408225</i>. 2019.
  apa: Brandt, S., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2019). Rendering
    of Complex Heterogenous Scenes using Progressive Blue Surfels. <i>ArXiv:1904.08225</i>.
  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.”
    <i>ArXiv:1904.08225</i>, 2019.
  ieee: S. Brandt, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Rendering of
    Complex Heterogenous Scenes using Progressive Blue Surfels,” <i>arXiv:1904.08225</i>.
    2019.
  mla: Brandt, Sascha, et al. “Rendering of Complex Heterogenous Scenes Using Progressive
    Blue Surfels.” <i>ArXiv:1904.08225</i>, 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: <i>Proceedings
    of the ASME 2017 International Design Engineering Technical Conferences &#38;
    Computers and Information in Engineering Conference, Band 1</i>. Vol 1. ASME;
    2017:91:1-91:10. doi:<a href="https://doi.org/10.1115/DETC2017-67528">https://doi.org/10.1115/DETC2017-67528</a>'
  apa: Brandt, S., Jähn, C., Fischer, M., Gerges, M., &#38; Berssenbrügge, J. (2017).
    Automatic Derivation of Geometric Properties of Components from 3D Polygon Models.
    <i>Proceedings of the ASME 2017 International Design Engineering Technical Conferences
    &#38; Computers and Information in Engineering Conference, Band 1</i>, <i>1</i>,
    91:1-91:10. <a href="https://doi.org/10.1115/DETC2017-67528">https://doi.org/10.1115/DETC2017-67528</a>
  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={<a href="https://doi.org/10.1115/DETC2017-67528">https://doi.org/10.1115/DETC2017-67528</a>},
    booktitle={Proceedings of the ASME 2017 International Design Engineering Technical
    Conferences &#38; 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 <i>Proceedings of the ASME 2017 International Design Engineering
    Technical Conferences &#38; Computers and Information in Engineering Conference,
    Band 1</i>, 1:91:1-91:10. ASME, 2017. <a href="https://doi.org/10.1115/DETC2017-67528">https://doi.org/10.1115/DETC2017-67528</a>.
  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 <i>Proceedings
    of the ASME 2017 International Design Engineering Technical Conferences &#38;
    Computers and Information in Engineering Conference, Band 1</i>, 2017, vol. 1,
    p. 91:1-91:10, doi: <a href="https://doi.org/10.1115/DETC2017-67528">https://doi.org/10.1115/DETC2017-67528</a>.'
  mla: Brandt, Sascha, et al. “Automatic Derivation of Geometric Properties of Components
    from 3D Polygon Models.” <i>Proceedings of the ASME 2017 International Design
    Engineering Technical Conferences &#38; Computers and Information in Engineering
    Conference, Band 1</i>, vol. 1, ASME, 2017, p. 91:1-91:10, doi:<a href="https://doi.org/10.1115/DETC2017-67528">https://doi.org/10.1115/DETC2017-67528</a>.
  short: 'S. Brandt, C. Jähn, M. Fischer, M. Gerges, J. Berssenbrügge, in: Proceedings
    of the ASME 2017 International Design Engineering Technical Conferences &#38;
    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. <i>arXiv:170203400</i>. 2017.
  apa: Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2017). Gathering Anonymous,
    Oblivious Robots on a Grid. <i>ArXiv:1702.03400</i>.
  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.” <i>ArXiv:1702.03400</i>, 2017.
  ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
    Robots on a Grid,” <i>arXiv:1702.03400</i>. 2017.
  mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
    <i>ArXiv:1702.03400</i>, 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: <i>Volume 1:
    37th Computers and Information in Engineering Conference</i>. Vol 1. ; 2017:91:1-91:10.
    doi:<a href="https://doi.org/10.1115/detc2017-67528">10.1115/detc2017-67528</a>'
  apa: 'Brandt, S., Fischer, M., Gerges, M., Jähn, C., &#38; Berssenbrügge, J. (2017).
    Automatic Derivation of Geometric Properties of Components From 3D Polygon Models.
    In <i>Volume 1: 37th Computers and Information in Engineering Conference</i> (Vol.
    1, pp. 91:1-91:10). Cleveland, USA. <a href="https://doi.org/10.1115/detc2017-67528">https://doi.org/10.1115/detc2017-67528</a>'
  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={<a href="https://doi.org/10.1115/detc2017-67528">10.1115/detc2017-67528</a>},
    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 <i>Volume 1: 37th Computers and Information in Engineering
    Conference</i>, 1:91:1-91:10, 2017. <a href="https://doi.org/10.1115/detc2017-67528">https://doi.org/10.1115/detc2017-67528</a>.'
  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 <i>Volume
    1: 37th Computers and Information in Engineering Conference</i>, 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.” <i>Volume 1: 37th Computers and Information in Engineering
    Conference</i>, vol. 1, 2017, pp. 91:1-91:10, doi:<a href="https://doi.org/10.1115/detc2017-67528">10.1115/detc2017-67528</a>.'
  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: <i>Wissenschaftsforum Intelligente Technische Systeme
    (WInTeSys) 2017</i>. Vol 369. Paderborn: Verlagsschriftenreihe des Heinz Nixdorf
    Instituts, Paderborn; 2017:415-427.'
  apa: 'Brandt, S., &#38; Fischer, M. (2017). Automatische Ableitung der Transportwege
    von Transportsystemen aus dem 3D-Polygonmodell. In <i>Wissenschaftsforum Intelligente
    Technische Systeme (WInTeSys) 2017</i> (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 <i>Wissenschaftsforum Intelligente
    Technische Systeme (WInTeSys) 2017</i>, 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 <i>Wissenschaftsforum Intelligente Technische Systeme
    (WInTeSys) 2017</i>, Paderborn, 2017, vol. 369, pp. 415–427.
  mla: Brandt, Sascha, and Matthias Fischer. “Automatische Ableitung der Transportwege
    von Transportsystemen aus dem 3D-Polygonmodell.” <i>Wissenschaftsforum Intelligente
    Technische Systeme (WInTeSys) 2017</i>, 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. <i>Algorithms
    for Sensor Systems - 13th International Symposium on Algorithms and Experiments
    for Wireless Sensor Networks, {ALGOSENSORS}</i>. Vol 10718. Lecture Notes in Computer
    Science. Vienna, Austria: Springer; 2017:168-181. doi:<a href="https://doi.org/10.1007/978-3-319-72751-6_13">10.1007/978-3-319-72751-6_13</a>'
  apa: 'Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2017). Gathering Anonymous,
    Oblivious Robots on a Grid. In A. Fernández Anta, T. Jurdzinski, M. A. Mosteiro,
    &#38; Y. Zhang (Eds.), <i>Algorithms for Sensor Systems - 13th International Symposium
    on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}</i>
    (Vol. 10718, pp. 168–181). Vienna, Austria: Springer. <a href="https://doi.org/10.1007/978-3-319-72751-6_13">https://doi.org/10.1007/978-3-319-72751-6_13</a>'
  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={<a href="https://doi.org/10.1007/978-3-319-72751-6_13">10.1007/978-3-319-72751-6_13</a>},
    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 <i>Algorithms for Sensor Systems -
    13th International Symposium on Algorithms and Experiments for Wireless Sensor
    Networks, {ALGOSENSORS}</i>, 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. <a href="https://doi.org/10.1007/978-3-319-72751-6_13">https://doi.org/10.1007/978-3-319-72751-6_13</a>.'
  ieee: M. Fischer, D. Jung, and F. Meyer auf der Heide, “Gathering Anonymous, Oblivious
    Robots on a Grid,” in <i>Algorithms for Sensor Systems - 13th International Symposium
    on Algorithms and Experiments for Wireless Sensor Networks, {ALGOSENSORS}</i>,
    2017, vol. 10718, pp. 168–181.
  mla: Fischer, Matthias, et al. “Gathering Anonymous, Oblivious Robots on a Grid.”
    <i>Algorithms for Sensor Systems - 13th International Symposium on Algorithms
    and Experiments for Wireless Sensor Networks, {ALGOSENSORS}</i>, edited by Antonio
    Fernández Anta et al., vol. 10718, Springer, 2017, pp. 168–81, doi:<a href="https://doi.org/10.1007/978-3-319-72751-6_13">10.1007/978-3-319-72751-6_13</a>.
  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. <i>arXiv:160203303</i>. 2016.
  apa: Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016).
    Asymptotically Optimal Gathering on a Grid. <i>ArXiv:1602.03303</i>.
  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.” <i>ArXiv:1602.03303</i>,
    2016.
  ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
    Optimal Gathering on a Grid,” <i>arXiv:1602.03303</i>. 2016.
  mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
    <i>ArXiv:1602.03303</i>, 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. <i>Algorithm
    Engineering</i>. Vol 9220. LNCS. Springer; 2016:226-244. doi:<a href="https://doi.org/10.1007/978-3-319-49487-6_7
    ">10.1007/978-3-319-49487-6_7 </a>'
  apa: Fischer, M., Jähn, C., Meyer auf der Heide, F., &#38; Petring, R. (2016). Algorithm
    Engineering Aspects of Real-Time Rendering Algorithms. In L. Kliemann &#38; P.
    Sanders (Eds.), <i>Algorithm Engineering</i> (Vol. 9220, pp. 226–244). Springer.
    <a href="https://doi.org/10.1007/978-3-319-49487-6_7 ">https://doi.org/10.1007/978-3-319-49487-6_7
    </a>
  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={<a href="https://doi.org/10.1007/978-3-319-49487-6_7 ">10.1007/978-3-319-49487-6_7
    </a>}, 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
    <i>Algorithm Engineering</i>, edited by Lasse Kliemann and Peter Sanders, 9220:226–44.
    LNCS. Springer, 2016. <a href="https://doi.org/10.1007/978-3-319-49487-6_7 ">https://doi.org/10.1007/978-3-319-49487-6_7
    </a>.
  ieee: M. Fischer, C. Jähn, F. Meyer auf der Heide, and R. Petring, “Algorithm Engineering
    Aspects of Real-Time Rendering Algorithms,” in <i>Algorithm Engineering</i>, 2016,
    vol. 9220, pp. 226–244.
  mla: Fischer, Matthias, et al. “Algorithm Engineering Aspects of Real-Time Rendering
    Algorithms.” <i>Algorithm Engineering</i>, edited by Lasse Kliemann and Peter
    Sanders, vol. 9220, Springer, 2016, pp. 226–44, doi:<a href="https://doi.org/10.1007/978-3-319-49487-6_7
    ">10.1007/978-3-319-49487-6_7 </a>.
  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: <i>Proceedings of the 28th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>. ACM; 2016:301-312. doi:<a href="https://doi.org/10.1145/2935764.2935789">10.1145/2935764.2935789</a>'
  apa: Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der Heide, F. (2016).
    Asymptotically Optimal Gathering on a Grid. In <i>Proceedings of the 28th ACM
    Symposium on Parallelism in Algorithms and Architectures (SPAA)</i> (pp. 301–312).
    ACM. <a href="https://doi.org/10.1145/2935764.2935789">https://doi.org/10.1145/2935764.2935789</a>
  bibtex: '@inproceedings{Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016, title={Asymptotically
    Optimal Gathering on a Grid}, DOI={<a href="https://doi.org/10.1145/2935764.2935789">10.1145/2935764.2935789</a>},
    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 <i>Proceedings
    of the 28th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)</i>,
    301–12. ACM, 2016. <a href="https://doi.org/10.1145/2935764.2935789">https://doi.org/10.1145/2935764.2935789</a>.
  ieee: A. Cord-Landwehr, M. Fischer, D. Jung, and F. Meyer auf der Heide, “Asymptotically
    Optimal Gathering on a Grid,” in <i>Proceedings of the 28th ACM Symposium on Parallelism
    in Algorithms and Architectures (SPAA)</i>, 2016, pp. 301–312.
  mla: Cord-Landwehr, Andreas, et al. “Asymptotically Optimal Gathering on a Grid.”
    <i>Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures
    (SPAA)</i>, ACM, 2016, pp. 301–12, doi:<a href="https://doi.org/10.1145/2935764.2935789">10.1145/2935764.2935789</a>.
  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: <i>Proceedings of the 30th International
    Parallel and Distributed Processing Symposium (IPDPS)</i>. IEEE; 2016:689-699.
    doi:<a href="https://doi.org/10.1109/IPDPS.2016.51">10.1109/IPDPS.2016.51</a>'
  apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der
    Heide, F. (2016). Gathering a Closed Chain of Robots on a Grid. In <i>Proceedings
    of the 30th International Parallel and Distributed Processing Symposium (IPDPS)</i>
    (pp. 689–699). IEEE. <a href="https://doi.org/10.1109/IPDPS.2016.51">https://doi.org/10.1109/IPDPS.2016.51</a>
  bibtex: '@inproceedings{Abshoff_Cord-Landwehr_Fischer_Jung_Meyer auf der Heide_2016,
    title={Gathering a Closed Chain of Robots on a Grid}, DOI={<a href="https://doi.org/10.1109/IPDPS.2016.51">10.1109/IPDPS.2016.51</a>},
    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 <i>Proceedings of the 30th International Parallel and Distributed Processing
    Symposium (IPDPS)</i>, 689–99. IEEE, 2016. <a href="https://doi.org/10.1109/IPDPS.2016.51">https://doi.org/10.1109/IPDPS.2016.51</a>.
  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 <i>Proceedings of the 30th
    International Parallel and Distributed Processing Symposium (IPDPS)</i>, 2016,
    pp. 689–699.
  mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
    <i>Proceedings of the 30th International Parallel and Distributed Processing Symposium
    (IPDPS)</i>, IEEE, 2016, pp. 689–99, doi:<a href="https://doi.org/10.1109/IPDPS.2016.51">10.1109/IPDPS.2016.51</a>.
  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: <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung,
    Band 342 </i>. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.'
  apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., &#38; Fischer, M. (2015). Anbindung
    des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme.
    <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung,
    Band 342 </i>, 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 &#38; 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 <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der
    Produktentstehung, Band 342 </i>, 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 <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung,
    Band 342 </i>, 2015, pp. 65–78.
  mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle
    Intelligenter Technischer Systeme.” <i>12. Paderborner Workshop Augmented &#38;
    Virtual Reality in Der Produktentstehung, Band 342 </i>, 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 &#38; 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: <i>12. Paderborner
    Workshop Augmented &#38; Virtual Reality in der Produktentstehung, Band 342</i>.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.'
  apa: Jähn, C., Fischer, M., Gerges, M., &#38; Berssenbrügge, J. (2015). Automatische
    Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.
    <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung,
    Band 342</i>, 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 &#38; 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 <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung,
    Band 342</i>, 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 <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung,
    Band 342</i>, 2015, pp. 107–120.
  mla: Jähn, Claudius, et al. “Automatische Ableitung geometrischer Eigenschaften
    von Bauteilen aus dem 3-D-Polygonmodell.” <i>12. Paderborner Workshop Augmented
    &#38; Virtual Reality in der Produktentstehung, Band 342</i>, 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 &#38; 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: <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>.
    Vol 343. Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:65-78.'
  apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., &#38; Fischer, M. (2015). Anbindung
    des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme.
    <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>,
    <i>343</i>, 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
    &#38; 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 <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der
    Produktentstehung</i>, 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 <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>,
    2015, vol. 343, pp. 65–78.
  mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle
    Intelligenter Technischer Systeme.” <i>12. Paderborner Workshop Augmented &#38;
    Virtual Reality in Der Produktentstehung</i>, 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 &#38; 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: <i>12. Paderborner
    Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>. Vol 342.
    Verlagsschriftenreihe des Heinz Nixdorf Instituts; 2015:107-120.'
  apa: Jähn, C., Fischer, M., Gerges, M., &#38; Berssenbrügge, J. (2015). Automatische
    Ableitung geometrischer Eigenschaften von Bauteilen aus dem 3-D-Polygonmodell.
    <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>,
    <i>342</i>, 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
    &#38; 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 <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>,
    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 <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>,
    2015, vol. 342, pp. 107–120.
  mla: Jähn, Claudius, et al. “Automatische Ableitung Geometrischer Eigenschaften
    von Bauteilen Aus Dem 3-D-Polygonmodell.” <i>12. Paderborner Workshop Augmented
    &#38; Virtual Reality in Der Produktentstehung</i>, 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 &#38; 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: <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>.
    Vol 342. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn; 2015:65-78.'
  apa: Berssenbrügge, J., Wiederkehr, O., Jähn, C., &#38; Fischer, M. (2015). Anbindung
    des Virtuellen Prototypen an die Partialmodelle intelligenter technischer Systeme.
    In <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>
    (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 &#38; 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 <i>12. Paderborner Workshop Augmented &#38; Virtual Reality in Der
    Produktentstehung</i>, 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 <i>12.
    Paderborner Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i>,
    2015, vol. 342, pp. 65–78.
  mla: Berssenbrügge, Jan, et al. “Anbindung Des Virtuellen Prototypen an Die Partialmodelle
    Intelligenter Technischer Systeme.” <i>12. Paderborner Workshop Augmented &#38;
    Virtual Reality in Der Produktentstehung</i>, 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 &#38; 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. <i>arXiv:151005454</i>. 2015.
  apa: Abshoff, S., Cord-Landwehr, A., Fischer, M., Jung, D., &#38; Meyer auf der
    Heide, F. (2015). Gathering a Closed Chain of Robots on a Grid. <i>ArXiv:1510.05454</i>.
  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.”
    <i>ArXiv:1510.05454</i>, 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,” <i>arXiv:1510.05454</i>. 2015.
  mla: Abshoff, Sebastian, et al. “Gathering a Closed Chain of Robots on a Grid.”
    <i>ArXiv:1510.05454</i>, 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'
...
