使用交互式SVG地图的最短路径仿真

J. Sidi, Liew Wei Fa, Syahrul Nizam Junaini
{"title":"使用交互式SVG地图的最短路径仿真","authors":"J. Sidi, Liew Wei Fa, Syahrul Nizam Junaini","doi":"10.1109/ICCTD.2009.204","DOIUrl":null,"url":null,"abstract":"This paper presents reports a design and development of the interactive map using Scalable Vector Graphics (SVG) that can be used to find the shortest path. Using our interactive map, the user will be able to set the route or path to the desired location. If that path is congested, the map will find the second shortest path to the user. In the usability study, we have tested the map with the mean value of 4.76 out of 5.","PeriodicalId":269403,"journal":{"name":"2009 International Conference on Computer Technology and Development","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2009-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Shortest Path Simulation Using Interactive SVG Map\",\"authors\":\"J. Sidi, Liew Wei Fa, Syahrul Nizam Junaini\",\"doi\":\"10.1109/ICCTD.2009.204\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents reports a design and development of the interactive map using Scalable Vector Graphics (SVG) that can be used to find the shortest path. Using our interactive map, the user will be able to set the route or path to the desired location. If that path is congested, the map will find the second shortest path to the user. In the usability study, we have tested the map with the mean value of 4.76 out of 5.\",\"PeriodicalId\":269403,\"journal\":{\"name\":\"2009 International Conference on Computer Technology and Development\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-11-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer Technology and Development\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCTD.2009.204\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Computer Technology and Development","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCTD.2009.204","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

本文介绍了一种基于可伸缩矢量图形(SVG)的交互式地图的设计和开发,该地图可用于寻找最短路径。使用我们的交互式地图,用户将能够设置到所需位置的路线或路径。如果该路径拥塞,映射将找到到用户的第二条最短路径。在可用性研究中,我们测试了地图的平均值为4.76(满分5分)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Shortest Path Simulation Using Interactive SVG Map
This paper presents reports a design and development of the interactive map using Scalable Vector Graphics (SVG) that can be used to find the shortest path. Using our interactive map, the user will be able to set the route or path to the desired location. If that path is congested, the map will find the second shortest path to the user. In the usability study, we have tested the map with the mean value of 4.76 out of 5.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research and Application of SOA in B2B Electronic Commerce Butterfly Subdivision Scheme Used for the Unorganized Points Reconstruction in Virtual Environment Notice of RetractionProblems and Countermeasures of Public Sector Human Resource Management In China Innovating IT Education and Accelerating IT Service Outsourcing Talent Training An Efficient Image Compression Technique Using Peak Transform
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1