---
_id: '16391'
author:
- first_name: Bastian
full_name: Degener, Bastian
last_name: Degener
- first_name: Barbara
full_name: Kempkes, Barbara
last_name: Kempkes
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Degener B, Kempkes B, Kling P, Meyer auf der Heide F. Linear and Competitive
Strategies for Continuous Robot Formation Problems. ACM Transactions on Parallel
Computing. 2015:1-18. doi:10.1145/2742341
apa: Degener, B., Kempkes, B., Kling, P., & Meyer auf der Heide, F. (2015).
Linear and Competitive Strategies for Continuous Robot Formation Problems. ACM
Transactions on Parallel Computing, 1–18. https://doi.org/10.1145/2742341
bibtex: '@article{Degener_Kempkes_Kling_Meyer auf der Heide_2015, title={Linear
and Competitive Strategies for Continuous Robot Formation Problems}, DOI={10.1145/2742341},
journal={ACM Transactions on Parallel Computing}, author={Degener, Bastian and
Kempkes, Barbara and Kling, Peter and Meyer auf der Heide, Friedhelm}, year={2015},
pages={1–18} }'
chicago: Degener, Bastian, Barbara Kempkes, Peter Kling, and Friedhelm Meyer auf
der Heide. “Linear and Competitive Strategies for Continuous Robot Formation Problems.”
ACM Transactions on Parallel Computing, 2015, 1–18. https://doi.org/10.1145/2742341.
ieee: B. Degener, B. Kempkes, P. Kling, and F. Meyer auf der Heide, “Linear and
Competitive Strategies for Continuous Robot Formation Problems,” ACM Transactions
on Parallel Computing, pp. 1–18, 2015.
mla: Degener, Bastian, et al. “Linear and Competitive Strategies for Continuous
Robot Formation Problems.” ACM Transactions on Parallel Computing, 2015,
pp. 1–18, doi:10.1145/2742341.
short: B. Degener, B. Kempkes, P. Kling, F. Meyer auf der Heide, ACM Transactions
on Parallel Computing (2015) 1–18.
date_created: 2020-04-03T06:40:56Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1145/2742341
language:
- iso: eng
page: 1-18
publication: ACM Transactions on Parallel Computing
publication_identifier:
issn:
- 2329-4949
publication_status: published
status: public
title: Linear and Competitive Strategies for Continuous Robot Formation Problems
type: journal_article
user_id: '15415'
year: '2015'
...
---
_id: '16397'
abstract:
- lang: eng
text: "In the gathering problem, n autonomous robots have to meet on a single point.\r\nWe
consider the gathering of a closed chain of point-shaped, anonymous robots\r\non
a grid. The robots only have local knowledge about a constant number of\r\nneighboring
robots along the chain in both directions. Actions are performed in\r\nthe fully
synchronous time model FSYNC. Every robot has a limited memory that\r\nmay contain
one timestamp of the global clock, also visible to its direct\r\nneighbors. In
this synchronous time model, there is no limited view gathering\r\nalgorithm known
to perform better than in quadratic runtime. The configurations\r\nthat show the
quadratic lower bound are closed chains. In this paper, we\r\npresent the first
sub-quadratic---in fact linear time---gathering algorithm for\r\nclosed chains
on a grid."
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Andreas
full_name: Andreas Cord-Landwehr, Andreas
last_name: Andreas Cord-Landwehr
- 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, Andreas Cord-Landwehr A, Jung D, Meyer auf der Heide F. Towards
Gathering Robots with Limited View in Linear Time: The Closed Chain Case. ArXiv:
150104877. 2015.'
apa: 'Abshoff, S., Andreas Cord-Landwehr, A., Jung, D., & Meyer auf der Heide,
F. (2015). Towards Gathering Robots with Limited View in Linear Time: The Closed
Chain Case. ArXiv: 1501.04877.'
bibtex: '@article{Abshoff_Andreas Cord-Landwehr_Jung_Meyer auf der Heide_2015, title={Towards
Gathering Robots with Limited View in Linear Time: The Closed Chain Case}, journal={ArXiv:
1501.04877}, author={Abshoff, Sebastian and Andreas Cord-Landwehr, Andreas and
Jung, Daniel and Meyer auf der Heide, Friedhelm}, year={2015} }'
chicago: 'Abshoff, Sebastian, Andreas Andreas Cord-Landwehr, Daniel Jung, and Friedhelm
Meyer auf der Heide. “Towards Gathering Robots with Limited View in Linear Time:
The Closed Chain Case.” ArXiv: 1501.04877, 2015.'
ieee: 'S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, and F. Meyer auf der Heide,
“Towards Gathering Robots with Limited View in Linear Time: The Closed Chain
Case,” ArXiv: 1501.04877. 2015.'
mla: 'Abshoff, Sebastian, et al. “Towards Gathering Robots with Limited View in
Linear Time: The Closed Chain Case.” ArXiv: 1501.04877, 2015.'
short: 'S. Abshoff, A. Andreas Cord-Landwehr, D. Jung, F. Meyer auf der Heide, ArXiv:
1501.04877 (2015).'
date_created: 2020-04-03T09:36:54Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
external_id:
arxiv:
- '1501.04877'
language:
- iso: eng
publication: 'ArXiv: 1501.04877'
status: public
title: 'Towards Gathering Robots with Limited View in Linear Time: The Closed Chain
Case'
type: preprint
user_id: '15415'
year: '2015'
...
---
_id: '52655'
author:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
id: '163'
last_name: Gausemeier
- first_name: M.
full_name: Grafe, M.
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: Gausemeier J, Grafe M, Meyer auf der Heide F. 12. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Vol Band 342.; 2015.
apa: 'Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (2015). 12. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung: Vol. Band 342.'
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2015, series={HNI-Verlagsschriftreihe},
title={12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung},
volume={Band 342}, author={Gausemeier, Jürgen and Grafe, M. and Meyer auf der
Heide, Friedhelm}, year={2015}, collection={HNI-Verlagsschriftreihe} }'
chicago: Gausemeier, Jürgen, M. Grafe, and Friedhelm Meyer auf der Heide. 12.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol. Band 342. HNI-Verlagsschriftreihe, 2015.
ieee: J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, 12. Paderborner Workshop
Augmented & Virtual Reality in der Produktentstehung, vol. Band 342. 2015.
mla: Gausemeier, Jürgen, et al. 12. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung. 2015.
short: J. Gausemeier, M. Grafe, F. Meyer auf der Heide, 12. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, 2015.
date_created: 2024-03-20T08:34:35Z
date_updated: 2024-04-02T09:47:53Z
department:
- _id: '26'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-942647-61-8
series_title: HNI-Verlagsschriftreihe
status: public
title: 12. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
type: misc
user_id: '5786'
volume: ' Band 342'
year: '2015'
...
---
_id: '368'
abstract:
- lang: eng
text: We consider the problem of scheduling a number of jobs on $m$ identical processors
sharing a continuously divisible resource. Each job j comes with a resource requirement
r_j \in {0,1}. The job can be processed at full speed if granted its full resource
requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction
of the full speed. Our goal is to find a resource assignment that minimizes the
makespan (i.e., the latest completion time). Variants of such problems, relating
the resource assignment of jobs to their \emph{processing speeds}, have been studied
under the term discrete-continuous scheduling. Known results are either very pessimistic
or heuristic in nature.In this paper, we suggest and analyze a slightly simplified
model. It focuses on the assignment of shared continuous resources to the processors.
The job assignment to processors and the ordering of the jobs have already been
fixed. It is shown that, even for unit size jobs, finding an optimal solution
is NP-hard if the number of processors is part of the input. Positive results
for unit size jobs include an efficient optimal algorithm for 2 processors. Moreover,
we prove that balanced schedules yield a 2-1/m-approximation for a fixed number
of processors. Such schedules are computed by our GreedyBalance algorithm, for
which the bound is tight.
author:
- first_name: Andre
full_name: Brinkmann, Andre
last_name: Brinkmann
- first_name: Peter
full_name: Kling, Peter
last_name: Kling
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Lars
full_name: Nagel, Lars
last_name: Nagel
- first_name: Sören
full_name: Riechers, Sören
last_name: Riechers
- first_name: 'Tim '
full_name: 'Suess, Tim '
last_name: Suess
citation:
ama: 'Brinkmann A, Kling P, Meyer auf der Heide F, Nagel L, Riechers S, Suess T.
Scheduling Shared Continuous Resources on Many-Cores. In: Proceedings of the
26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA).
; 2014:128-137. doi:10.1145/2612669.2612698'
apa: Brinkmann, A., Kling, P., Meyer auf der Heide, F., Nagel, L., Riechers, S.,
& Suess, T. (2014). Scheduling Shared Continuous Resources on Many-Cores.
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–137. https://doi.org/10.1145/2612669.2612698
bibtex: '@inproceedings{Brinkmann_Kling_Meyer auf der Heide_Nagel_Riechers_Suess_2014,
title={Scheduling Shared Continuous Resources on Many-Cores}, DOI={10.1145/2612669.2612698},
booktitle={Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA)}, author={Brinkmann, Andre and Kling, Peter and Meyer
auf der Heide, Friedhelm and Nagel, Lars and Riechers, Sören and Suess, Tim },
year={2014}, pages={128–137} }'
chicago: Brinkmann, Andre, Peter Kling, Friedhelm Meyer auf der Heide, Lars Nagel,
Sören Riechers, and Tim Suess. “Scheduling Shared Continuous Resources on Many-Cores.”
In Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 128–37, 2014. https://doi.org/10.1145/2612669.2612698.
ieee: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, and
T. Suess, “Scheduling Shared Continuous Resources on Many-Cores,” in Proceedings
of the 26th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA),
2014, pp. 128–137, doi: 10.1145/2612669.2612698.'
mla: Brinkmann, Andre, et al. “Scheduling Shared Continuous Resources on Many-Cores.”
Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and Architectures
(SPAA), 2014, pp. 128–37, doi:10.1145/2612669.2612698.
short: 'A. Brinkmann, P. Kling, F. Meyer auf der Heide, L. Nagel, S. Riechers, T.
Suess, in: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms
and Architectures (SPAA), 2014, pp. 128–137.'
date_created: 2017-10-17T12:42:03Z
date_updated: 2022-01-06T06:59:30Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1145/2612669.2612698
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:17:38Z
date_updated: 2018-03-20T07:17:38Z
file_id: '1403'
file_name: 368-BKMNRS14.pdf
file_size: 485767
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:17:38Z
has_accepted_license: '1'
language:
- iso: eng
page: 128-137
project:
- _id: '1'
name: SFB 901
- _id: '16'
name: SFB 901 - Subprojekt C4
- _id: '14'
name: SFB 901 - Subproject C2
- _id: '4'
name: SFB 901 - Project Area C
publication: Proceedings of the 26th ACM Symposium on Parallelism in Algorithms and
Architectures (SPAA)
status: public
title: Scheduling Shared Continuous Resources on Many-Cores
type: conference
user_id: '15415'
year: '2014'
...
---
_id: '379'
abstract:
- lang: eng
text: In the leasing variant of Set Cover presented by Anthony et al.[1], elements
U arrive over time and must be covered by sets from a familyF of subsets of U.
Each set can be leased for K different periods of time.Let |U| = n and |F| = m.
Leasing a set S for a period k incurs a cost ckS and allows S to cover its elements
for the next lk time steps. The objectiveis to minimize the total cost of the
sets leased, such that elements arrivingat any time t are covered by sets which
contain them and are leased duringtime t. Anthony et al. [1] gave an optimal O(log
n)-approximation forthe problem in the offline setting, unless P = NP [22]. In
this paper, wegive randomized algorithms for variants of Set Cover Leasing in
the onlinesetting, including a generalization of Online Set Cover with Repetitionspresented
by Alon et al. [2], where elements appear multiple times andmust be covered by
a different set at each arrival. Our results improve theO(log2(mn)) competitive
factor of Online Set Cover with Repetitions [2]to O(log d log(dn)) = O(logmlog(mn)),
where d is the maximum numberof sets an element belongs to.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Markarian C, Meyer auf der Heide F. Randomized Online Algorithms
for Set Cover Leasing Problems. In: Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA). LNCS. ;
2014:25-34. doi:10.1007/978-3-319-12691-3_3'
apa: Abshoff, S., Markarian, C., & Meyer auf der Heide, F. (2014). Randomized
Online Algorithms for Set Cover Leasing Problems. In Proceedings of the 8th
Annual International Conference on Combinatorial Optimization and Applications
(COCOA) (pp. 25–34). https://doi.org/10.1007/978-3-319-12691-3_3
bibtex: '@inproceedings{Abshoff_Markarian_Meyer auf der Heide_2014, series={LNCS},
title={Randomized Online Algorithms for Set Cover Leasing Problems}, DOI={10.1007/978-3-319-12691-3_3},
booktitle={Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)}, author={Abshoff, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm}, year={2014}, pages={25–34}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Christine Markarian, and Friedhelm Meyer auf der Heide.
“Randomized Online Algorithms for Set Cover Leasing Problems.” In Proceedings
of the 8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 25–34. LNCS, 2014. https://doi.org/10.1007/978-3-319-12691-3_3.
ieee: S. Abshoff, C. Markarian, and F. Meyer auf der Heide, “Randomized Online Algorithms
for Set Cover Leasing Problems,” in Proceedings of the 8th Annual International
Conference on Combinatorial Optimization and Applications (COCOA), 2014, pp.
25–34.
mla: Abshoff, Sebastian, et al. “Randomized Online Algorithms for Set Cover Leasing
Problems.” Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA), 2014, pp. 25–34, doi:10.1007/978-3-319-12691-3_3.
short: 'S. Abshoff, C. Markarian, F. Meyer auf der Heide, in: Proceedings of the
8th Annual International Conference on Combinatorial Optimization and Applications
(COCOA), 2014, pp. 25–34.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-12691-3_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:12:57Z
date_updated: 2018-03-20T07:12:57Z
file_id: '1395'
file_name: 379-COCOA14.pdf
file_size: 214299
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:12:57Z
has_accepted_license: '1'
page: 25-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 8th Annual International Conference on Combinatorial
Optimization and Applications (COCOA)
series_title: LNCS
status: public
title: Randomized Online Algorithms for Set Cover Leasing Problems
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '380'
abstract:
- lang: eng
text: 'Network creation games model the creation and usage costs of networks formed
by n selfish nodes. Each node v can buy a set of edges, each for a fixed price
α > 0. Its goal is to minimize its private costs, i.e., the sum (SUM-game, Fabrikant
et al., PODC 2003) or maximum (MAX-game, Demaine et al., PODC 2007) of distances
from v to all other nodes plus the prices of the bought edges. The above papers
show the existence of Nash equilibria as well as upper and lower bounds for the
prices of anarchy and stability. In several subsequent papers, these bounds were
improved for a wide range of prices α. In this paper, we extend these models by
incorporating quality-of-service aspects: Each edge cannot only be bought at a
fixed quality (edge length one) for a fixed price α. Instead, we assume that quality
levels (i.e., edge lengths) are varying in a fixed interval [βˇ,β^] , 0 series
= {LNCS}'
author:
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Alexander
full_name: Mäcker, Alexander
id: '13536'
last_name: Mäcker
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Cord-Landwehr A, Mäcker A, Meyer auf der Heide F. Quality of Service in Network
Creation Games. In: Proceedings of the 10th International Conference on Web
and Internet Economics (WINE). ; 2014:423-428. doi:10.1007/978-3-319-13129-0_34'
apa: Cord-Landwehr, A., Mäcker, A., & Meyer auf der Heide, F. (2014). Quality
of Service in Network Creation Games. In Proceedings of the 10th International
Conference on Web and Internet Economics (WINE) (pp. 423–428). https://doi.org/10.1007/978-3-319-13129-0_34
bibtex: '@inproceedings{Cord-Landwehr_Mäcker_Meyer auf der Heide_2014, title={Quality
of Service in Network Creation Games}, DOI={10.1007/978-3-319-13129-0_34},
booktitle={Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)}, author={Cord-Landwehr, Andreas and Mäcker, Alexander and Meyer
auf der Heide, Friedhelm}, year={2014}, pages={423–428} }'
chicago: Cord-Landwehr, Andreas, Alexander Mäcker, and Friedhelm Meyer auf der Heide.
“Quality of Service in Network Creation Games.” In Proceedings of the 10th
International Conference on Web and Internet Economics (WINE), 423–28, 2014.
https://doi.org/10.1007/978-3-319-13129-0_34.
ieee: A. Cord-Landwehr, A. Mäcker, and F. Meyer auf der Heide, “Quality of Service
in Network Creation Games,” in Proceedings of the 10th International Conference
on Web and Internet Economics (WINE), 2014, pp. 423–428.
mla: Cord-Landwehr, Andreas, et al. “Quality of Service in Network Creation Games.”
Proceedings of the 10th International Conference on Web and Internet Economics
(WINE), 2014, pp. 423–28, doi:10.1007/978-3-319-13129-0_34.
short: 'A. Cord-Landwehr, A. Mäcker, F. Meyer auf der Heide, in: Proceedings of
the 10th International Conference on Web and Internet Economics (WINE), 2014,
pp. 423–428.'
date_created: 2017-10-17T12:42:06Z
date_updated: 2022-01-06T06:59:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-13129-0_34
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-20T07:05:59Z
date_updated: 2018-03-20T07:05:59Z
file_id: '1394'
file_name: 380-WINE2014.pdf
file_size: 166640
relation: main_file
success: 1
file_date_updated: 2018-03-20T07:05:59Z
has_accepted_license: '1'
page: 423-428
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 10th International Conference on Web and Internet
Economics (WINE)
status: public
title: Quality of Service in Network Creation Games
type: conference
user_id: '15504'
year: '2014'
...
---
_id: '459'
abstract:
- lang: eng
text: In this survey article, we discuss two algorithmic research areas that emerge
from problems that arise when resources are offered in the cloud. The first area,
online leasing, captures problems arising from the fact that resources in the
cloud are not bought, but leased by cloud vendors. The second area, Distributed
Storage Systems, deals with problems arising from so-called cloud federations,
i.e., when several cloud providers are needed to fulfill a given task.
author:
- first_name: Sebastian
full_name: Kniesburges, Sebastian
last_name: Kniesburges
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Christian
full_name: Scheideler, Christian
id: '20792'
last_name: Scheideler
citation:
ama: 'Kniesburges S, Markarian C, Meyer auf der Heide F, Scheideler C. Algorithmic
Aspects of Resource Management in the Cloud. In: Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO).
LNCS. ; 2014:1-13. doi:10.1007/978-3-319-09620-9_1'
apa: Kniesburges, S., Markarian, C., Meyer auf der Heide, F., & Scheideler,
C. (2014). Algorithmic Aspects of Resource Management in the Cloud. In Proceedings
of the 21st International Colloquium on Structural Information and Communication
Complexity (SIROCCO) (pp. 1–13). https://doi.org/10.1007/978-3-319-09620-9_1
bibtex: '@inproceedings{Kniesburges_Markarian_Meyer auf der Heide_Scheideler_2014,
series={LNCS}, title={Algorithmic Aspects of Resource Management in the Cloud},
DOI={10.1007/978-3-319-09620-9_1},
booktitle={Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)}, author={Kniesburges, Sebastian and Markarian,
Christine and Meyer auf der Heide, Friedhelm and Scheideler, Christian}, year={2014},
pages={1–13}, collection={LNCS} }'
chicago: Kniesburges, Sebastian, Christine Markarian, Friedhelm Meyer auf der Heide,
and Christian Scheideler. “Algorithmic Aspects of Resource Management in the Cloud.”
In Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO), 1–13. LNCS, 2014. https://doi.org/10.1007/978-3-319-09620-9_1.
ieee: S. Kniesburges, C. Markarian, F. Meyer auf der Heide, and C. Scheideler, “Algorithmic
Aspects of Resource Management in the Cloud,” in Proceedings of the 21st International
Colloquium on Structural Information and Communication Complexity (SIROCCO),
2014, pp. 1–13.
mla: Kniesburges, Sebastian, et al. “Algorithmic Aspects of Resource Management
in the Cloud.” Proceedings of the 21st International Colloquium on Structural
Information and Communication Complexity (SIROCCO), 2014, pp. 1–13, doi:10.1007/978-3-319-09620-9_1.
short: 'S. Kniesburges, C. Markarian, F. Meyer auf der Heide, C. Scheideler, in:
Proceedings of the 21st International Colloquium on Structural Information and
Communication Complexity (SIROCCO), 2014, pp. 1–13.'
date_created: 2017-10-17T12:42:21Z
date_updated: 2022-01-06T07:01:14Z
ddc:
- '040'
department:
- _id: '79'
- _id: '63'
doi: 10.1007/978-3-319-09620-9_1
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-16T11:21:54Z
date_updated: 2018-03-16T11:21:54Z
file_id: '1338'
file_name: 459-SIROCCO2014.pdf
file_size: 274496
relation: main_file
success: 1
file_date_updated: 2018-03-16T11:21:54Z
has_accepted_license: '1'
page: 1-13
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 21st International Colloquium on Structural Information
and Communication Complexity (SIROCCO)
series_title: LNCS
status: public
title: Algorithmic Aspects of Resource Management in the Cloud
type: conference
user_id: '477'
year: '2014'
...
---
_id: '16870'
citation:
ama: 'Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013. Vol 8243. Berlin, Heidelberg: Springer; 2014. doi:10.1007/978-3-642-45346-5'
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2014). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013 (Vol. 8243). Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2014, place={Berlin, Heidelberg},
series={Lecture Notes in Computer Science}, title={Algorithms for Sensor Systems
- 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2014}, collection={Lecture Notes in Computer Science}
}'
chicago: 'Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics, {ALGOSENSORS} 2013. Vol. 8243. Lecture Notes in Computer Science.
Berlin, Heidelberg: Springer, 2014. https://doi.org/10.1007/978-3-642-45346-5.'
ieee: 'P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, vol. 8243. Berlin, Heidelberg: Springer, 2014.'
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics, {ALGOSENSORS} 2013. Vol. 8243, Springer, 2014, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Springer, Berlin, Heidelberg, 2014.
date_created: 2020-04-27T10:31:57Z
date_updated: 2022-01-06T06:52:58Z
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 8243'
language:
- iso: eng
place: Berlin, Heidelberg
publication_identifier:
isbn:
- '9783642453458'
- '9783642453465'
issn:
- 0302-9743
- 1611-3349
publication_status: published
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013
type: book_editor
user_id: '15415'
volume: 8243
year: '2014'
...
---
_id: '16394'
author:
- first_name: Tamás
full_name: Lukovszki, Tamás
last_name: Lukovszki
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Lukovszki T, Meyer auf der Heide F. Fast Collisionless Pattern Formation by
Anonymous, Position-Aware Robots. In: Lecture Notes in Computer Science.
Cham; 2014. doi:10.1007/978-3-319-14472-6_17'
apa: Lukovszki, T., & Meyer auf der Heide, F. (2014). Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots. In Lecture Notes in Computer
Science. Cham. https://doi.org/10.1007/978-3-319-14472-6_17
bibtex: '@inbook{Lukovszki_Meyer auf der Heide_2014, place={Cham}, title={Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots}, DOI={10.1007/978-3-319-14472-6_17},
booktitle={Lecture Notes in Computer Science}, author={Lukovszki, Tamás and Meyer
auf der Heide, Friedhelm}, year={2014} }'
chicago: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless
Pattern Formation by Anonymous, Position-Aware Robots.” In Lecture Notes in
Computer Science. Cham, 2014. https://doi.org/10.1007/978-3-319-14472-6_17.
ieee: T. Lukovszki and F. Meyer auf der Heide, “Fast Collisionless Pattern Formation
by Anonymous, Position-Aware Robots,” in Lecture Notes in Computer Science,
Cham, 2014.
mla: Lukovszki, Tamás, and Friedhelm Meyer auf der Heide. “Fast Collisionless Pattern
Formation by Anonymous, Position-Aware Robots.” Lecture Notes in Computer Science,
2014, doi:10.1007/978-3-319-14472-6_17.
short: 'T. Lukovszki, F. Meyer auf der Heide, in: Lecture Notes in Computer Science,
Cham, 2014.'
date_created: 2020-04-03T07:58:53Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-14472-6_17
language:
- iso: eng
place: Cham
publication: Lecture Notes in Computer Science
publication_identifier:
isbn:
- '9783319144719'
- '9783319144726'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Fast Collisionless Pattern Formation by Anonymous, Position-Aware Robots
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '16395'
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Meyer auf der Heide F. Continuous Aggregation in Dynamic Ad-Hoc
Networks. In: Structural Information and Communication Complexity. Cham;
2014. doi:10.1007/978-3-319-09620-9_16'
apa: Abshoff, S., & Meyer auf der Heide, F. (2014). Continuous Aggregation in
Dynamic Ad-Hoc Networks. In Structural Information and Communication Complexity.
Cham. https://doi.org/10.1007/978-3-319-09620-9_16
bibtex: '@inbook{Abshoff_Meyer auf der Heide_2014, place={Cham}, title={Continuous
Aggregation in Dynamic Ad-Hoc Networks}, DOI={10.1007/978-3-319-09620-9_16},
booktitle={Structural Information and Communication Complexity}, author={Abshoff,
Sebastian and Meyer auf der Heide, Friedhelm}, year={2014} }'
chicago: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” In Structural Information and Communication Complexity.
Cham, 2014. https://doi.org/10.1007/978-3-319-09620-9_16.
ieee: S. Abshoff and F. Meyer auf der Heide, “Continuous Aggregation in Dynamic
Ad-Hoc Networks,” in Structural Information and Communication Complexity,
Cham, 2014.
mla: Abshoff, Sebastian, and Friedhelm Meyer auf der Heide. “Continuous Aggregation
in Dynamic Ad-Hoc Networks.” Structural Information and Communication Complexity,
2014, doi:10.1007/978-3-319-09620-9_16.
short: 'S. Abshoff, F. Meyer auf der Heide, in: Structural Information and Communication
Complexity, Cham, 2014.'
date_created: 2020-04-03T09:00:16Z
date_updated: 2022-01-06T06:52:50Z
department:
- _id: '63'
doi: 10.1007/978-3-319-09620-9_16
language:
- iso: eng
place: Cham
publication: Structural Information and Communication Complexity
publication_identifier:
isbn:
- '9783319096193'
- '9783319096209'
issn:
- 0302-9743
- 1611-3349
publication_status: published
status: public
title: Continuous Aggregation in Dynamic Ad-Hoc Networks
type: book_chapter
user_id: '15415'
year: '2014'
...
---
_id: '27054'
author:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Gausemeier J, Grafe M, Meyer auf der Heide F. 11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung. In: Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, Band 311 ; 2013.'
apa: Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (2013). 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung. 311.
bibtex: '@inproceedings{Gausemeier_Grafe_Meyer auf der Heide_2013, title={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, volume={311},
publisher={Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Band
311 }, author={Gausemeier, Jürgen and Grafe, Michael and Meyer auf der Heide,
Friedhelm}, year={2013} }'
chicago: Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide. “11.
Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung,”
Vol. 311. Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Band 311
, 2013.
ieee: J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, “11. Paderborner Workshop
Augmented & Virtual Reality in der Produktentstehung,” 2013, vol. 311.
mla: Gausemeier, Jürgen, et al. 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung. Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, Band 311 , 2013.
short: 'J. Gausemeier, M. Grafe, F. Meyer auf der Heide, in: Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, Band 311 , 2013.'
conference:
name: 18. - 19. Apr. 2013, Heinz Nixdorf Institut
date_created: 2021-11-02T10:53:04Z
date_updated: 2022-01-06T06:57:33Z
department:
- _id: '672'
intvolume: ' 311'
language:
- iso: eng
publisher: 'Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, Band 311 '
status: public
title: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
type: conference
user_id: '21240'
volume: 311
year: '2013'
...
---
_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: '17442'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Meyer auf der Heide F. Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen. In: 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn; 2013:7-16.'
apa: Meyer auf der Heide, F. (2013). Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen. 11. Paderborner Workshop Augmented & Virtual Reality
in Der Produktentstehung, 311, 7–16.
bibtex: '@inproceedings{Meyer auf der Heide_2013, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={Algorithmische Grundlagen für
die Selbstorganisation von Roboterschwärmen}, volume={311}, booktitle={11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, author={Meyer auf der Heide, Friedhelm},
year={2013}, pages={7–16}, collection={Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn} }'
chicago: Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation
von Roboterschwärmen.” In 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, 311:7–16. Verlagsschriftenreihe Des Heinz
Nixdorf Instituts, Paderborn. Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2013.
ieee: F. Meyer auf der Heide, “Algorithmische Grundlagen für die Selbstorganisation
von Roboterschwärmen,” in 11. Paderborner Workshop Augmented & Virtual
Reality in der Produktentstehung, 2013, vol. 311, pp. 7–16.
mla: Meyer auf der Heide, Friedhelm. “Algorithmische Grundlagen Für Die Selbstorganisation
von Roboterschwärmen.” 11. Paderborner Workshop Augmented & Virtual Reality
in Der Produktentstehung, vol. 311, Verlagsschriftenreihe des Heinz Nixdorf
Instituts, Paderborn, 2013, pp. 7–16.
short: 'F. Meyer auf der Heide, in: 11. Paderborner Workshop Augmented & Virtual
Reality in Der Produktentstehung, Verlagsschriftenreihe des Heinz Nixdorf Instituts,
Paderborn, 2013, pp. 7–16.'
date_created: 2020-07-29T09:44:04Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
intvolume: ' 311'
language:
- iso: eng
page: 7-16
publication: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: Algorithmische Grundlagen für die Selbstorganisation von Roboterschwärmen
type: conference
user_id: '5786'
volume: 311
year: '2013'
...
---
_id: '17443'
citation:
ama: Gausemeier J, Grafe M, Meyer auf der Heide F, eds. 11. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung. Vol 311. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn; 2013.
apa: Gausemeier, J., Grafe, M., & Meyer auf der Heide, F. (Eds.). (2013). 11.
Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
(Vol. 311). Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn.
bibtex: '@book{Gausemeier_Grafe_Meyer auf der Heide_2013, series={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, title={11. Paderborner Workshop Augmented
& Virtual Reality in der Produktentstehung}, volume={311}, publisher={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn}, year={2013}, collection={Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn} }'
chicago: Gausemeier, Jürgen, Michael Grafe, and Friedhelm Meyer auf der Heide, eds.
11. Paderborner Workshop Augmented & Virtual Reality in Der Produktentstehung.
Vol. 311. Verlagsschriftenreihe Des Heinz Nixdorf Instituts, Paderborn. Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2013.
ieee: J. Gausemeier, M. Grafe, and F. Meyer auf der Heide, Eds., 11. Paderborner
Workshop Augmented & Virtual Reality in der Produktentstehung, vol. 311.
Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn, 2013.
mla: Gausemeier, Jürgen, et al., editors. 11. Paderborner Workshop Augmented
& Virtual Reality in Der Produktentstehung. Verlagsschriftenreihe des
Heinz Nixdorf Instituts, Paderborn, 2013.
short: J. Gausemeier, M. Grafe, F. Meyer auf der Heide, eds., 11. Paderborner Workshop
Augmented & Virtual Reality in Der Produktentstehung, Verlagsschriftenreihe
des Heinz Nixdorf Instituts, Paderborn, 2013.
date_created: 2020-07-29T09:52:31Z
date_updated: 2022-01-06T06:53:12Z
department:
- _id: '63'
- _id: '26'
editor:
- first_name: Jürgen
full_name: Gausemeier, Jürgen
last_name: Gausemeier
- first_name: Michael
full_name: Grafe, Michael
last_name: Grafe
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
intvolume: ' 311'
language:
- iso: eng
publisher: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
series_title: Verlagsschriftenreihe des Heinz Nixdorf Instituts, Paderborn
status: public
title: 11. Paderborner Workshop Augmented & Virtual Reality in der Produktentstehung
type: conference_editor
user_id: '5786'
volume: 311
year: '2013'
...
---
_id: '477'
abstract:
- lang: eng
text: We consider the k-token dissemination problem, where k initially arbitrarily
distributed tokens have to be disseminated to all nodes in a dynamic network (as
introduced by Kuhn et al., STOC 2010). In contrast to general dynamic networks,
our dynamic networks are unit disk graphs, i.e., nodes are embedded into the Euclidean
plane and two nodes are connected if and only if their distance is at most R.
Our worst-case adversary is allowed to move the nodes on the plane, but the maximum
velocity v_max of each node is limited and the graph must be connected in each
round. For this model, we provide almost tight lower and upper bounds for k-token
dissemination if nodes are restricted to send only one token per round. It turns
out that the maximum velocity v_max is a meaningful parameter to characterize
dynamics in our model.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Andreas
full_name: Cord-Landwehr, Andreas
last_name: Cord-Landwehr
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Cord-Landwehr A, Malatyali M, Meyer auf der Heide F.
Token Dissemination in Geometric Dynamic Networks. In: Algorithms for Sensor
Systems - 9th International Symposium on Algorithms and Experiments for Sensor
Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013, Sophia
Antipolis, France, September 5-6, 2013, Revised Selected Papers. Lecture Notes
in Computer Science. ; 2013:22-34. doi:10.1007/978-3-642-45346-5_3'
apa: Abshoff, S., Benter, M., Cord-Landwehr, A., Malatyali, M., & Meyer auf
der Heide, F. (2013). Token Dissemination in Geometric Dynamic Networks. In Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers
(pp. 22–34). https://doi.org/10.1007/978-3-642-45346-5_3
bibtex: '@inproceedings{Abshoff_Benter_Cord-Landwehr_Malatyali_Meyer auf der Heide_2013,
series={Lecture Notes in Computer Science}, title={Token Dissemination in Geometric
Dynamic Networks}, DOI={10.1007/978-3-642-45346-5_3},
booktitle={Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers}, author={Abshoff, Sebastian and Benter, Markus and Cord-Landwehr, Andreas
and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={22–34},
collection={Lecture Notes in Computer Science} }'
chicago: Abshoff, Sebastian, Markus Benter, Andreas Cord-Landwehr, Manuel Malatyali,
and Friedhelm Meyer auf der Heide. “Token Dissemination in Geometric Dynamic Networks.”
In Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 22–34. Lecture Notes in Computer Science, 2013. https://doi.org/10.1007/978-3-642-45346-5_3.
ieee: S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, and F. Meyer auf der
Heide, “Token Dissemination in Geometric Dynamic Networks,” in Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS} 2013,
Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers, 2013,
pp. 22–34.
mla: Abshoff, Sebastian, et al. “Token Dissemination in Geometric Dynamic Networks.”
Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, {ALGOSENSORS}
2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected Papers,
2013, pp. 22–34, doi:10.1007/978-3-642-45346-5_3.
short: 'S. Abshoff, M. Benter, A. Cord-Landwehr, M. Malatyali, F. Meyer auf der
Heide, in: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers, 2013, pp. 22–34.'
date_created: 2017-10-17T12:42:25Z
date_updated: 2022-01-06T07:01:21Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_3
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T14:06:38Z
date_updated: 2018-03-15T14:06:38Z
file_id: '1325'
file_name: 477-geometric-dynamic-networks_01.pdf
file_size: 193169
relation: main_file
success: 1
file_date_updated: 2018-03-15T14:06:38Z
has_accepted_license: '1'
page: 22-34
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics,
{ALGOSENSORS} 2013, Sophia Antipolis, France, September 5-6, 2013, Revised Selected
Papers
series_title: Lecture Notes in Computer Science
status: public
title: Token Dissemination in Geometric Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '507'
abstract:
- lang: eng
text: We study two-party communication in the context of directed dynamic networks
that are controlled by an adaptive adversary. This adversary is able to change
all edges as long as the networks stay strongly-connected in each round. In this
work, we establish a relation between counting the total number of nodes in the
network and the problem of exchanging tokens between two communication partners
which communicate through a dynamic network. We show that the communication problem
for a constant fraction of n tokens in a dynamic network with n nodes is at most
as hard as counting the number of nodes in a dynamic network with at most 4n+3
nodes. For the proof, we construct a family of directed dynamic networks and apply
a lower bound from two-party communication complexity.
author:
- first_name: Sebastian
full_name: Abshoff, Sebastian
last_name: Abshoff
- first_name: Markus
full_name: Benter, Markus
last_name: Benter
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Abshoff S, Benter M, Malatyali M, Meyer auf der Heide F. On Two-Party Communication
Through Dynamic Networks. In: Proceedings of the 17th International Conference
on Principles of Distributed Systems (OPODIS). LNCS. ; 2013:11-22. doi:10.1007/978-3-319-03850-6_2'
apa: Abshoff, S., Benter, M., Malatyali, M., & Meyer auf der Heide, F. (2013).
On Two-Party Communication Through Dynamic Networks. In Proceedings of the
17th International Conference on Principles of Distributed Systems (OPODIS)
(pp. 11–22). https://doi.org/10.1007/978-3-319-03850-6_2
bibtex: '@inproceedings{Abshoff_Benter_Malatyali_Meyer auf der Heide_2013, series={LNCS},
title={On Two-Party Communication Through Dynamic Networks}, DOI={10.1007/978-3-319-03850-6_2},
booktitle={Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)}, author={Abshoff, Sebastian and Benter, Markus and Malatyali,
Manuel and Meyer auf der Heide, Friedhelm}, year={2013}, pages={11–22}, collection={LNCS}
}'
chicago: Abshoff, Sebastian, Markus Benter, Manuel Malatyali, and Friedhelm Meyer
auf der Heide. “On Two-Party Communication Through Dynamic Networks.” In Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
11–22. LNCS, 2013. https://doi.org/10.1007/978-3-319-03850-6_2.
ieee: S. Abshoff, M. Benter, M. Malatyali, and F. Meyer auf der Heide, “On Two-Party
Communication Through Dynamic Networks,” in Proceedings of the 17th International
Conference on Principles of Distributed Systems (OPODIS), 2013, pp. 11–22.
mla: Abshoff, Sebastian, et al. “On Two-Party Communication Through Dynamic Networks.”
Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS), 2013, pp. 11–22, doi:10.1007/978-3-319-03850-6_2.
short: 'S. Abshoff, M. Benter, M. Malatyali, F. Meyer auf der Heide, in: Proceedings
of the 17th International Conference on Principles of Distributed Systems (OPODIS),
2013, pp. 11–22.'
date_created: 2017-10-17T12:42:31Z
date_updated: 2022-01-06T07:01:36Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-319-03850-6_2
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:47:31Z
date_updated: 2018-03-15T10:47:31Z
file_id: '1305'
file_name: 507-on-two-party-communication-through-dynamic-networks_01.pdf
file_size: 181398
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:47:31Z
has_accepted_license: '1'
page: 11-22
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 17th International Conference on Principles of Distributed
Systems (OPODIS)
series_title: LNCS
status: public
title: On Two-Party Communication Through Dynamic Networks
type: conference
user_id: '15504'
year: '2013'
...
---
_id: '524'
abstract:
- lang: eng
text: 'We study the complexity theory for the local distributed setting introduced
by Korman, Peleg and Fraigniaud. They have defined three complexity classes LD
(Local Decision), NLD (Nondeterministic Local Decision) and NLD^#n. The class
LD consists of all languages which can be decided with a constant number of communication
rounds. The class NLD consists of all languages which can be verified by a nondeterministic
algorithm with a constant number of communication rounds. In order to define the
nondeterministic classes, they have transferred the notation of nondeterminism
into the distributed setting by the use of certificates and verifiers. The class
NLD^#n consists of all languages which can be verified by a nondeterministic algorithm
where each node has access to an oracle for the number of nodes. They have shown
the hierarchy LD subset NLD subset NLD^#n. Our main contributions are strict hierarchies
within the classes defined by Korman, Peleg and Fraigniaud. We define additional
complexity classes: the class LD(t) consists of all languages which can be decided
with at most t communication rounds. The class NLD-O(f) consists of all languages
which can be verified by a local verifier such that the size of the certificates
that are needed to verify the language are bounded by a function from O(f). Our
main results are refined strict hierarchies within these nondeterministic classes.'
author:
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Kamil
full_name: Swirkot, Kamil
last_name: Swirkot
citation:
ama: Meyer auf der Heide F, Swirkot K. Hierarchies in Local Distributed Decision.
2013.
apa: Meyer auf der Heide, F., & Swirkot, K. (2013). Hierarchies in Local Distributed
Decision. arXiv.
bibtex: '@article{Meyer auf der Heide_Swirkot_2013, title={Hierarchies in Local
Distributed Decision}, publisher={arXiv}, author={Meyer auf der Heide, Friedhelm
and Swirkot, Kamil}, year={2013} }'
chicago: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. “Hierarchies in Local
Distributed Decision.” arXiv, 2013.
ieee: F. Meyer auf der Heide and K. Swirkot, “Hierarchies in Local Distributed Decision.”
arXiv, 2013.
mla: Meyer auf der Heide, Friedhelm, and Kamil Swirkot. Hierarchies in Local
Distributed Decision. arXiv, 2013.
short: F. Meyer auf der Heide, K. Swirkot, (2013).
date_created: 2017-10-17T12:42:34Z
date_updated: 2022-01-06T07:01:48Z
ddc:
- '040'
department:
- _id: '63'
external_id:
arxiv:
- '1311.7229'
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:37:07Z
date_updated: 2018-03-15T10:37:07Z
file_id: '1296'
file_name: 524-paper_01.pdf
file_size: 534906
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:37:07Z
has_accepted_license: '1'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: arXiv
status: public
title: Hierarchies in Local Distributed Decision
type: preprint
user_id: '15415'
year: '2013'
...
---
_id: '558'
citation:
ama: Flocchini P, Gao J, Kranakis E, Meyer auf der Heide F, eds. Algorithms for
Sensor Systems - 9th International Symposium on Algorithms and Experiments for
Sensor Systems, Wireless Networks and Distributed Robotics. Vol 8243. Springer;
2013. doi:10.1007/978-3-642-45346-5
apa: 'Flocchini, P., Gao, J., Kranakis, E., & Meyer auf der Heide, F. (Eds.).
(2013). Algorithms for Sensor Systems - 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(Vol. 8243). Presented at the ALGOSENSORS 2013, Sophia Antipolis, France: Springer.
https://doi.org/10.1007/978-3-642-45346-5'
bibtex: '@book{Flocchini_Gao_Kranakis_Meyer auf der Heide_2013, series={LNCS}, title={Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics}, volume={8243},
DOI={10.1007/978-3-642-45346-5},
publisher={Springer}, year={2013}, collection={LNCS} }'
chicago: Flocchini, Paola, Jie Gao, Evangelos Kranakis, and Friedhelm Meyer auf
der Heide, eds. Algorithms for Sensor Systems - 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics. Vol. 8243. LNCS. Springer, 2013. https://doi.org/10.1007/978-3-642-45346-5.
ieee: P. Flocchini, J. Gao, E. Kranakis, and F. Meyer auf der Heide, Eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, vol. 8243.
Springer, 2013.
mla: Flocchini, Paola, et al., editors. Algorithms for Sensor Systems - 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics. Vol. 8243, Springer, 2013, doi:10.1007/978-3-642-45346-5.
short: P. Flocchini, J. Gao, E. Kranakis, F. Meyer auf der Heide, eds., Algorithms
for Sensor Systems - 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics, Springer, 2013.
conference:
end_date: 2013-09-06
location: Sophia Antipolis, France
name: ALGOSENSORS 2013
start_date: 2013-09-05
date_created: 2017-10-17T12:42:41Z
date_updated: 2022-01-06T07:02:02Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5
editor:
- first_name: Paola
full_name: Flocchini, Paola
last_name: Flocchini
- first_name: Jie
full_name: Gao, Jie
last_name: Gao
- first_name: Evangelos
full_name: Kranakis, Evangelos
last_name: Kranakis
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
file:
- access_level: closed
content_type: application/pdf
creator: ups
date_created: 2018-11-02T16:29:07Z
date_updated: 2018-11-02T16:29:07Z
file_id: '5327'
file_name: 2014_Book_AlgorithmsForSensorSystems-1.pdf
file_size: 9186107
relation: main_file
success: 1
file_date_updated: 2018-11-02T16:29:07Z
has_accepted_license: '1'
intvolume: ' 8243'
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publisher: Springer
series_title: LNCS
status: public
title: Algorithms for Sensor Systems - 9th International Symposium on Algorithms and
Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
type: conference_editor
user_id: '477'
volume: 8243
year: '2013'
...
---
_id: '563'
abstract:
- lang: eng
text: Dominating set based virtual backbones are used for rou-ting in wireless ad-hoc
networks. Such backbones receive and transmit messages from/to every node in the
network. Existing distributed algorithms only consider undirected graphs, which
model symmetric networks with uniform transmission ranges. We are particularly
interested in the well-established disk graphs, which model asymmetric networks
with non-uniform transmission ranges. The corresponding graph theoretic problem
seeks a strongly connected dominating-absorbent set of minimum cardinality in
a digraph. A subset of nodes in a digraph is a strongly connected dominating-absorbent
set if the subgraph induced by these nodes is strongly connected and each node
in the graph is either in the set or has both an in-neighbor and an out-neighbor
in it. We introduce the first distributed algorithm for this problem in disk graphs.
The algorithm gives an O(k^4) -approximation ratio and has a runtime bound of
O(Diam) where Diam is the diameter of the graph and k denotes the transmission
ratio r_{max}/r_{min} with r_{max} and r_{min} being the maximum and minimum transmission
range, respectively. Moreover, we apply our algorithm on the subgraph of disk
graphs consisting of only bidirectional edges. Our algorithm gives an O(ln k)
-approximation and a runtime bound of O(k^8 log^∗ n) , which, for bounded k ,
is an optimal approximation for the problem, following Lenzen and Wattenhofer’s
Ω(log^∗ n) runtime lower bound for distributed constant approximation in disk
graphs.
author:
- first_name: Christine
full_name: Markarian, Christine
id: '37612'
last_name: Markarian
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
- first_name: Michael
full_name: Schubert, Michael
last_name: Schubert
citation:
ama: 'Markarian C, Meyer auf der Heide F, Schubert M. A Distributed Approximation
Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
Ad-Hoc Networks. In: Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS). LNCS. ; 2013:217-227. doi:10.1007/978-3-642-45346-5_16'
apa: Markarian, C., Meyer auf der Heide, F., & Schubert, M. (2013). A Distributed
Approximation Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric
Wireless Ad-Hoc Networks. In Proceedings of the 9th International Symposium
on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed
Robotics (ALGOSENSORS) (pp. 217–227). https://doi.org/10.1007/978-3-642-45346-5_16
bibtex: '@inproceedings{Markarian_Meyer auf der Heide_Schubert_2013, series={LNCS},
title={A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks}, DOI={10.1007/978-3-642-45346-5_16},
booktitle={Proceedings of the 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)},
author={Markarian, Christine and Meyer auf der Heide, Friedhelm and Schubert,
Michael}, year={2013}, pages={217–227}, collection={LNCS} }'
chicago: Markarian, Christine, Friedhelm Meyer auf der Heide, and Michael Schubert.
“A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks.” In Proceedings of the 9th International
Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks
and Distributed Robotics (ALGOSENSORS), 217–27. LNCS, 2013. https://doi.org/10.1007/978-3-642-45346-5_16.
ieee: C. Markarian, F. Meyer auf der Heide, and M. Schubert, “A Distributed Approximation
Algorithm for Strongly Connected Dominating-Absorbent Sets in Asymmetric Wireless
Ad-Hoc Networks,” in Proceedings of the 9th International Symposium on Algorithms
and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics
(ALGOSENSORS), 2013, pp. 217–227.
mla: Markarian, Christine, et al. “A Distributed Approximation Algorithm for Strongly
Connected Dominating-Absorbent Sets in Asymmetric Wireless Ad-Hoc Networks.” Proceedings
of the 9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–27,
doi:10.1007/978-3-642-45346-5_16.
short: 'C. Markarian, F. Meyer auf der Heide, M. Schubert, in: Proceedings of the
9th International Symposium on Algorithms and Experiments for Sensor Systems,
Wireless Networks and Distributed Robotics (ALGOSENSORS), 2013, pp. 217–227.'
date_created: 2017-10-17T12:42:42Z
date_updated: 2022-01-06T07:02:13Z
ddc:
- '040'
department:
- _id: '63'
doi: 10.1007/978-3-642-45346-5_16
file:
- access_level: closed
content_type: application/pdf
creator: florida
date_created: 2018-03-15T10:25:15Z
date_updated: 2018-03-15T10:25:15Z
file_id: '1278'
file_name: 563-978-3-642-45346-5_16.pdf
file_size: 348191
relation: main_file
success: 1
file_date_updated: 2018-03-15T10:25:15Z
has_accepted_license: '1'
page: 217-227
project:
- _id: '1'
name: SFB 901
- _id: '5'
name: SFB 901 - Subprojekt A1
- _id: '2'
name: SFB 901 - Project Area A
publication: Proceedings of the 9th International Symposium on Algorithms and Experiments
for Sensor Systems, Wireless Networks and Distributed Robotics (ALGOSENSORS)
series_title: LNCS
status: public
title: A Distributed Approximation Algorithm for Strongly Connected Dominating-Absorbent
Sets in Asymmetric Wireless Ad-Hoc Networks
type: conference
user_id: '477'
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'
...