Research and application of a new rectangle intersection algorithm

Chenghui Zhao, Feng Xu, Xuan Liu
{"title":"Research and application of a new rectangle intersection algorithm","authors":"Chenghui Zhao, Feng Xu, Xuan Liu","doi":"10.1109/ICAL.2012.6308231","DOIUrl":null,"url":null,"abstract":"Rectangles' intersecting includes several situations like intersecting, containing, enclosing and crossing. Rectangle intersection algorithm is a more complex algorithm. Some of traditional algorithms are incomplete, for example, vertex detection algorithm ignores the situation of crossing and edges crossing algorithm ignores the situation of containing and enclosing. Some solved the problem successfully. But they separated the problem into several sub cases which needs to judge all kinds of conditions with complex formulas. In this paper, we design a new rectangle intersection algorithm based on ISO-oriented rectangles which successfully solves the rectangle intersection problem using one simple and perfect judgment formula. We also use this algorithm combined with the Google map technology to achieve a regional retrieval system. It is verified to be simple, comprehensive and practical through the tests.","PeriodicalId":373152,"journal":{"name":"2012 IEEE International Conference on Automation and Logistics","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE International Conference on Automation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAL.2012.6308231","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Rectangles' intersecting includes several situations like intersecting, containing, enclosing and crossing. Rectangle intersection algorithm is a more complex algorithm. Some of traditional algorithms are incomplete, for example, vertex detection algorithm ignores the situation of crossing and edges crossing algorithm ignores the situation of containing and enclosing. Some solved the problem successfully. But they separated the problem into several sub cases which needs to judge all kinds of conditions with complex formulas. In this paper, we design a new rectangle intersection algorithm based on ISO-oriented rectangles which successfully solves the rectangle intersection problem using one simple and perfect judgment formula. We also use this algorithm combined with the Google map technology to achieve a regional retrieval system. It is verified to be simple, comprehensive and practical through the tests.
一种新的矩形交算法的研究与应用
矩形的相交包括相交、包含、包围和交叉等几种情况。矩形交算法是一种较为复杂的算法。一些传统的算法是不完备的,例如顶点检测算法忽略了交叉的情况,边交叉算法忽略了包含和包围的情况。一些人成功地解决了这个问题。但是他们把问题分成了几个子情况,需要用复杂的公式来判断各种条件。本文设计了一种新的基于iso定向矩形的矩形交会算法,用一个简单完善的判断公式成功地解决了矩形交会问题。我们还将该算法与Google地图技术相结合,实现了一个区域检索系统。通过测试,证明该方法简单、全面、实用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信