|
|
|
|
| LEADER |
01000naa a22002652 4500 |
| 001 |
NLM335181171 |
| 003 |
DE-627 |
| 005 |
20231225225255.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231225s2023 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2021.3139990
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1117.xml
|
| 035 |
|
|
|a (DE-627)NLM335181171
|
| 035 |
|
|
|a (NLM)34982685
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Zhang, Song-Hai
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Adaptive Optimization Algorithm for Resetting Techniques in Obstacle-Ridden Environments
|
| 264 |
|
1 |
|c 2023
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 10.04.2023
|
| 500 |
|
|
|a Date Revised 11.04.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Redirected Walking (RDW) algorithms aim to impose several types of gains on users immersed in Virtual Reality and distort their walking paths in the real world, thus enabling them to explore a larger space. Since collision with physical boundaries is inevitable, a reset strategy needs to be provided to allow users to reset when they hit the boundary. However, most reset strategies are based on simple heuristics by choosing a seemingly suitable solution, which may not perform well in practice. In this article, we propose a novel optimization-based reset algorithm adaptive to different RDW algorithms. Inspired by the approach of finite element analysis, our algorithm splits the boundary of the physical world by a set of endpoints. Each endpoint is assigned a reset vector to represent the optimized reset direction when hitting the boundary. The reset vectors on the edge will be determined by the interpolation between two neighbouring endpoints. We conduct simulation-based experiments for three RDW algorithms with commonly used reset algorithms to compare with. The results demonstrate that the proposed algorithm significantly reduces the number of resets
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Chen, Chia-Hao
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Zheng, Fu
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Yang, Yong-Liang
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Hu, Shi-Min
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 29(2023), 4 vom: 04. Apr., Seite 2080-2092
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:29
|g year:2023
|g number:4
|g day:04
|g month:04
|g pages:2080-2092
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2021.3139990
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 29
|j 2023
|e 4
|b 04
|c 04
|h 2080-2092
|