Mohsen Kanani, Yousif Al-Jabir, Salem Al-Ghanim, O. Halabi
{"title":"增强的重定向行走算法","authors":"Mohsen Kanani, Yousif Al-Jabir, Salem Al-Ghanim, O. Halabi","doi":"10.1109/ICTA.2017.8336063","DOIUrl":null,"url":null,"abstract":"The redirected walking algorithm (RDW) is a locomotion technique that gives the user the perception of walking in larger or infinite virtual environment (VE) within small and limited tracking area. The available approaches which are derived from the original algorithm such as Steer-to-Orbit (S2O) and Steer-to-Center (S2C) proved its effectiveness for certain use cases, however, it requires a very large tracking space. In this paper, we present a new algorithm that can combine the benefits of the both S2O and S2C techniques. The algorithm is based on Hypotrochoid equations which enabled us to generate many redirection paths with unique shapes. We present two new redirection paths with promising results.","PeriodicalId":129665,"journal":{"name":"2017 6th International Conference on Information and Communication Technology and Accessibility (ICTA)","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Enhanced redirected walking algorithm\",\"authors\":\"Mohsen Kanani, Yousif Al-Jabir, Salem Al-Ghanim, O. Halabi\",\"doi\":\"10.1109/ICTA.2017.8336063\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The redirected walking algorithm (RDW) is a locomotion technique that gives the user the perception of walking in larger or infinite virtual environment (VE) within small and limited tracking area. The available approaches which are derived from the original algorithm such as Steer-to-Orbit (S2O) and Steer-to-Center (S2C) proved its effectiveness for certain use cases, however, it requires a very large tracking space. In this paper, we present a new algorithm that can combine the benefits of the both S2O and S2C techniques. The algorithm is based on Hypotrochoid equations which enabled us to generate many redirection paths with unique shapes. We present two new redirection paths with promising results.\",\"PeriodicalId\":129665,\"journal\":{\"name\":\"2017 6th International Conference on Information and Communication Technology and Accessibility (ICTA)\",\"volume\":\"58 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 6th International Conference on Information and Communication Technology and Accessibility (ICTA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTA.2017.8336063\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 6th International Conference on Information and Communication Technology and Accessibility (ICTA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTA.2017.8336063","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The redirected walking algorithm (RDW) is a locomotion technique that gives the user the perception of walking in larger or infinite virtual environment (VE) within small and limited tracking area. The available approaches which are derived from the original algorithm such as Steer-to-Orbit (S2O) and Steer-to-Center (S2C) proved its effectiveness for certain use cases, however, it requires a very large tracking space. In this paper, we present a new algorithm that can combine the benefits of the both S2O and S2C techniques. The algorithm is based on Hypotrochoid equations which enabled us to generate many redirection paths with unique shapes. We present two new redirection paths with promising results.