---
_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'
...
---
_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: <i>11. Paderborner Workshop Augmented
    &#38; Virtual Reality in Der Produktentstehung</i>. Vol 311. Verlagsschriftenreihe
    des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.'
  apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F.
    (2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In <i>11. Paderborner
    Workshop Augmented &#38; Virtual Reality in der Produktentstehung</i> (Vol. 311,
    pp. 49--60). Paderborn.
  bibtex: '@inproceedings{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Paderborn},
    series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Darstellung
    heterogener 3-D-Szenen in Echtzeit}, volume={311}, booktitle={11. Paderborner
    Workshop Augmented &#38; Virtual Reality in der Produktentstehung}, author={Petring,
    Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf
    der Heide, Friedhelm}, year={2013}, pages={49--60}, collection={Verlagsschriftenreihe
    des Heinz Nixdorf Instituts} }'
  chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
    Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In <i>11.
    Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>,
    311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013.
  ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung
    heterogener 3-D-Szenen in Echtzeit,” in <i>11. Paderborner Workshop Augmented
    &#38; Virtual Reality in der Produktentstehung</i>, 2013, vol. 311, pp. 49--60.
  mla: Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” <i>11.
    Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung</i>,
    vol. 311, 2013, pp. 49--60.
  short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11.
    Paderborner Workshop Augmented &#38; Virtual Reality in Der Produktentstehung,
    Paderborn, 2013, pp. 49--60.'
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: <i>Computer Graphics Forum</i>. Vol 32. Proceedings of the 24th Eurographics
    Symposium on Rendering. ; 2013:49-58. doi:<a href="https://doi.org/10.1111/cgf.12150">10.1111/cgf.12150</a>'
  apa: Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2013). Spherical
    Visibility Sampling. In <i>Computer Graphics Forum</i> (Vol. 32, pp. 49–58). <a
    href="https://doi.org/10.1111/cgf.12150">https://doi.org/10.1111/cgf.12150</a>
  bibtex: '@inproceedings{Eikel_Jähn_Fischer_Meyer auf der Heide_2013, series={Proceedings
    of the 24th Eurographics Symposium on Rendering}, title={Spherical Visibility
    Sampling}, volume={32}, DOI={<a href="https://doi.org/10.1111/cgf.12150">10.1111/cgf.12150</a>},
    number={4}, booktitle={Computer Graphics Forum}, author={Eikel, Benjamin and Jähn,
    Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013},
    pages={49–58}, collection={Proceedings of the 24th Eurographics Symposium on Rendering}
    }'
  chicago: Eikel, Benjamin, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf
    der Heide. “Spherical Visibility Sampling.” In <i>Computer Graphics Forum</i>,
    32:49–58. Proceedings of the 24th Eurographics Symposium on Rendering, 2013. <a
    href="https://doi.org/10.1111/cgf.12150">https://doi.org/10.1111/cgf.12150</a>.
  ieee: B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Spherical Visibility
    Sampling,” in <i>Computer Graphics Forum</i>, 2013, vol. 32, no. 4, pp. 49–58.
  mla: Eikel, Benjamin, et al. “Spherical Visibility Sampling.” <i>Computer Graphics
    Forum</i>, vol. 32, no. 4, 2013, pp. 49–58, doi:<a href="https://doi.org/10.1111/cgf.12150">10.1111/cgf.12150</a>.
  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'
...
---
_id: '16406'
abstract:
- lang: eng
  text: "In order to evaluate the efficiency of algorithms for real-time 3D rendering,
    different properties like rendering time, occluded triangles, or image quality,
    need to be investigated. Since these properties depend on the position of the
    camera, usually some camera path is chosen, along which the measurements are performed.
    As those measurements cover only a small part of the scene, this approach hardly
    allows drawing conclusions regarding the algorithm's properties at arbitrary positions
    in the scene. The presented method allows the systematic and position-independent
    evaluation of rendering algorithms. It uses an adaptive sampling approach to approximate
    the distribution of a property (like rendering time) for all positions in the
    scene. This approximation can be visualized to produce an intuitive impression
    of the algorithm's behavior or be statistically analyzed for objectively rating
    and comparing algorithms. We demonstrate our method by evaluating performance
    aspects of a known occlusion culling algorithm.\r\n"
author:
- first_name: Claudius
  full_name: Jähn, Claudius
  last_name: Jähn
- first_name: Benjamin
  full_name: Eikel, Benjamin
  last_name: Eikel
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
- first_name: Ralf
  full_name: Petring, Ralf
  last_name: Petring
- first_name: Friedhelm
  full_name: Meyer auf der Heide, Friedhelm
  id: '15523'
  last_name: Meyer auf der Heide
citation:
  ama: 'Jähn C, Eikel B, Fischer M, Petring R, Meyer auf der Heide F. Evaluation of
    Rendering Algorithms Using Position-Dependent Scene Properties. In: <i>Advances
    in Visual Computing</i>. Berlin, Heidelberg; 2013. doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_12">10.1007/978-3-642-41914-0_12</a>'
  apa: Jähn, C., Eikel, B., Fischer, M., Petring, R., &#38; Meyer auf der Heide, F.
    (2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.
    In <i>Advances in Visual Computing</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-642-41914-0_12">https://doi.org/10.1007/978-3-642-41914-0_12</a>
  bibtex: '@inbook{Jähn_Eikel_Fischer_Petring_Meyer auf der Heide_2013, place={Berlin,
    Heidelberg}, title={Evaluation of Rendering Algorithms Using Position-Dependent
    Scene Properties}, DOI={<a href="https://doi.org/10.1007/978-3-642-41914-0_12">10.1007/978-3-642-41914-0_12</a>},
    booktitle={Advances in Visual Computing}, author={Jähn, Claudius and Eikel, Benjamin
    and Fischer, Matthias and Petring, Ralf and Meyer auf der Heide, Friedhelm}, year={2013}
    }'
  chicago: Jähn, Claudius, Benjamin Eikel, Matthias Fischer, Ralf Petring, and Friedhelm
    Meyer auf der Heide. “Evaluation of Rendering Algorithms Using Position-Dependent
    Scene Properties.” In <i>Advances in Visual Computing</i>. Berlin, Heidelberg,
    2013. <a href="https://doi.org/10.1007/978-3-642-41914-0_12">https://doi.org/10.1007/978-3-642-41914-0_12</a>.
  ieee: C. Jähn, B. Eikel, M. Fischer, R. Petring, and F. Meyer auf der Heide, “Evaluation
    of Rendering Algorithms Using Position-Dependent Scene Properties,” in <i>Advances
    in Visual Computing</i>, Berlin, Heidelberg, 2013.
  mla: Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent
    Scene Properties.” <i>Advances in Visual Computing</i>, 2013, doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_12">10.1007/978-3-642-41914-0_12</a>.
  short: 'C. Jähn, B. Eikel, M. Fischer, R. Petring, F. Meyer auf der Heide, in: Advances
    in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:21:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_12
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
  isbn:
  - '9783642419133'
  - '9783642419140'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '16407'
abstract:
- lang: eng
  text: "Many virtual 3D scenes, especially those that are large, are not structured
    evenly. For such heterogeneous data, there is no single algorithm that is able
    to render every scene type at each position fast and with the same high image
    quality. For a small set of scenes, this situation can be improved if different
    rendering algorithms are manually assigned to particular parts of the scene by
    an experienced user. We introduce the Multi-Algorithm-Rendering method. It automatically
    deploys different rendering algorithms simultaneously for a broad range of scene
    types. The method divides the scene into subregions and measures the behavior
    of different algorithms for each region in a preprocessing step. During runtime,
    this data is utilized to compute an estimate for the quality and running time
    of the available rendering algorithms from the observer's point of view. By solving
    an optimizing problem, the image quality can be optimized by an assignment of
    algorithms to regions while keeping the frame rate almost constant.\r\n"
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. Real-Time 3D
    Rendering of Heterogeneous Scenes. In: <i>Advances in Visual Computing</i>. Berlin,
    Heidelberg; 2013. doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_44">10.1007/978-3-642-41914-0_44</a>'
  apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F.
    (2013). Real-Time 3D Rendering of Heterogeneous Scenes. In <i>Advances in Visual
    Computing</i>. Berlin, Heidelberg. <a href="https://doi.org/10.1007/978-3-642-41914-0_44">https://doi.org/10.1007/978-3-642-41914-0_44</a>
  bibtex: '@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin,
    Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={<a href="https://doi.org/10.1007/978-3-642-41914-0_44">10.1007/978-3-642-41914-0_44</a>},
    booktitle={Advances in Visual Computing}, author={Petring, Ralf and Eikel, Benjamin
    and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
    year={2013} }'
  chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
    Meyer auf der Heide. “Real-Time 3D Rendering of Heterogeneous Scenes.” In <i>Advances
    in Visual Computing</i>. Berlin, Heidelberg, 2013. <a href="https://doi.org/10.1007/978-3-642-41914-0_44">https://doi.org/10.1007/978-3-642-41914-0_44</a>.
  ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time
    3D Rendering of Heterogeneous Scenes,” in <i>Advances in Visual Computing</i>,
    Berlin, Heidelberg, 2013.
  mla: Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” <i>Advances
    in Visual Computing</i>, 2013, doi:<a href="https://doi.org/10.1007/978-3-642-41914-0_44">10.1007/978-3-642-41914-0_44</a>.
  short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
    in Visual Computing, Berlin, Heidelberg, 2013.'
date_created: 2020-04-06T07:38:52Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-41914-0_44
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
  isbn:
  - '9783642419133'
  - '9783642419140'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
status: public
title: Real-Time 3D Rendering of Heterogeneous Scenes
type: book_chapter
user_id: '15415'
year: '2013'
...
---
_id: '16408'
abstract:
- lang: eng
  text: "We present a parallel rendering system for heterogeneous PC clusters to visualize
    massive models. One single, powerful visualization node is supported by a group
    of backend nodes with weak graphics performance. While the visualization node
    renders the visible objects, the backend nodes asynchronously perform visibility
    tests and supply the front end with visible scene objects. The visualization node
    stores only currently visible objects in its memory, while the scene is distributed
    among the backend nodes’ memory without redundancy. To efficiently compute the
    occlusion tests in spite of that each backend node stores only a fraction of the
    original geometry, we complete the scene by adding highly simplified versions
    of the objects stored on other nodes. We test our system with 15 backend nodes.
    It is able to render a ≈ 350,M polygons (≈ 8.5,GiB) large aircraft model with
    20, to 30,fps and thus allows a walk-through in real-time.\r\n"
author:
- first_name: Tim
  full_name: Suess, Tim
  last_name: Suess
- first_name: Clemens
  full_name: Koch, Clemens
  last_name: Koch
- 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: 'Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Asynchronous Occlusion
    Culling on Heterogeneous PC Clusters for Distributed 3D Scenes. In: <i>Advances
    in Visual Computing</i>. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512.
    doi:<a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>'
  apa: Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2012).
    Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D
    Scenes. <i>Advances in Visual Computing</i>, <i>7431</i>, 502–512. <a href="https://doi.org/10.1007/978-3-642-33179-4_48">https://doi.org/10.1007/978-3-642-33179-4_48</a>
  bibtex: '@inproceedings{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2012, place={Berlin,
    Heidelberg}, series={Lecture Notes in Computer Science}, title={Asynchronous Occlusion
    Culling on Heterogeneous PC Clusters for Distributed 3D Scenes}, volume={7431},
    DOI={<a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>},
    booktitle={Advances in Visual Computing}, author={Suess, Tim and Koch, Clemens
    and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm},
    year={2012}, pages={502–512}, collection={Lecture Notes in Computer Science} }'
  chicago: Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm
    Meyer auf der Heide. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
    for Distributed 3D Scenes.” In <i>Advances in Visual Computing</i>, 7431:502–12.
    Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. <a href="https://doi.org/10.1007/978-3-642-33179-4_48">https://doi.org/10.1007/978-3-642-33179-4_48</a>.
  ieee: 'T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Asynchronous
    Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D Scenes,” in
    <i>Advances in Visual Computing</i>, 2012, vol. 7431, pp. 502–512, doi: <a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>.'
  mla: Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
    for Distributed 3D Scenes.” <i>Advances in Visual Computing</i>, vol. 7431, 2012,
    pp. 502–12, doi:<a href="https://doi.org/10.1007/978-3-642-33179-4_48">10.1007/978-3-642-33179-4_48</a>.
  short: 'T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Advances
    in Visual Computing, Berlin, Heidelberg, 2012, pp. 502–512.'
date_created: 2020-04-06T07:40:57Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-33179-4_48
intvolume: '      7431'
language:
- iso: eng
page: 502-512
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
  isbn:
  - '9783642331787'
  - '9783642331794'
  issn:
  - 0302-9743
  - 1611-3349
publication_status: published
series_title: Lecture Notes in Computer Science
status: public
title: Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed
  3D Scenes
type: conference
user_id: '15415'
volume: 7431
year: '2012'
...
---
_id: '17420'
abstract:
- lang: eng
  text: "Occlusion culling is a common approach to accelerate real-time rendering
    of polygonal 3D-scenes by reducing the rendering load. Especially for large scenes,
    it is necessary to remove occluded objects to achieve a frame rate that provides
    an interactive environment. In order to benefit from the culling properly, often
    hierarchical data structures are used. These data structures typically create
    a spatial subdivision of a given scene into axis-aligned bounding boxes. These
    boxes can be tested quickly, but they are not very precise. By using these boxes,
    the included objects are detected as visible, even if other objects occlude them
    (false-positives). To get perfect results, the models\x92 original geometry included
    in the box has to be tested, but this would require too much computational power.
    To overcome this problem, original objects\x92 approximations could be used, but
    typical methods for mesh simplification cannot be applied, because they do not
    create an outer hull for a given object. We present a model simplification algorithm,
    which generates simple outer hulls, consisting of only few more triangles than
    a box, while preserving an object\x92s shape better than a corresponding bounding
    box. This approach is then extended to a hierarchical data structure, the so-called
    hull tree, that can be generated for a given scene to improve the visibility tests.
    Next, we present an approximative rendering algorithm, which combines the features
    of the hull tree with the use of inner hulls for efficient occlusion detection
    and global state-sorting of the visible objects.\r\n"
author:
- first_name: Tim
  full_name: Suess, Tim
  last_name: Suess
- first_name: Clemens
  full_name: Koch, Clemens
  last_name: Koch
- 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: 'Suess T, Koch C, Jähn C, Fischer M. Approximative occlusion culling using
    the hull tree. In: Brooks S, Irani P, eds. <i>Proceedings of the Graphics Interface
    2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>. Canadian Human-Computer
    Communications Society; 2011:79--86.'
  apa: Suess, T., Koch, C., Jähn, C., &#38; Fischer, M. (2011). Approximative occlusion
    culling using the hull tree. In S. Brooks &#38; P. Irani (Eds.), <i>Proceedings
    of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland,
    Canada</i> (pp. 79--86). Canadian Human-Computer Communications Society.
  bibtex: '@inproceedings{Suess_Koch_Jähn_Fischer_2011, title={Approximative occlusion
    culling using the hull tree}, booktitle={Proceedings of the Graphics Interface
    2011 Conference, May 25-27, St. John’s, Newfoundland, Canada}, publisher={Canadian
    Human-Computer Communications Society}, author={Suess, Tim and Koch, Clemens and
    Jähn, Claudius and Fischer, Matthias}, editor={Brooks, Stephen and Irani, Pourang},
    year={2011}, pages={79--86} }'
  chicago: Suess, Tim, Clemens Koch, Claudius Jähn, and Matthias Fischer. “Approximative
    Occlusion Culling Using the Hull Tree.” In <i>Proceedings of the Graphics Interface
    2011 Conference, May 25-27, St. John’s, Newfoundland, Canada</i>, edited by Stephen
    Brooks and Pourang Irani, 79--86. Canadian Human-Computer Communications Society,
    2011.
  ieee: T. Suess, C. Koch, C. Jähn, and M. Fischer, “Approximative occlusion culling
    using the hull tree,” in <i>Proceedings of the Graphics Interface 2011 Conference,
    May 25-27, St. John’s, Newfoundland, Canada</i>, 2011, pp. 79--86.
  mla: Suess, Tim, et al. “Approximative Occlusion Culling Using the Hull Tree.” <i>Proceedings
    of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland,
    Canada</i>, edited by Stephen Brooks and Pourang Irani, Canadian Human-Computer
    Communications Society, 2011, pp. 79--86.
  short: 'T. Suess, C. Koch, C. Jähn, M. Fischer, in: S. Brooks, P. Irani (Eds.),
    Proceedings of the Graphics Interface 2011 Conference, May 25-27, St. John’s,
    Newfoundland, Canada, Canadian Human-Computer Communications Society, 2011, pp.
    79--86.'
date_created: 2020-07-27T19:17:03Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
editor:
- first_name: Stephen
  full_name: Brooks, Stephen
  last_name: Brooks
- first_name: Pourang
  full_name: Irani, Pourang
  last_name: Irani
language:
- iso: eng
page: 79--86
publication: Proceedings of the Graphics Interface 2011 Conference, May 25-27, St.
  John's, Newfoundland, Canada
publisher: Canadian Human-Computer Communications Society
status: public
title: Approximative occlusion culling using the hull tree
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '17421'
author:
- first_name: Alexander
  full_name: Klaas, Alexander
  last_name: Klaas
- first_name: Christoph
  full_name: Laroque, Christoph
  last_name: Laroque
- first_name: Wilhelm
  full_name: Dangelmaier, Wilhelm
  last_name: Dangelmaier
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
citation:
  ama: 'Klaas A, Laroque C, Dangelmaier W, Fischer M. Simulation aided, knowledge
    based routing for AGVs in a distribution warehouse. In: <i>Proceedings of the
    2011 Winter Simulation Conference (WSC)</i>. ; 2011. doi:<a href="https://doi.org/10.1109/wsc.2011.6147883">10.1109/wsc.2011.6147883</a>'
  apa: Klaas, A., Laroque, C., Dangelmaier, W., &#38; Fischer, M. (2011). Simulation
    aided, knowledge based routing for AGVs in a distribution warehouse. In <i>Proceedings
    of the 2011 Winter Simulation Conference (WSC)</i>. <a href="https://doi.org/10.1109/wsc.2011.6147883">https://doi.org/10.1109/wsc.2011.6147883</a>
  bibtex: '@inproceedings{Klaas_Laroque_Dangelmaier_Fischer_2011, title={Simulation
    aided, knowledge based routing for AGVs in a distribution warehouse}, DOI={<a
    href="https://doi.org/10.1109/wsc.2011.6147883">10.1109/wsc.2011.6147883</a>},
    booktitle={Proceedings of the 2011 Winter Simulation Conference (WSC)}, author={Klaas,
    Alexander and Laroque, Christoph and Dangelmaier, Wilhelm and Fischer, Matthias},
    year={2011} }'
  chicago: Klaas, Alexander, Christoph Laroque, Wilhelm Dangelmaier, and Matthias
    Fischer. “Simulation Aided, Knowledge Based Routing for AGVs in a Distribution
    Warehouse.” In <i>Proceedings of the 2011 Winter Simulation Conference (WSC)</i>,
    2011. <a href="https://doi.org/10.1109/wsc.2011.6147883">https://doi.org/10.1109/wsc.2011.6147883</a>.
  ieee: A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge
    based routing for AGVs in a distribution warehouse,” in <i>Proceedings of the
    2011 Winter Simulation Conference (WSC)</i>, 2011.
  mla: Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs
    in a Distribution Warehouse.” <i>Proceedings of the 2011 Winter Simulation Conference
    (WSC)</i>, 2011, doi:<a href="https://doi.org/10.1109/wsc.2011.6147883">10.1109/wsc.2011.6147883</a>.
  short: 'A. Klaas, C. Laroque, W. Dangelmaier, M. Fischer, in: Proceedings of the
    2011 Winter Simulation Conference (WSC), 2011.'
date_created: 2020-07-27T19:21:18Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/wsc.2011.6147883
language:
- iso: eng
publication: Proceedings of the 2011 Winter Simulation Conference (WSC)
publication_identifier:
  isbn:
  - '9781457721090'
  - '9781457721083'
  - '9781457721069'
  - '9781457721076'
publication_status: published
status: public
title: Simulation aided, knowledge based routing for AGVs in a distribution warehouse
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '17450'
author:
- first_name: Tim
  full_name: Suess, Tim
  last_name: Suess
- 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
- first_name: Clemens
  full_name: Koch, Clemens
  last_name: Koch
citation:
  ama: 'Suess T, Jähn C, Fischer M, Meyer auf der Heide F, Koch C. Ein paralleles
    Out-of-Core Renderingsystem für Standard-Rechnernetze. In: <i>Augmented &#38;
    Virtual Reality in Der Produktentstehung</i>. Vol 295. Verlagsschriftenreihe des
    Heinz Nixdorf Instituts; 2011:185--197.'
  apa: Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., &#38; Koch, C. (2011).
    Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. <i>Augmented
    &#38; Virtual Reality in Der Produktentstehung</i>, <i>295</i>, 185--197.
  bibtex: '@inproceedings{Suess_Jähn_Fischer_Meyer auf der Heide_Koch_2011, place={Paderborn},
    title={Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze},
    volume={295}, booktitle={Augmented &#38; Virtual Reality in der Produktentstehung},
    publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, author={Suess,
    Tim and Jähn, Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm
    and Koch, Clemens}, year={2011}, pages={185--197} }'
  chicago: 'Suess, Tim, Claudius Jähn, Matthias Fischer, Friedhelm Meyer auf der Heide,
    and Clemens Koch. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
    In <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, 295:185--197.
    Paderborn: Verlagsschriftenreihe des Heinz Nixdorf Instituts, 2011.'
  ieee: T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, and C. Koch, “Ein paralleles
    Out-of-Core Renderingsystem für Standard-Rechnernetze,” in <i>Augmented &#38;
    Virtual Reality in der Produktentstehung</i>, 2011, vol. 295, pp. 185--197.
  mla: Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
    <i>Augmented &#38; Virtual Reality in Der Produktentstehung</i>, vol. 295, Verlagsschriftenreihe
    des Heinz Nixdorf Instituts, 2011, pp. 185--197.
  short: 'T. Suess, C. Jähn, M. Fischer, F. Meyer auf der Heide, C. Koch, in: Augmented
    &#38; Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz
    Nixdorf Instituts, Paderborn, 2011, pp. 185--197.'
date_created: 2020-07-29T12:19:22Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: '       295'
language:
- iso: eng
page: 185--197
place: Paderborn
publication: Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze
type: conference
user_id: '15415'
volume: 295
year: '2011'
...
---
_id: '18193'
author:
- first_name: Hendrik
  full_name: Renken, Hendrik
  last_name: Renken
- first_name: Christoph
  full_name: Laroque, Christoph
  last_name: Laroque
- first_name: Matthias
  full_name: Fischer, Matthias
  id: '146'
  last_name: Fischer
citation:
  ama: 'Renken H, Laroque C, Fischer M. An Easy Extendable Modeling Framework for
    Discrete Event Simulation Models and their Visualization. In: <i>Proceedings of
    The 25th European Simulation and Modelling Conference - ESM2011</i>. ; 2011.'
  apa: Renken, H., Laroque, C., &#38; Fischer, M. (2011). An Easy Extendable Modeling
    Framework for Discrete Event Simulation Models and their Visualization. In <i>Proceedings
    of The 25th European Simulation and Modelling Conference - ESM2011</i>.
  bibtex: '@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling
    Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings
    of The 25th European Simulation and Modelling Conference - ESM2011}, author={Renken,
    Hendrik and Laroque, Christoph and Fischer, Matthias}, year={2011} }'
  chicago: Renken, Hendrik, Christoph Laroque, and Matthias Fischer. “An Easy Extendable
    Modeling Framework for Discrete Event Simulation Models and Their Visualization.”
    In <i>Proceedings of The 25th European Simulation and Modelling Conference - ESM2011</i>,
    2011.
  ieee: H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework
    for Discrete Event Simulation Models and their Visualization,” in <i>Proceedings
    of The 25th European Simulation and Modelling Conference - ESM2011</i>, 2011.
  mla: Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete
    Event Simulation Models and Their Visualization.” <i>Proceedings of The 25th European
    Simulation and Modelling Conference - ESM2011</i>, 2011.
  short: 'H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European
    Simulation and Modelling Conference - ESM2011, 2011.'
date_created: 2020-08-24T14:01:49Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: Proceedings of The 25th European Simulation and Modelling Conference
  - ESM2011
status: public
title: An Easy Extendable Modeling Framework for Discrete Event Simulation Models
  and their Visualization
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '18194'
abstract:
- lang: eng
  text: 'We present a parallel rendering system for PC-Clusters to visualize large
    3D scenes. One single visualization node, equipped with a high-end graphics adapter,
    is supported by a group of backend nodes with weak graphics performance. The objects
    of the scene are distributed among these backend nodes, they serve two purposes:
    First, they provide an out-of-core memory system for the visualization node. Second,
    they assist the visualization node''s rendering by performing visibility calculations
    and only sending visible objects to the visualization node. In order to obtain
    fast rendering with our system, we have to distribute the objects among the backend
    nodes in a way that does not only guarantee an even distribution of the objects,
    but also an even distribution of the visibility calculations and the amount of
    data send to the visualization node. We identify necessary properties of the distribution
    and argue that a random distribution is a good candidate. Further, in order to
    reduce the number of objects sent to the visualization node per frame, we employ
    an approximate hierarchical occlusion culling in each backend node. For this,
    they are equipped, in addition to the objects assigned to them, with simplified
    versions of the other objects of the 3D scene. The visualization node is equipped
    with 512 MiB video memory and supported by 15 backend nodes. This system is able
    to render a approx. 350 million polygons (approx. 8.5 GiB) large aircraft model
    between 20 - 30 fps and thus allows a walkthrough in real-time.'
author:
- first_name: Tim
  full_name: Suess, Tim
  last_name: Suess
- first_name: Clemens
  full_name: Koch, Clemens
  last_name: Koch
- 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: Suess T, Koch C, Jähn C, Fischer M, Meyer auf der Heide F. Parallel Out-of-Core
    Occlusion Culling. Published online 2011.
  apa: Suess, T., Koch, C., Jähn, C., Fischer, M., &#38; Meyer auf der Heide, F. (2011).
    <i>Parallel Out-of-Core Occlusion Culling</i>.
  bibtex: '@article{Suess_Koch_Jähn_Fischer_Meyer auf der Heide_2011, title={Parallel
    Out-of-Core Occlusion Culling}, author={Suess, Tim and Koch, Clemens and Jähn,
    Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2011}
    }'
  chicago: Suess, Tim, Clemens Koch, Claudius Jähn, Matthias Fischer, and Friedhelm
    Meyer auf der Heide. “Parallel Out-of-Core Occlusion Culling,” 2011.
  ieee: T. Suess, C. Koch, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Parallel
    Out-of-Core Occlusion Culling.” 2011.
  mla: Suess, Tim, et al. <i>Parallel Out-of-Core Occlusion Culling</i>. 2011.
  short: T. Suess, C. Koch, C. Jähn, M. Fischer, F. Meyer auf der Heide, (2011).
date_created: 2020-08-24T14:14:10Z
date_updated: 2022-01-06T06:53:27Z
ddc:
- '000'
department:
- _id: '63'
file:
- access_level: closed
  content_type: application/pdf
  creator: koala
  date_created: 2020-08-24T14:13:46Z
  date_updated: 2020-08-24T14:13:46Z
  file_id: '18195'
  file_name: pre-03-2011-5220.pdf
  file_size: 3091853
  relation: main_file
  success: 1
file_date_updated: 2020-08-24T14:13:46Z
has_accepted_license: '1'
language:
- iso: eng
status: public
title: Parallel Out-of-Core Occlusion Culling
type: preprint
user_id: '15415'
year: '2011'
...