利用符号距离域快速确定微拓扑关系

R. Schubotz, Christian Vogelgesang, D. Rubinstein
{"title":"利用符号距离域快速确定微拓扑关系","authors":"R. Schubotz, Christian Vogelgesang, D. Rubinstein","doi":"10.1109/IRC.2018.00031","DOIUrl":null,"url":null,"abstract":"Although mereotopological relationship theories and their qualification problems have been extensively studied in R^2, the qualification of mereotopological relations in R^3 remains challenging. This is due to the limited availability of topological operators and high costs of boundary intersection tests. In this paper, a novel qualification technique for mereotopological relations in R^3 is presented. Our technique rapidly computes RCC-8 base relations using precomputed signed distance fields, and makes no assumptions with regards to complexity or representation method of the spatial entities under consideration.","PeriodicalId":416113,"journal":{"name":"2018 Second IEEE International Conference on Robotic Computing (IRC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Rapid Qualification of Mereotopological Relationships Using Signed Distance Fields\",\"authors\":\"R. Schubotz, Christian Vogelgesang, D. Rubinstein\",\"doi\":\"10.1109/IRC.2018.00031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Although mereotopological relationship theories and their qualification problems have been extensively studied in R^2, the qualification of mereotopological relations in R^3 remains challenging. This is due to the limited availability of topological operators and high costs of boundary intersection tests. In this paper, a novel qualification technique for mereotopological relations in R^3 is presented. Our technique rapidly computes RCC-8 base relations using precomputed signed distance fields, and makes no assumptions with regards to complexity or representation method of the spatial entities under consideration.\",\"PeriodicalId\":416113,\"journal\":{\"name\":\"2018 Second IEEE International Conference on Robotic Computing (IRC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Second IEEE International Conference on Robotic Computing (IRC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IRC.2018.00031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Second IEEE International Conference on Robotic Computing (IRC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRC.2018.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

虽然在R^2中已经广泛地研究了气象拓扑关系理论及其定性问题,但在R^3中气象拓扑关系的定性仍然具有挑战性。这是由于拓扑算子的可用性有限和边界交集测试的高成本。本文提出了一种新的R^3元拓扑关系的定性方法。我们的技术使用预先计算的带符号距离域快速计算RCC-8基关系,并且不考虑所考虑的空间实体的复杂性或表示方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Rapid Qualification of Mereotopological Relationships Using Signed Distance Fields
Although mereotopological relationship theories and their qualification problems have been extensively studied in R^2, the qualification of mereotopological relations in R^3 remains challenging. This is due to the limited availability of topological operators and high costs of boundary intersection tests. In this paper, a novel qualification technique for mereotopological relations in R^3 is presented. Our technique rapidly computes RCC-8 base relations using precomputed signed distance fields, and makes no assumptions with regards to complexity or representation method of the spatial entities under consideration.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Learning a Set of Interrelated Tasks by Using Sequences of Motor Policies for a Strategic Intrinsically Motivated Learner Improving Code Quality in ROS Packages Using a Temporal Extension of First-Order Logic Rapid Qualification of Mereotopological Relationships Using Signed Distance Fields Towards a Multi-mission QoS and Energy Manager for Autonomous Mobile Robots A Computational Framework for Complementary Situational Awareness (CSA) in Surgical Assistant Robots
×
引用
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