---
_id: '17439'
abstract:
- lang: eng
text: Viele virtuelle 3-D-Szenen im industriellen Bereich sind nicht gleichmäßig
strukturiert, z.B. weil sie eine stark unterschiedliche Dichteverteilung der Polygone
aufweisen. Für solch heterogene Daten existiert kein Algorithmus, der die Gesamtheit
der Daten sowohl schnell als auch mit guter Qualität darstellen kann. Die Auswahl
der richtigen Algorithmen für einzelne Szenenteile durch einen Experten ist zeitintensiv
und in vielen Visualisierungssystemen nicht umzusetzen. Um dieses Problem zu lösen,
setzt das hier vorgestellte Multi-Algorithmen-Rendering verschiedene Renderingalgorithmen
gleichzeitig ein, um eine virtuelle 3-D-Szene darzustellen. Das Verfahren unterteilt
die Szene dafür in einem Vorverarbeitungsschritt automatisch in geeignete Teilregionen
und bestimmt deren Eigenschaften. Diese Daten werden zur Laufzeit dazu genutzt,
um ständig für den aktuellen Standpunkt des Betrachters eine Abschätzung der Qualität
und Laufzeit der zur Auswahl stehenden Renderingalgorithmen zu berechnen. Durch
die Lösung eines Optimierungsproblems kann so bei vorgegebener Bildrate durch
die passende Zuordnung der Algorithmen zu den Regionen die Bildqualität optimiert
werden – bei automatischer Anpassung an die Leistungsfähigkeit der eingesetzten
Hardware. In einer experimentellen Evaluierung vergleichen wir die Laufzeit und
Bildqualität des Verfahrens mit denen verbreiteter Standardrenderingverfahren.
author:
- first_name: Ralf
full_name: Petring, Ralf
last_name: Petring
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Petring R, Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Darstellung
heterogener 3-D-Szenen in Echtzeit. In: 11. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts. Paderborn; 2013:49--60.'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Darstellung heterogener 3-D-Szenen in Echtzeit. In 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung (Vol. 311,
pp. 49--60). Paderborn.
bibtex: '@inproceedings{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Paderborn},
series={Verlagsschriftenreihe des Heinz Nixdorf Instituts}, title={Darstellung
heterogener 3-D-Szenen in Echtzeit}, volume={311}, booktitle={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, author={Petring,
Ralf and Eikel, Benjamin and Jähn, Claudius and Fischer, Matthias and Meyer auf
der Heide, Friedhelm}, year={2013}, pages={49--60}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts} }'
chicago: Petring, Ralf, Benjamin Eikel, Claudius Jähn, Matthias Fischer, and Friedhelm
Meyer auf der Heide. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” In 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
311:49--60. Verlagsschriftenreihe Des Heinz Nixdorf Instituts. Paderborn, 2013.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Darstellung
heterogener 3-D-Szenen in Echtzeit,” in 11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung, 2013, vol. 311, pp. 49--60.
mla: Petring, Ralf, et al. “Darstellung Heterogener 3-D-Szenen in Echtzeit.” 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
vol. 311, 2013, pp. 49--60.
short: 'R. Petring, B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: 11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,
Paderborn, 2013, pp. 49--60.'
date_created: 2020-07-29T08:55:43Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
intvolume: ' 311'
language:
- iso: eng
page: 49--60
place: Paderborn
publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts
status: public
title: Darstellung heterogener 3-D-Szenen in Echtzeit
type: conference
user_id: '15415'
volume: 311
year: '2013'
...
---
_id: '16393'
abstract:
- lang: eng
text: Many 3D scenes (e.g. generated from CAD data) are composed of a multitude
of objects that are nested in each other. A showroom, for instance, may contain
multiple cars and every car has a gearbox with many gearwheels located inside.
Because the objects occlude each other, only few are visible from outside. We
present a new technique, Spherical Visibility Sampling (SVS), for real-time 3D
rendering of such -- possibly highly complex -- scenes. SVS exploits the occlusion
and annotates hierarchically structured objects with directional visibility information
in a preprocessing step. For different directions, the directional visibility
encodes which objects of a scene's region are visible from the outside of the
regions' enclosing bounding sphere. Since there is no need to store a separate
view space subdivision as in most techniques based on preprocessed visibility,
a small memory footprint is achieved. Using the directional visibility information
for an interactive walkthrough, the potentially visible objects can be retrieved
very efficiently without the need for further visibility tests. Our evaluation
shows that using SVS allows to preprocess complex 3D scenes fast and to visualize
them in real time (e.g. a Power Plant model and five animated Boeing 777 models
with billions of triangles). Because SVS does not require hardware support for
occlusion culling during rendering, it is even applicable for rendering large
scenes on mobile devices.
author:
- first_name: Benjamin
full_name: Eikel, Benjamin
last_name: Eikel
- first_name: Claudius
full_name: Jähn, Claudius
last_name: Jähn
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Eikel B, Jähn C, Fischer M, Meyer auf der Heide F. Spherical Visibility Sampling.
In: Computer Graphics Forum. Vol 32. Proceedings of the 24th Eurographics
Symposium on Rendering. ; 2013:49-58. doi:10.1111/cgf.12150'
apa: Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2013). Spherical
Visibility Sampling. In Computer Graphics Forum (Vol. 32, pp. 49–58). https://doi.org/10.1111/cgf.12150
bibtex: '@inproceedings{Eikel_Jähn_Fischer_Meyer auf der Heide_2013, series={Proceedings
of the 24th Eurographics Symposium on Rendering}, title={Spherical Visibility
Sampling}, volume={32}, DOI={10.1111/cgf.12150},
number={4}, booktitle={Computer Graphics Forum}, author={Eikel, Benjamin and Jähn,
Claudius and Fischer, Matthias and Meyer auf der Heide, Friedhelm}, year={2013},
pages={49–58}, collection={Proceedings of the 24th Eurographics Symposium on Rendering}
}'
chicago: Eikel, Benjamin, Claudius Jähn, Matthias Fischer, and Friedhelm Meyer auf
der Heide. “Spherical Visibility Sampling.” In Computer Graphics Forum,
32:49–58. Proceedings of the 24th Eurographics Symposium on Rendering, 2013. https://doi.org/10.1111/cgf.12150.
ieee: B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Spherical Visibility
Sampling,” in Computer Graphics Forum, 2013, vol. 32, no. 4, pp. 49–58.
mla: Eikel, Benjamin, et al. “Spherical Visibility Sampling.” Computer Graphics
Forum, vol. 32, no. 4, 2013, pp. 49–58, doi:10.1111/cgf.12150.
short: 'B. Eikel, C. Jähn, M. Fischer, F. Meyer auf der Heide, in: Computer Graphics
Forum, 2013, pp. 49–58.'
date_created: 2020-04-03T07:48:48Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1111/cgf.12150
intvolume: ' 32'
issue: '4'
language:
- iso: eng
page: 49-58
publication: Computer Graphics Forum
publication_identifier:
issn:
- 0167-7055
publication_status: published
series_title: Proceedings of the 24th Eurographics Symposium on Rendering
status: public
title: Spherical Visibility Sampling
type: conference
user_id: '15415'
volume: 32
year: '2013'
...
---
_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: Advances
in Visual Computing. Berlin, Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_12'
apa: Jähn, C., Eikel, B., Fischer, M., Petring, R., & Meyer auf der Heide, F.
(2013). Evaluation of Rendering Algorithms Using Position-Dependent Scene Properties.
In Advances in Visual Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_12
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={10.1007/978-3-642-41914-0_12},
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 Advances in Visual Computing. Berlin, Heidelberg,
2013. https://doi.org/10.1007/978-3-642-41914-0_12.
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 Advances
in Visual Computing, Berlin, Heidelberg, 2013.
mla: Jähn, Claudius, et al. “Evaluation of Rendering Algorithms Using Position-Dependent
Scene Properties.” Advances in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_12.
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: Advances in Visual Computing. Berlin,
Heidelberg; 2013. doi:10.1007/978-3-642-41914-0_44'
apa: Petring, R., Eikel, B., Jähn, C., Fischer, M., & Meyer auf der Heide, F.
(2013). Real-Time 3D Rendering of Heterogeneous Scenes. In Advances in Visual
Computing. Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41914-0_44
bibtex: '@inbook{Petring_Eikel_Jähn_Fischer_Meyer auf der Heide_2013, place={Berlin,
Heidelberg}, title={Real-Time 3D Rendering of Heterogeneous Scenes}, DOI={10.1007/978-3-642-41914-0_44},
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 Advances
in Visual Computing. Berlin, Heidelberg, 2013. https://doi.org/10.1007/978-3-642-41914-0_44.
ieee: R. Petring, B. Eikel, C. Jähn, M. Fischer, and F. Meyer auf der Heide, “Real-Time
3D Rendering of Heterogeneous Scenes,” in Advances in Visual Computing,
Berlin, Heidelberg, 2013.
mla: Petring, Ralf, et al. “Real-Time 3D Rendering of Heterogeneous Scenes.” Advances
in Visual Computing, 2013, doi:10.1007/978-3-642-41914-0_44.
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: Advances
in Visual Computing. Vol 7431. Lecture Notes in Computer Science. ; 2012:502-512.
doi:10.1007/978-3-642-33179-4_48'
apa: Suess, T., Koch, C., Jähn, C., Fischer, M., & Meyer auf der Heide, F. (2012).
Asynchronous Occlusion Culling on Heterogeneous PC Clusters for Distributed 3D
Scenes. Advances in Visual Computing, 7431, 502–512. https://doi.org/10.1007/978-3-642-33179-4_48
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={10.1007/978-3-642-33179-4_48},
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 Advances in Visual Computing, 7431:502–12.
Lecture Notes in Computer Science. Berlin, Heidelberg, 2012. https://doi.org/10.1007/978-3-642-33179-4_48.
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
Advances in Visual Computing, 2012, vol. 7431, pp. 502–512, doi: 10.1007/978-3-642-33179-4_48.'
mla: Suess, Tim, et al. “Asynchronous Occlusion Culling on Heterogeneous PC Clusters
for Distributed 3D Scenes.” Advances in Visual Computing, vol. 7431, 2012,
pp. 502–12, doi:10.1007/978-3-642-33179-4_48.
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. Proceedings of the Graphics Interface
2011 Conference, May 25-27, St. John’s, Newfoundland, Canada. Canadian Human-Computer
Communications Society; 2011:79--86.'
apa: Suess, T., Koch, C., Jähn, C., & Fischer, M. (2011). Approximative occlusion
culling using the hull tree. In S. Brooks & P. Irani (Eds.), Proceedings
of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland,
Canada (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 Proceedings of the Graphics Interface
2011 Conference, May 25-27, St. John’s, Newfoundland, Canada, 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 Proceedings of the Graphics Interface 2011 Conference,
May 25-27, St. John’s, Newfoundland, Canada, 2011, pp. 79--86.
mla: Suess, Tim, et al. “Approximative Occlusion Culling Using the Hull Tree.” Proceedings
of the Graphics Interface 2011 Conference, May 25-27, St. John’s, Newfoundland,
Canada, 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: Proceedings of the
2011 Winter Simulation Conference (WSC). ; 2011. doi:10.1109/wsc.2011.6147883'
apa: Klaas, A., Laroque, C., Dangelmaier, W., & Fischer, M. (2011). Simulation
aided, knowledge based routing for AGVs in a distribution warehouse. In Proceedings
of the 2011 Winter Simulation Conference (WSC). https://doi.org/10.1109/wsc.2011.6147883
bibtex: '@inproceedings{Klaas_Laroque_Dangelmaier_Fischer_2011, title={Simulation
aided, knowledge based routing for AGVs in a distribution warehouse}, DOI={10.1109/wsc.2011.6147883},
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 Proceedings of the 2011 Winter Simulation Conference (WSC),
2011. https://doi.org/10.1109/wsc.2011.6147883.
ieee: A. Klaas, C. Laroque, W. Dangelmaier, and M. Fischer, “Simulation aided, knowledge
based routing for AGVs in a distribution warehouse,” in Proceedings of the
2011 Winter Simulation Conference (WSC), 2011.
mla: Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs
in a Distribution Warehouse.” Proceedings of the 2011 Winter Simulation Conference
(WSC), 2011, doi:10.1109/wsc.2011.6147883.
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: Augmented &
Virtual Reality in Der Produktentstehung. Vol 295. Verlagsschriftenreihe des
Heinz Nixdorf Instituts; 2011:185--197.'
apa: Suess, T., Jähn, C., Fischer, M., Meyer auf der Heide, F., & Koch, C. (2011).
Ein paralleles Out-of-Core Renderingsystem für Standard-Rechnernetze. Augmented
& Virtual Reality in Der Produktentstehung, 295, 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 & 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 Augmented & Virtual Reality in Der Produktentstehung, 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 Augmented &
Virtual Reality in der Produktentstehung, 2011, vol. 295, pp. 185--197.
mla: Suess, Tim, et al. “Ein Paralleles Out-of-Core Renderingsystem Für Standard-Rechnernetze.”
Augmented & Virtual Reality in Der Produktentstehung, 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
& 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: Proceedings of
The 25th European Simulation and Modelling Conference - ESM2011. ; 2011.'
apa: Renken, H., Laroque, C., & Fischer, M. (2011). An Easy Extendable Modeling
Framework for Discrete Event Simulation Models and their Visualization. In Proceedings
of The 25th European Simulation and Modelling Conference - ESM2011.
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 Proceedings of The 25th European Simulation and Modelling Conference - ESM2011,
2011.
ieee: H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework
for Discrete Event Simulation Models and their Visualization,” in Proceedings
of The 25th European Simulation and Modelling Conference - ESM2011, 2011.
mla: Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete
Event Simulation Models and Their Visualization.” Proceedings of The 25th European
Simulation and Modelling Conference - ESM2011, 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., & Meyer auf der Heide, F. (2011).
Parallel Out-of-Core Occlusion Culling.
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. Parallel Out-of-Core Occlusion Culling. 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'
...
---
_id: '16410'
abstract:
- lang: eng
text: 'Gathering n mobile robots in one single point in the Euclidean plane is a
widely studied problem from the area of robot formation problems. Classically,
the robots are assumed to have no physical extent, and they are able to share
a position with other robots. We drop these assumptions and investigate a similar
problem for robots with (a spherical) extent: the goal is to gather the robots
as close together as possible. More exactly, we want the robots to form a sphere
with minimum radius around a predefined point. We propose an algorithm for this
problem which synchronously moves the robots towards the center of the sphere
unless they block each other. In this case, if possible, the robots spin around
the center of the sphere. We analyze this algorithm experimentally in the plane.
If R is the distance of the farthest robot to the center of the sphere, the simulations
indicate a runtime which is linear in n and R. Additionally, we prove a theoretic
upper bound for the runtime of O(nR) for a discrete version of the problem. Simulations
also suggest a runtime of O(n + R) for the discrete version.'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. Collisionless Gathering of Robots
with an Extent. In: 37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011). Springer; 2011:178-189. doi:10.1007/978-3-642-18381-2_15'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). Collisionless Gathering of Robots with an Extent. In
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011) (pp. 178–189). Springer. https://doi.org/10.1007/978-3-642-18381-2_15
bibtex: '@inproceedings{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, title={Collisionless Gathering of Robots with an Extent},
DOI={10.1007/978-3-642-18381-2_15},
number={6543}, booktitle={37th International Conference on Current Trends in Theory
and Practice of Computer Science (SOFSEM 2011)}, publisher={Springer}, author={Cord-Landwehr,
Andreas and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011}, pages={178–189} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “Collisionless Gathering
of Robots with an Extent.” In 37th International Conference on Current Trends
in Theory and Practice of Computer Science (SOFSEM 2011), 178–89. Springer,
2011. https://doi.org/10.1007/978-3-642-18381-2_15.
ieee: A. Cord-Landwehr et al., “Collisionless Gathering of Robots with an
Extent,” in 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011), 2011, no. 6543, pp. 178–189.
mla: Cord-Landwehr, Andreas, et al. “Collisionless Gathering of Robots with an Extent.”
37th International Conference on Current Trends in Theory and Practice of Computer
Science (SOFSEM 2011), no. 6543, Springer, 2011, pp. 178–89, doi:10.1007/978-3-642-18381-2_15.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: 37th International Conference on Current
Trends in Theory and Practice of Computer Science (SOFSEM 2011), Springer, 2011,
pp. 178–189.'
date_created: 2020-04-06T07:52:42Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-18381-2_15
issue: '6543'
language:
- iso: eng
page: 178-189
publication: 37th International Conference on Current Trends in Theory and Practice
of Computer Science (SOFSEM 2011)
publication_identifier:
isbn:
- '9783642183805'
- '9783642183812'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
status: public
title: Collisionless Gathering of Robots with an Extent
type: conference
user_id: '15415'
year: '2011'
...
---
_id: '16409'
abstract:
- lang: eng
text: "Given a set of n mobile robots in the d-dimensional Euclidean space, the
goal is to let them converge to a single not predefined point. The challenge is
that the robots are limited in their capabilities. Robots can, upon activation,
compute the positions of all other robots using an individual affine coordinate
system. The robots are indistinguishable, oblivious and may have different affine
coordinate systems. A very general discrete time model assumes that robots are
activated in arbitrary order. Further, the computation of a new target point may
happen much earlier than the movement, so that the movement is based on outdated
information about other robot's positions. Time is measured as the number of rounds,
where a round ends as soon as each robot has moved at least once. In [Cohen, Peleg:
Convergence properties of gravitational algorithms in asynchronous robot systems],
the Center of Gravity is considered as target function, convergence was proven,
and the number of rounds needed for halving the diameter of the convex hull of
the robot's positions was shown to be O(n^2) and Omega(n). We present an easy-to-check
property of target functions that guarantee convergence and yields upper time
bounds. This property intuitively says that when a robot computes a new target
point, this point is significantly within the current axes aligned minimal box
containing all robots. This property holds, e.g., for the above-mentioned target
function, and improves the above O(n^2) to an asymptotically optimal O(n) upper
bound. Our technique also yields a constant time bound for a target function that
requires all robots having identical coordinate axes.\r\n"
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Martina
full_name: Hüllmann, Martina
last_name: Hüllmann
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Alexander
full_name: Klaas, Alexander
last_name: Klaas
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Sven
full_name: Kurras, Sven
last_name: Kurras
- first_name: Marcus
full_name: Märtens, Marcus
last_name: Märtens
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christoph
full_name: Raupach, Christoph
last_name: Raupach
- first_name: Kamil
full_name: Swierkot, Kamil
last_name: Swierkot
- first_name: Daniel
full_name: Warner, Daniel
last_name: Warner
- first_name: Christoph
full_name: Weddemann, Christoph
last_name: Weddemann
- first_name: Daniel
full_name: Wonisch, Daniel
last_name: Wonisch
citation:
ama: 'Cord-Landwehr A, Degener B, Fischer M, et al. A New Approach for Analyzing
Convergence Algorithms for Mobile Robots. In: Automata, Languages and Programming.
Berlin, Heidelberg; 2011. doi:10.1007/978-3-642-22012-8_52'
apa: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas,
A., … Wonisch, D. (2011). A New Approach for Analyzing Convergence Algorithms
for Mobile Robots. In Automata, Languages and Programming. Berlin, Heidelberg.
https://doi.org/10.1007/978-3-642-22012-8_52
bibtex: '@inbook{Cord-Landwehr_Degener_Fischer_Hüllmann_Kempkes_Klaas_Kling_Kurras_Märtens_Meyer
auf der Heide_et al._2011, place={Berlin, Heidelberg}, title={A New Approach for
Analyzing Convergence Algorithms for Mobile Robots}, DOI={10.1007/978-3-642-22012-8_52},
booktitle={Automata, Languages and Programming}, author={Cord-Landwehr, Andreas
and Degener, Bastian and Fischer, Matthias and Hüllmann, Martina and Kempkes,
Barbara and Klaas, Alexander and Kling, Peter and Kurras, Sven and Märtens, Marcus
and Meyer auf der Heide, Friedhelm and et al.}, year={2011} }'
chicago: Cord-Landwehr, Andreas, Bastian Degener, Matthias Fischer, Martina Hüllmann,
Barbara Kempkes, Alexander Klaas, Peter Kling, et al. “A New Approach for Analyzing
Convergence Algorithms for Mobile Robots.” In Automata, Languages and Programming.
Berlin, Heidelberg, 2011. https://doi.org/10.1007/978-3-642-22012-8_52.
ieee: A. Cord-Landwehr et al., “A New Approach for Analyzing Convergence
Algorithms for Mobile Robots,” in Automata, Languages and Programming,
Berlin, Heidelberg, 2011.
mla: Cord-Landwehr, Andreas, et al. “A New Approach for Analyzing Convergence Algorithms
for Mobile Robots.” Automata, Languages and Programming, 2011, doi:10.1007/978-3-642-22012-8_52.
short: 'A. Cord-Landwehr, B. Degener, M. Fischer, M. Hüllmann, B. Kempkes, A. Klaas,
P. Kling, S. Kurras, M. Märtens, F. Meyer auf der Heide, C. Raupach, K. Swierkot,
D. Warner, C. Weddemann, D. Wonisch, in: Automata, Languages and Programming,
Berlin, Heidelberg, 2011.'
date_created: 2020-04-06T07:47:55Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-642-22012-8_52
language:
- iso: eng
place: Berlin, Heidelberg
publication: Automata, Languages and Programming
publication_identifier:
isbn:
- '9783642220111'
- '9783642220128'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: A New Approach for Analyzing Convergence Algorithms for Mobile Robots
type: book_chapter
user_id: '15415'
year: '2011'
...
---
_id: '26384'
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: Proceedings of
The 25th European Simulation and Modelling Conference - ESM\x922011. ; 2011."
apa: "Renken, H., Laroque, C., & Fischer, M. (2011). An Easy Extendable Modeling
Framework for Discrete Event Simulation Models and their Visualization. Proceedings
of The 25th European Simulation and Modelling Conference - ESM\x922011."
bibtex: "@inproceedings{Renken_Laroque_Fischer_2011, title={An Easy Extendable Modeling
Framework for Discrete Event Simulation Models and their Visualization}, booktitle={Proceedings
of The 25th European Simulation and Modelling Conference - ESM\x922011}, 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 Proceedings of The 25th European Simulation and Modelling Conference - ESM\x922011,
2011."
ieee: H. Renken, C. Laroque, and M. Fischer, “An Easy Extendable Modeling Framework
for Discrete Event Simulation Models and their Visualization,” 2011.
mla: "Renken, Hendrik, et al. “An Easy Extendable Modeling Framework for Discrete
Event Simulation Models and Their Visualization.” Proceedings of The 25th European
Simulation and Modelling Conference - ESM\x922011, 2011."
short: "H. Renken, C. Laroque, M. Fischer, in: Proceedings of The 25th European
Simulation and Modelling Conference - ESM\x922011, 2011."
date_created: 2021-10-16T22:43:30Z
date_updated: 2022-01-25T18:15:43Z
department:
- _id: '671'
language:
- iso: eng
publication: "Proceedings of The 25th European Simulation and Modelling Conference
- ESM\x922011"
publication_status: published
status: public
title: An Easy Extendable Modeling Framework for Discrete Event Simulation Models
and their Visualization
type: conference
user_id: '71124'
year: '2011'
...
---
_id: '26387'
author:
- first_name: 'Alexander '
full_name: 'Klaas, Alexander '
last_name: Klaas
- first_name: 'Christoph '
full_name: 'Laroque, Christoph '
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Klaas A, Laroque C, Fischer M, Dangelmaier W. Simulation Aided, Knowledge
Based Routing for AGVs in a Distribution Warehouse. In: Proceedings of the
2011 Winter Simulation Conference. ; 2011.'
apa: Klaas, A., Laroque, C., Fischer, M., & Dangelmaier, W. (2011). Simulation
Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse. Proceedings
of the 2011 Winter Simulation Conference.
bibtex: '@inproceedings{Klaas_Laroque_Fischer_Dangelmaier_2011, title={Simulation
Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse}, booktitle={Proceedings
of the 2011 Winter Simulation Conference}, author={Klaas, Alexander and Laroque,
Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2011} }'
chicago: Klaas, Alexander , Christoph Laroque, Matthias Fischer, and Wilhelm Dangelmaier.
“Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse.”
In Proceedings of the 2011 Winter Simulation Conference, 2011.
ieee: A. Klaas, C. Laroque, M. Fischer, and W. Dangelmaier, “Simulation Aided, Knowledge
Based Routing for AGVs in a Distribution Warehouse,” 2011.
mla: Klaas, Alexander, et al. “Simulation Aided, Knowledge Based Routing for AGVs
in a Distribution Warehouse.” Proceedings of the 2011 Winter Simulation Conference,
2011.
short: 'A. Klaas, C. Laroque, M. Fischer, W. Dangelmaier, in: Proceedings of the
2011 Winter Simulation Conference, 2011.'
date_created: 2021-10-16T22:54:06Z
date_updated: 2022-01-25T18:16:03Z
department:
- _id: '671'
language:
- iso: eng
publication: Proceedings of the 2011 Winter Simulation Conference
publication_status: published
status: public
title: Simulation Aided, Knowledge Based Routing for AGVs in a Distribution Warehouse
type: conference
user_id: '71124'
year: '2011'
...
---
_id: '17422'
abstract:
- lang: eng
text: "Commercial software of material flow simulations has the ability to layout
the simulated models. Arranged equipment, such as conveyors or machines, includes
the need to model and determine motion paths for moving objects like forklifts
or automatically guided vehicles, so that the simulation framework is able to
navigate all vehicles across those motion paths. After analyzing first scenarios,
the user often carries out layout changes in the simulation model, e.g. moving,
adding or deleting equipment. However, those changes cause time consuming, additional
modeling of the motion paths for the user. Our motion planning algorithm reduces
these changes by automatically determining the motion paths for moving objects,
depending on an actual model layout without colliding with other objects. The
algorithm works on the basis of the virtual scene\x92s 3D-data used for the simulation
model\x92s visualization. We demonstrate the technique with a multi-floor building
example."
author:
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Hendrik
full_name: Renken, Hendrik
last_name: Renken
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Guido
full_name: Schaumann, Guido
last_name: Schaumann
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Fischer M, Renken H, Laroque C, Schaumann G, Dangelmaier W. Automated 3D-motion
planning for ramps and stairs in intra-logistics material flow simulations. In:
Proceedings of the 2010 Winter Simulation Conference. ; 2010. doi:10.1109/wsc.2010.5678906'
apa: Fischer, M., Renken, H., Laroque, C., Schaumann, G., & Dangelmaier, W.
(2010). Automated 3D-motion planning for ramps and stairs in intra-logistics material
flow simulations. In Proceedings of the 2010 Winter Simulation Conference.
https://doi.org/10.1109/wsc.2010.5678906
bibtex: '@inproceedings{Fischer_Renken_Laroque_Schaumann_Dangelmaier_2010, title={Automated
3D-motion planning for ramps and stairs in intra-logistics material flow simulations},
DOI={10.1109/wsc.2010.5678906},
booktitle={Proceedings of the 2010 Winter Simulation Conference}, author={Fischer,
Matthias and Renken, Hendrik and Laroque, Christoph and Schaumann, Guido and Dangelmaier,
Wilhelm}, year={2010} }'
chicago: Fischer, Matthias, Hendrik Renken, Christoph Laroque, Guido Schaumann,
and Wilhelm Dangelmaier. “Automated 3D-Motion Planning for Ramps and Stairs in
Intra-Logistics Material Flow Simulations.” In Proceedings of the 2010 Winter
Simulation Conference, 2010. https://doi.org/10.1109/wsc.2010.5678906.
ieee: M. Fischer, H. Renken, C. Laroque, G. Schaumann, and W. Dangelmaier, “Automated
3D-motion planning for ramps and stairs in intra-logistics material flow simulations,”
in Proceedings of the 2010 Winter Simulation Conference, 2010.
mla: Fischer, Matthias, et al. “Automated 3D-Motion Planning for Ramps and Stairs
in Intra-Logistics Material Flow Simulations.” Proceedings of the 2010 Winter
Simulation Conference, 2010, doi:10.1109/wsc.2010.5678906.
short: 'M. Fischer, H. Renken, C. Laroque, G. Schaumann, W. Dangelmaier, in: Proceedings
of the 2010 Winter Simulation Conference, 2010.'
date_created: 2020-07-27T19:33:16Z
date_updated: 2022-01-06T06:53:11Z
department:
- _id: '63'
doi: 10.1109/wsc.2010.5678906
language:
- iso: eng
publication: Proceedings of the 2010 Winter Simulation Conference
publication_identifier:
isbn:
- '9781424498666'
publication_status: published
status: public
title: Automated 3D-motion planning for ramps and stairs in intra-logistics material
flow simulations
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '18136'
abstract:
- lang: eng
text: We present a parallel algorithm for the rendering of complex three-dimensional
scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting
of a visualization-node, equipped with a powerful graphics adapter, and cluster
nodes requiring weaker graphics capabilities only. The visualization-node renders
a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes
assist the visualization-node by asynchronous computing of Reliefboards, which
are used to replace and render distant parts of the scene. Our algorithm is capable
of gaining significant speedups if the cluster's nodes provide weak graphics adapters
only. We trade the number of cluster nodes off the scene objects' image quality.
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: Tim
full_name: Suess, Tim
last_name: Suess
citation:
ama: 'Fischer M, Jähn C, Suess T. Asynchronous Parallel Reliefboard Computation
for Scene Object Approximation. In: Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV). The Eurographics Association; 2010:43-51. doi:10.2312/EGPGV/EGPGV10/043-051'
apa: Fischer, M., Jähn, C., & Suess, T. (2010). Asynchronous Parallel Reliefboard
Computation for Scene Object Approximation. Eurographics Symposium on Parallel
Graphics and Visualization (EGPGV), 43–51. https://doi.org/10.2312/EGPGV/EGPGV10/043-051
bibtex: '@inproceedings{Fischer_Jähn_Suess_2010, title={Asynchronous Parallel Reliefboard
Computation for Scene Object Approximation}, DOI={10.2312/EGPGV/EGPGV10/043-051},
booktitle={Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)},
publisher={The Eurographics Association}, author={Fischer, Matthias and Jähn,
Claudius and Suess, Tim}, year={2010}, pages={43–51} }'
chicago: Fischer, Matthias, Claudius Jähn, and Tim Suess. “Asynchronous Parallel
Reliefboard Computation for Scene Object Approximation.” In Eurographics Symposium
on Parallel Graphics and Visualization (EGPGV), 43–51. The Eurographics Association,
2010. https://doi.org/10.2312/EGPGV/EGPGV10/043-051.
ieee: 'M. Fischer, C. Jähn, and T. Suess, “Asynchronous Parallel Reliefboard Computation
for Scene Object Approximation,” in Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV), 2010, pp. 43–51, doi: 10.2312/EGPGV/EGPGV10/043-051.'
mla: Fischer, Matthias, et al. “Asynchronous Parallel Reliefboard Computation for
Scene Object Approximation.” Eurographics Symposium on Parallel Graphics and
Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51, doi:10.2312/EGPGV/EGPGV10/043-051.
short: 'M. Fischer, C. Jähn, T. Suess, in: Eurographics Symposium on Parallel Graphics
and Visualization (EGPGV), The Eurographics Association, 2010, pp. 43–51.'
date_created: 2020-08-24T07:07:55Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
doi: 10.2312/EGPGV/EGPGV10/043-051
language:
- iso: eng
page: 43-51
publication: Eurographics Symposium on Parallel Graphics and Visualization (EGPGV)
publisher: The Eurographics Association
status: public
title: Asynchronous Parallel Reliefboard Computation for Scene Object Approximation
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '18289'
abstract:
- lang: eng
text: Many professional cluster systems consist of nodes with different hardware
configurations. Such heterogeneous environments require different load-balancing
techniques than homogenous environments. The c-load-collision-protocol is able
to achieve good results for data-management purposes. Using this protocol, we
propose a way for load-balancing in interactive rendering environments. For this
work, we implemented a parallel rendering system and took different picking strategies
into account to compare the results. The advantage of our approach compared to
other approaches is that we group the available nodes of a cluster into two different
categories, based on the hardware abilities. Some nodes are used solely for rendering,
while others serve as secondary storage and to assist the former ones by performing
auxiliary calculations.
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Timo
full_name: Wiesemann, Timo
last_name: Wiesemann
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Suess T, Wiesemann T, Fischer M. Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments. In: 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage. ; 2010:448-456. doi:10.1109/nas.2010.52'
apa: Suess, T., Wiesemann, T., & Fischer, M. (2010). Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments. 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 448–456. https://doi.org/10.1109/nas.2010.52
bibtex: '@inproceedings{Suess_Wiesemann_Fischer_2010, title={Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments}, DOI={10.1109/nas.2010.52},
booktitle={2010 IEEE Fifth International Conference on Networking, Architecture,
and Storage}, author={Suess, Tim and Wiesemann, Timo and Fischer, Matthias}, year={2010},
pages={448–456} }'
chicago: Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Evaluation of a C-Load-Collision-Protocol
for Load-Balancing in Interactive Environments.” In 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 448–56, 2010. https://doi.org/10.1109/nas.2010.52.
ieee: 'T. Suess, T. Wiesemann, and M. Fischer, “Evaluation of a c-Load-Collision-Protocol
for Load-Balancing in Interactive Environments,” in 2010 IEEE Fifth International
Conference on Networking, Architecture, and Storage, 2010, pp. 448–456, doi:
10.1109/nas.2010.52.'
mla: Suess, Tim, et al. “Evaluation of a C-Load-Collision-Protocol for Load-Balancing
in Interactive Environments.” 2010 IEEE Fifth International Conference on Networking,
Architecture, and Storage, 2010, pp. 448–56, doi:10.1109/nas.2010.52.
short: 'T. Suess, T. Wiesemann, M. Fischer, in: 2010 IEEE Fifth International Conference
on Networking, Architecture, and Storage, 2010, pp. 448–456.'
date_created: 2020-08-25T14:04:38Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
doi: 10.1109/nas.2010.52
language:
- iso: eng
page: 448 - 456
publication: 2010 IEEE Fifth International Conference on Networking, Architecture,
and Storage
publication_identifier:
isbn:
- '9781424481330'
publication_status: published
status: public
title: Evaluation of a c-Load-Collision-Protocol for Load-Balancing in Interactive
Environments
type: conference
user_id: '15415'
year: '2010'
...
---
_id: '18290'
abstract:
- lang: ger
text: "Typischerweise sind die Knoten eines PC-Clusters nicht mit leistungsfähigen
Grafikkarten ausgestattet. Dennoch bieten Cluster-Betreiber einige wenige Rechenknoten
an, die mit Highend-Grafikkarten ausgestattet sind, um beispielsweise eine PowerWall
zu betreiben. Wenn zwischen diesen unterschiedlichen Knotentypen ein schnelles
Netzwerk existiert, kann die Bilderzeugung durch die Knoten mit schwacher Grafikkarte
beschleunigt werden. Dabei können die unterschiedlichen Knotentypen unterschiedliche
Aufgabe bearbeiten. In einem solchen heterogenen System, müssen die unterschiedlichen
entstehenden Lasten auf andere Weise verteilt werden, als in einem System, bei
dem alle Knoten gleich ausgestattet sind. Wir präsentieren in dieser Arbeit Lastbalancierungsmechanismen,
die in einem parallelen Out-of-Core-Renderingsystem für heterogene PC-Cluster
eingesetzt werden.\r\n"
author:
- first_name: Tim
full_name: Suess, Tim
last_name: Suess
- first_name: Timo
full_name: Wiesemann, Timo
last_name: Wiesemann
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
citation:
ama: 'Suess T, Wiesemann T, Fischer M. Gewichtetes c-Collision-Protokoll zur Balancierung
eines parallelen Out-of-Core-Renderingsystems. In: Augmented & Virtual
Reality in Der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn. ; 2010:39-52.'
apa: Suess, T., Wiesemann, T., & Fischer, M. (2010). Gewichtetes c-Collision-Protokoll
zur Balancierung eines parallelen Out-of-Core-Renderingsystems. In Augmented
& Virtual Reality in der Produktentstehung (pp. 39–52).
bibtex: '@inbook{Suess_Wiesemann_Fischer_2010, series={Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn}, title={Gewichtetes c-Collision-Protokoll
zur Balancierung eines parallelen Out-of-Core-Renderingsystems}, booktitle={Augmented
& Virtual Reality in der Produktentstehung}, author={Suess, Tim and Wiesemann,
Timo and Fischer, Matthias}, year={2010}, pages={39–52}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Suess, Tim, Timo Wiesemann, and Matthias Fischer. “Gewichtetes C-Collision-Protokoll
Zur Balancierung Eines Parallelen Out-of-Core-Renderingsystems.” In Augmented
& Virtual Reality in Der Produktentstehung, 39–52. Verlagsschriftenreihe
Des Heinz Nixdorf Instituts, Paderborn, 2010.
ieee: T. Suess, T. Wiesemann, and M. Fischer, “Gewichtetes c-Collision-Protokoll
zur Balancierung eines parallelen Out-of-Core-Renderingsystems,” in Augmented
& Virtual Reality in der Produktentstehung, 2010, pp. 39–52.
mla: Suess, Tim, et al. “Gewichtetes C-Collision-Protokoll Zur Balancierung Eines
Parallelen Out-of-Core-Renderingsystems.” Augmented & Virtual Reality in
Der Produktentstehung, 2010, pp. 39–52.
short: 'T. Suess, T. Wiesemann, M. Fischer, in: Augmented & Virtual Reality
in Der Produktentstehung, 2010, pp. 39–52.'
date_created: 2020-08-25T14:14:36Z
date_updated: 2022-01-06T06:53:28Z
department:
- _id: '63'
language:
- iso: eng
page: 39-52
publication: Augmented & Virtual Reality in der Produktentstehung
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Gewichtetes c-Collision-Protokoll zur Balancierung eines parallelen Out-of-Core-Renderingsystems
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '16505'
abstract:
- lang: eng
text: We present an approach for real-time rendering of complex 3D scenes consisting
of millions of polygons on limited graphics hardware. In a preprocessing step,
powerful hardware is used to gain fine granular global visibility information
of a scene using an adaptive sampling algorithm. Additively the visual influence
of each object on the eventual rendered image is estimated. This influence is
used to select the most important objects to display in our approximative culling
algorithm. After the visibility data is compressed to meet the storage capabilities
of small devices, we achieve an interactive walkthrough of the Power Plant scene
on a standard netbook with an integrated graphics chipset.
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
citation:
ama: 'Eikel B, Jähn C, Fischer M. Preprocessed Global Visibility for Real-Time Rendering
on Low-End Hardware. In: Advances in Visual Computing. Berlin, Heidelberg;
2010. doi:10.1007/978-3-642-17289-2_60'
apa: Eikel, B., Jähn, C., & Fischer, M. (2010). Preprocessed Global Visibility
for Real-Time Rendering on Low-End Hardware. In Advances in Visual Computing.
Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17289-2_60
bibtex: '@inbook{Eikel_Jähn_Fischer_2010, place={Berlin, Heidelberg}, title={Preprocessed
Global Visibility for Real-Time Rendering on Low-End Hardware}, DOI={10.1007/978-3-642-17289-2_60},
booktitle={Advances in Visual Computing}, author={Eikel, Benjamin and Jähn, Claudius
and Fischer, Matthias}, year={2010} }'
chicago: Eikel, Benjamin, Claudius Jähn, and Matthias Fischer. “Preprocessed Global
Visibility for Real-Time Rendering on Low-End Hardware.” In Advances in Visual
Computing. Berlin, Heidelberg, 2010. https://doi.org/10.1007/978-3-642-17289-2_60.
ieee: B. Eikel, C. Jähn, and M. Fischer, “Preprocessed Global Visibility for Real-Time
Rendering on Low-End Hardware,” in Advances in Visual Computing, Berlin,
Heidelberg, 2010.
mla: Eikel, Benjamin, et al. “Preprocessed Global Visibility for Real-Time Rendering
on Low-End Hardware.” Advances in Visual Computing, 2010, doi:10.1007/978-3-642-17289-2_60.
short: 'B. Eikel, C. Jähn, M. Fischer, in: Advances in Visual Computing, Berlin,
Heidelberg, 2010.'
date_created: 2020-04-14T13:06:51Z
date_updated: 2022-01-06T06:52:52Z
department:
- _id: '63'
doi: 10.1007/978-3-642-17289-2_60
language:
- iso: eng
place: Berlin, Heidelberg
publication: Advances in Visual Computing
publication_identifier:
isbn:
- '9783642172885'
- '9783642172892'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Preprocessed Global Visibility for Real-Time Rendering on Low-End Hardware
type: book_chapter
user_id: '15415'
year: '2010'
...
---
_id: '18138'
abstract:
- lang: eng
text: Modern companies are nowadays confronted with an increasing demand of multiple
products, where they need to perform more flexible every day. Cost-intensive decisions
are to be confirmed in short times, in order to minimize risks and secure efficient
production programs as well as material flows. Tools for this digital planning
via simulation methods are one well established possibility to receive decision
support. Nevertheless, the creation of the necessary simulation models is a complicated
and error-prone process, where complexity of modeling, validation and verification
depends on the used tool and its functionalities. This paper presents implemented
concepts for an innovative user support in his tasks of verification and validation
of simulation models during the execution of a simulation run. Time-intensive
procedures like stopping simulation, parameterization and restarting within the
problem analysis are simplified. So the user is able to focus on the real problem
solving task.
author:
- first_name: Christoph
full_name: Laroque, Christoph
last_name: Laroque
- first_name: Matthias
full_name: Fischer, Matthias
id: '146'
last_name: Fischer
- first_name: Wilhelm
full_name: Dangelmaier, Wilhelm
last_name: Dangelmaier
citation:
ama: 'Laroque C, Fischer M, Dangelmaier W. Concepts for Model Verification and Validation
during Simulation Runtime. In: European Simulation and Modelling Conference
(ESM 2009). EUROSIS-ETI; 2009.'
apa: Laroque, C., Fischer, M., & Dangelmaier, W. (2009). Concepts for Model
Verification and Validation during Simulation Runtime. In European Simulation
and Modelling Conference (ESM 2009). EUROSIS-ETI.
bibtex: '@inproceedings{Laroque_Fischer_Dangelmaier_2009, title={Concepts for Model
Verification and Validation during Simulation Runtime}, booktitle={European Simulation
and Modelling Conference (ESM 2009)}, publisher={EUROSIS-ETI}, author={Laroque,
Christoph and Fischer, Matthias and Dangelmaier, Wilhelm}, year={2009} }'
chicago: Laroque, Christoph, Matthias Fischer, and Wilhelm Dangelmaier. “Concepts
for Model Verification and Validation during Simulation Runtime.” In European
Simulation and Modelling Conference (ESM 2009). EUROSIS-ETI, 2009.
ieee: C. Laroque, M. Fischer, and W. Dangelmaier, “Concepts for Model Verification
and Validation during Simulation Runtime,” in European Simulation and Modelling
Conference (ESM 2009), 2009.
mla: Laroque, Christoph, et al. “Concepts for Model Verification and Validation
during Simulation Runtime.” European Simulation and Modelling Conference (ESM
2009), EUROSIS-ETI, 2009.
short: 'C. Laroque, M. Fischer, W. Dangelmaier, in: European Simulation and Modelling
Conference (ESM 2009), EUROSIS-ETI, 2009.'
date_created: 2020-08-24T07:28:23Z
date_updated: 2022-01-06T06:53:26Z
department:
- _id: '63'
language:
- iso: eng
publication: European Simulation and Modelling Conference (ESM 2009)
publisher: EUROSIS-ETI
status: public
title: Concepts for Model Verification and Validation during Simulation Runtime
type: conference
user_id: '15415'
year: '2009'
...